A medical data integrity verification and transmission security protection system and method

By combining dynamic hash chains and quantum noise encryption with adaptive integrity verification, the problem of dynamically balancing security and efficiency in medical data transmission is solved. This approach achieves encryption security and error correction capabilities against replay attacks and hash collisions, thereby improving the system's robustness and transmission reliability.

CN123122929APending Publication Date: 2026-11-17JIANGSU JINSHANBAI NETWORK TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202611333601.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-08-31
Publication Date
2026-11-17

AI Technical Summary

Technical Problem

Existing medical data transmission solutions lack the ability to trace the temporal correlation between data blocks, are difficult to resist replay attacks and hash collisions, cannot dynamically adjust the redundancy of forward error correction codes, have low bandwidth utilization, and the encryption keys of deterministic algorithms are easily cracked by quantum computing. Furthermore, they lack a multi-dimensional quantitative scoring mechanism, making it difficult to dynamically balance transmission security and efficiency.

Method used

The system employs a data segmentation and encoding module for dynamic redundancy encoding, a dynamic hash chain construction module to generate a chain structure, a quantum noise encryption module for encryption, an adaptive integrity verification module for multi-dimensional feature fusion scoring, and a closed-loop feedback mechanism to adjust encryption strength and encoding redundancy, thus forming an adaptive security protection system.

Benefits of technology

It achieves a dynamic security trade-off in medical data transmission, improves the ability to resist replay attacks and hash collisions, enhances encryption security and error correction capabilities, reduces false alarm rate, and improves the system's robustness in complex network environments.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN123122929A_ABST
    Figure CN123122929A_ABST
Patent Text Reader

Abstract

This invention relates to the field of data security transmission technology, specifically disclosing a medical data integrity verification and transmission security protection system and method. The system includes a data segmentation and encoding module. By simultaneously feeding back the dynamic integrity score output by the adaptive integrity verification module to the quantum noise encryption module, the data segmentation and encoding module, and the secure transmission protocol module, a normalized mutual exclusion constraint is established between the encryption key refresh frequency and the encoding redundancy. This enables the system to dynamically allocate security overhead according to the real-time integrity status under bandwidth-limited or computationally resource-constrained conditions. That is, when the integrity is excellent, priority is given to ensuring encryption strength to resist eavesdropping; when the integrity deteriorates, priority is given to ensuring error correction capability to ensure recoverability. This achieves a nonlinear dynamic optimal trade-off between encryption protection and error correction protection, overcoming the defects of independent operation of each security module and rigid resource allocation in traditional schemes.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of data security transmission technology, specifically to a medical data integrity verification and transmission security protection system and method. Background Technology

[0002] Medical data frequently needs to be transmitted and shared across networks in scenarios such as remote consultations, regional medical collaboration, and cloud storage. This type of data has high sensitivity, privacy, and legal compliance requirements, and its integrity and confidentiality are directly related to patient safety and the quality of medical care.

[0003] Existing medical data transmission security solutions typically employ static hash verification to check the integrity of data packets, combine standard encryption protocols such as TLS / SSL to ensure transmission confidentiality, and supplement with forward error correction codes with fixed parameters to deal with channel noise. Some solutions introduce blockchain-based distributed integrity storage mechanisms or use quantum key distribution technology based on physical random sources to improve key security.

[0004] In existing technologies, static hash verification lacks the ability to trace the temporal correlation between data blocks, making it difficult to resist replay attacks and hash collisions; forward error correction codes with fixed redundancy cannot be dynamically adjusted according to real-time channel quality, resulting in low bandwidth utilization or insufficient error correction capabilities; encryption keys generated by deterministic algorithms are potentially vulnerable to being cracked by quantum computing, and the key refresh frequency lacks coordination with system resources; integrity verification often uses single-index threshold judgment, which is prone to false alarms due to noise interference or changes in data distribution, and lacks a multi-dimensional quantitative scoring mechanism to guide adaptive security decisions; in addition, each security module operates independently, lacking a closed-loop adjustment mechanism based on integrity status feedback, making it difficult to achieve a dynamic trade-off between encryption strength and transmission efficiency when resources are limited. Summary of the Invention

[0005] The purpose of this invention is to provide a medical data integrity verification and transmission security protection system and method, solving the following technical problems: How to improve the security of medical data transmission.

[0006] The objective of this invention can be achieved through the following technical solutions: A medical data integrity verification and transmission security protection system and method, the system comprising: The data segmentation and encoding module is configured to receive raw medical data, segment it into N data blocks according to a preset data block size threshold, and perform redundant encoding on each data block based on forward error correction encoding to generate an encoded block containing raw data and check data; the encoding parameters of the forward error correction encoding are dynamically adjusted according to the real-time transmission bandwidth and bit error rate. The dynamic hash chain construction module is configured to generate a dynamic hash value for each coding block based on a trusted timestamp, the dynamic hash value of the previous coding block, and a feature key derived from the data features of the current coding block, and to construct a chain structure of the dynamic hash values ​​of all coding blocks according to the original sequence of the data blocks. The quantum noise encryption module is configured to generate quantum random numbers based on a physical random source as encryption keys, and use these encryption keys to encrypt the encoded block to generate ciphertext data blocks; during the ciphertext construction process of the quantum noise encryption module, the input of the pseudo-random mask used for ciphertext construction includes the dynamic hash value, so that a coupling relationship is formed between the ciphertext and the dynamic hash chain state. An adaptive integrity verification module is configured to receive and decrypt the ciphertext data block, extract feature parameters of continuous data blocks according to a preset sliding window mechanism, perform real-time integrity verification based on multi-dimensional feature fusion operation, and output a dynamic integrity score to characterize the degree of data integrity. The secure transmission protocol module is configured to encapsulate the encrypted data block, transmit the data through an encrypted channel, and trigger an anomaly handling operation when the dynamic integrity score is detected to be lower than a preset threshold. The output of the adaptive integrity verification module is connected to the quantum noise encryption module, the data segmentation and encoding module, and the secure transmission protocol module, respectively. It is used to feed back the dynamic integrity score and the control signal derived from the dynamic integrity score to each module to adjust the encryption strength, encoding redundancy and anomaly handling trigger sensitivity, forming a closed-loop adaptive security adjustment link with the dynamic integrity score as the unified state variable.

[0007] Furthermore, the construction process of the dynamic hash chain construction module includes: A hash chain based on SHA-256 is constructed by concatenating the payload data of the current coding block, the trusted timestamp, the dynamic hash value of the previous coding block, and the feature key derived from the current coding block data, and then performing a SHA-256 hash operation to generate the current dynamic hash value. The feature key is obtained by performing a bitwise XOR operation between the check value obtained by performing a 32-bit cyclic redundancy check on the payload of the current coding block and the byte length of the payload.

[0008] Furthermore, the process by which the adaptive integrity verification module outputs a dynamic integrity score includes: The result is obtained based on multi-dimensional feature fusion operations, which refer to the process of fusing data feature parameters from different dimensions into a comprehensive quantitative index through weighted, nonlinear mapping, or combination operations, as shown in the following formula: ; in, This is the current integrity verification time. The dynamic integrity score at time t; Let be the information entropy value of the continuous data block within the sliding window at time t, and ; This represents the dynamic regularization coefficient of the information entropy term; The smoothing coefficient for the information entropy term; This represents the number of data blocks within the current sliding window that have successfully passed the checksum verification. This represents the total number of data blocks within the current sliding window. To verify the dynamic weight coefficient of the matching rate term, the dynamic regularization coefficient of the information entropy term... Dynamic weighting coefficients of the matching rate term The time-series change rate of the data block within the current sliding window is dynamically determined. Specifically, , ; in, and The preset baseline coefficient, For the preset attenuation coefficient, Information entropy The first derivative with respect to time t; And by scoring the dynamic integrity at time t With preset safety threshold Perform a comparison; like The system determines that there is no integrity abnormality in the data transmission and storage at the current moment; like The system determines that there is an integrity anomaly in the data transmission and storage at the current moment.

[0009] Furthermore, the encoding process of the data segmentation and encoding module includes: Through formula Calculate the number of original data symbols k in the data segmentation and encoding module; Where n is the total number of symbols in the forward error correction coding after encoding. Let be the number of original data symbols in the forward error correction coding, and , This represents the real-time bit error rate of the current transmission link, and , This represents the real-time available transmission bandwidth of the current transmission link. This is a bandwidth utilization adjustment factor. , This is for floor function.

[0010] Furthermore, the process of generating ciphertext data blocks in the quantum noise encryption module includes: Encryption Key Payload for the i-th coded block After performing symmetric encryption, the encryption result is XORed with the output of a pseudo-random function to generate the final ciphertext data block. The input to the pseudo-random function includes the dynamic hash value of the i-th coded block. And a one-time random number; Where i is any coded block.

[0011] Furthermore, the dynamic hash chain construction module also includes a timestamp credibility evaluation unit; configured to calculate timestamp credibility weights based on the historical continuous quantized integrity score sequence output by the adaptive integrity verification module. The timestamp credibility weight adopts the form of a Sigmoid function, with the deviation of the arithmetic mean of historical scores relative to the preset security threshold as the independent variable; During the generation of the dynamic hash value, when the timestamp credibility weight The timestamp credibility threshold is lower than the preset threshold. At this point, the dynamic hash chain construction module suspends the use of trusted timestamps and replaces them with a monotonically increasing counter based on data block sequence numbers for chain construction, until... Restore to above.

[0012] Furthermore, the process of adjusting the encoding parameters in real time in the data segmentation and encoding module includes: The number of original data symbols k in the forward error correction coding is continuously adjusted according to the change in the continuous quantization integrity score, forming a nonlinear coupling between redundancy and integrity deterioration rate; Adjusted effective number of original data symbols The adjustment amount is obtained by subtracting the adjustment amount from the original number of data symbols k. The adjustment amount is the product of the absolute value of the rate of change of the continuous quantification integrity score, the preset coupling coefficient, and a logarithmic function. The independent variable of the logarithmic function is the ratio of the difference between the preset safety threshold and the current score to the preset safety threshold plus 1.

[0013] Furthermore, the secure transmission protocol module includes: The resource arbitration unit is configured to calculate the load based on the currently available real-time transmission bandwidth B and the system load. The key refresh frequency of the quantum noise encryption module A mutual exclusion constraint is established between the forward error correction coding redundancy of the data segmentation and encoding module, so that the sum of the normalized key refresh frequency and redundancy does not exceed the total security overhead budget that the system can currently bear. When the system detects insufficient bandwidth or excessive computational load, the resource arbitration unit dynamically balances encryption strength and error correction redundancy according to the following priority strategy: By using dynamic integrity scoring With respect to the preset safety threshold range Perform a comparison; like Prioritize encryption strength, that is, maintain it under the mutual exclusion constraint. Reduce redundancy while keeping the same; like Prioritize error correction capabilities, that is, under the aforementioned mutual exclusion constraints, prioritize maintaining redundancy while reducing [the degree of redundancy]. ; like The current ratio of encryption strength to error correction redundancy will remain unchanged.

[0014] Furthermore, the adaptive integrity verification module also includes: A parallel speculation verification unit is configured to trigger branch speculation verification when the hash verification of a preset number of consecutive encoded blocks in the dynamic hash chain fails. The verification process of the parallel speculation verification unit includes: The parallel speculative verification unit maintains three speculative hash chain branches simultaneously and performs verification in parallel: The first branch assumes that the data block has not been tampered with and only the timestamp is inaccurate, and performs an exhaustive matching of the timestamp within a preset tolerance range; The second branch assumes that the data block has been tampered with and the tampering occurred at the transport layer. The data block is then recovered using the redundant check symbols of the forward error correction coding, and the hash value is recalculated. The third branch assumes that the data block has been maliciously tampered with, triggering the highest level of anomaly response; The branch that completes verification and hash matching first among the three branches is adopted as the current verification result, and the remaining branches terminate execution. The results of the branch-based verification are then fed back to the data segmentation and encoding module to mark the current channel state: when the first branch is adopted, it is marked as time synchronization state; when the second branch is adopted, it is marked as channel quality state; and when the third branch is adopted, it is marked as security attack state.

[0015] A method for verifying the integrity of medical data and ensuring secure transmission, the method comprising: S1: Receive raw medical data through the data segmentation and encoding module, segment it into multiple data blocks according to the preset data block size threshold, and perform redundant encoding on each data block based on forward error correction encoding to generate an encoded block; S2: The dynamic hash chain building module generates a dynamic hash value for each coding block based on a trusted timestamp, the dynamic hash value of the previous coding block, and the feature key derived from the data features of the current coding block, and builds the dynamic hash values ​​of all coding blocks into a chain structure according to the original sequence of the data blocks. S3: Extract quantum random numbers from physical random sources of vacuum fluctuations or shot noise using a quantum noise encryption module as encryption keys. Use these encryption keys to perform symmetric encryption on the encoded block. Then, perform a bitwise XOR operation on the encryption result with the output of a pseudo-random function that takes the current encoded block's dynamic hash value and a one-time random number as inputs to generate a ciphertext data block. S4: Receive and decrypt the ciphertext data block through the adaptive integrity verification module, extract the feature parameters of the continuous data block according to the sliding window mechanism, and calculate the dynamic integrity score based on the weighted fusion of information entropy and check code matching rate. S5: After the encrypted data block is encapsulated by the secure transmission protocol module, it is transmitted through the encrypted channel. When the dynamic integrity score is lower than the preset security threshold, an abnormal handling operation is triggered.

[0016] The beneficial effects of this invention are: (1) This invention feeds back the dynamic integrity score output by the adaptive integrity verification module to the quantum noise encryption module, the data segmentation and encoding module and the secure transmission protocol module at the same time, and establishes a normalized mutual exclusion constraint between the encryption key refresh frequency and the encoding redundancy. This enables the system to dynamically allocate security overhead according to the real-time integrity status under the conditions of limited bandwidth or tight computing resources. That is, when the integrity is good, the encryption strength is given priority to resist eavesdropping, and when the integrity deteriorates, the error correction capability is given priority to ensure recoverability. This realizes the nonlinear dynamic optimal trade-off between encryption protection and error correction protection, and overcomes the defects of independent operation of each security module and rigid resource allocation in traditional schemes.

[0017] (2) This invention introduces the rate of change of integrity score and the degree of deviation from the safety threshold into the nonlinear adjustment function of coding redundancy, so that the redundancy adjustment of forward error correction coding not only depends on the channel bit error rate and bandwidth, but also responds synchronously to the speed and magnitude of data integrity deterioration. That is, the faster the integrity decreases and the more serious the deviation, the greater the increase in redundancy. Furthermore, the use of logarithmic function mapping avoids oscillation caused by over-adjustment. This mechanism enables the system to have predictive error correction capability to "prevent problems before they occur". It actively enhances forward error correction before the integrity drops below the threshold, which significantly reduces the risk of data irrecoverability caused by channel mutation.

[0018] (3) This invention couples the pseudo-random mask layer input in the ciphertext construction with the dynamic hash chain state, so that the ciphertext output by the quantum noise encryption module not only depends on the physical true random key, but is also constrained by the integrity of the entire hash chain. That is, any tampering with the data block will cause the dynamic hash value to change, thereby invalidating the pseudo-random mask and causing decryption failure. This design deeply integrates encryption security and integrity verification, forming a two-way linkage protection of "tampering is not decryptable". Even if the quantum random number key is stolen by the side channel, the attacker still cannot construct valid ciphertext without destroying the hash chain, effectively making up for the architectural defects of traditional encryption and integrity verification being independent of each other.

[0019] (4) When consecutive hash verification fails, the parallel speculation verification unit maintains three hypothetical branches (timestamp deviation, transmission layer error, and malicious tampering) for parallel verification. The first matching branch is used to locate the root cause of the fault, and the result is fed back to mark the channel status. This mechanism upgrades the traditional binary judgment of "verification failure is an alarm" to fault type identification and adaptive handling, which significantly reduces the false alarm rate caused by time synchronization jitter or instantaneous channel noise. At the same time, the root cause feedback guides the targeted adjustment of coding parameters or time synchronization strategies, realizing the leap from passive alarm to root cause-driven self-healing, and improving the robustness of the system in complex network environments. Attached Figure Description

[0020] The invention will now be further described with reference to the accompanying drawings.

[0021] Figure 1 This is a schematic block diagram of a medical data integrity verification and transmission security protection system according to the present invention; Figure 2 This is a flowchart of a method for verifying the integrity of medical data and protecting its transmission security, as described in this invention. Detailed Implementation

[0022] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0023] Please see Figure 1 As shown, in one embodiment, this application provides a medical data integrity verification and transmission security protection system and method, the system comprising: The data segmentation and encoding module is configured to receive raw medical data, segment it into N data blocks according to a preset data block size threshold, and perform redundant encoding on each data block based on forward error correction encoding to generate an encoded block containing raw data and check data; the encoding parameters of the forward error correction encoding are dynamically adjusted according to the real-time transmission bandwidth and bit error rate. The dynamic hash chain construction module is configured to generate a dynamic hash value for each coding block based on a trusted timestamp, the dynamic hash value of the previous coding block, and a feature key derived from the data features of the current coding block, and to construct a chain structure of the dynamic hash values ​​of all coding blocks according to the original sequence of the data blocks. The quantum noise encryption module is configured to generate quantum random numbers based on a physical random source as encryption keys, and use these encryption keys to encrypt the encoded block to generate ciphertext data blocks; during the ciphertext construction process of the quantum noise encryption module, the input of the pseudo-random mask used for ciphertext construction includes the dynamic hash value, so that a coupling relationship is formed between the ciphertext and the dynamic hash chain state. An adaptive integrity verification module is configured to receive and decrypt the ciphertext data block, extract feature parameters of continuous data blocks according to a preset sliding window mechanism, perform real-time integrity verification based on multi-dimensional feature fusion operation, and output a dynamic integrity score to characterize the degree of data integrity. The secure transmission protocol module is configured to encapsulate the encrypted data block, transmit the data through an encrypted channel, and trigger an anomaly handling operation when the dynamic integrity score is detected to be lower than a preset threshold. The output of the adaptive integrity verification module is connected to the quantum noise encryption module, the data segmentation and encoding module and the secure transmission protocol module, respectively. It is used to feed back the dynamic integrity score and the control signal derived from the dynamic integrity score to each module to adjust the encryption strength, encoding redundancy and anomaly handling trigger sensitivity, respectively, forming a closed-loop adaptive security adjustment link with the dynamic integrity score as the unified state quantity. The dynamic integrity score output by the adaptive integrity verification module also serves as: (a) the basis for adjusting the encryption key refresh frequency in the quantum noise encryption module, (b) the basis for adjusting the forward error correction coding redundancy in the data segmentation and encoding module, and (c) the basis for adjusting the anomaly handling trigger threshold in the secure transmission protocol module; the adjustment of the dynamic integrity score to the above three modules satisfies the following coupling constraint: the normalized sum of the encryption key refresh frequency and coding redundancy does not exceed the total security overhead budget that the system can currently bear, and the total security overhead budget is determined by the dynamic integrity score through nonlinear mapping. Through the above technical solution, this embodiment provides a medical data integrity verification and transmission security protection system. Its working principle is as follows: A layered and collaborative architecture is adopted, with each module achieving adaptive security protection through a closed-loop feedback mechanism. The data segmentation and encoding module first divides the original medical data into N data blocks according to a preset threshold. Then, Reed-Solomon codes are applied to each data block for redundant encoding. The dynamic hash chain construction module generates a dynamic hash value for each encoded block. All hash values ​​form a chain structure according to the original sequence; tampering with any data block will invalidate all subsequent hash values. The quantum noise encryption module extracts truly random numbers from physical random sources such as vacuum fluctuations or shot noise as the encryption key. The module performs encryption on the encoded blocks. During ciphertext construction, it embeds an independent mathematical dimension determined by the dynamic hash chain state, coupling the ciphertext space with the hash chain state. Even if an attacker obtains the ciphertext, they cannot reconstruct the plaintext without compromising the hash chain integrity. The adaptive integrity verification module uses a sliding window mechanism to simultaneously calculate the information entropy and checksum matching rate for consecutive data blocks within the window, and outputs a dynamic integrity score through weighted fusion. The secure transmission protocol module is responsible for encapsulating the ciphertext data blocks and transmitting them through an encrypted channel, while continuously monitoring the dynamic integrity score. When the dynamic integrity score falls below a preset security threshold, it triggers anomaly handling operations (such as retransmission requests, link switching, or alarms). The modules form a closed-loop control system through feedback loops: the adaptive integrity verification module feeds back the dynamic integrity score and the resulting control signals to the quantum noise encryption module (adjusting encryption strength), the data segmentation and encoding module (adjusting encoding redundancy), and the secure transmission protocol module (triggering anomaly handling), respectively, achieving system-level adaptive security protection. By using this setup, through data segmentation and dynamic adjustment of Reed-Solomon redundancy coding, the coding parameters are adaptively optimized based on bandwidth and bit error rate, balancing transmission reliability and bandwidth efficiency. The dynamic hash chain creates temporal correlation between data blocks, enhancing tamper detection capabilities. Quantum noise physical true random key generation provides security for encrypted information, eliminating the predictable risks of deterministic algorithms. The fusion of information entropy and verification matching rate scores enables multi-dimensional integrity quantification assessment, which has higher sensitivity and lower false alarm rate than a single indicator, forming an adaptive protection closed loop of "monitoring-evaluation-feedback-adjustment," systematically improving the security level of medical data transmission and storage. It should be noted that the forward error correction coding is Reed-Solomon code.

[0024] Furthermore, the construction process of the dynamic hash chain construction module includes: A hash chain based on SHA-256 is constructed by concatenating the payload data of the current coding block, the trusted timestamp, the dynamic hash value of the previous coding block, and the feature key derived from the current coding block data, and then performing a SHA-256 hash operation to generate the current dynamic hash value; the feature key is obtained by performing a bitwise XOR operation between the check value obtained by performing a 32-bit cyclic redundancy check on the payload of the current coding block and the byte length of the payload. Through the above technical solution, this embodiment provides the construction process of a dynamic hash chain construction module. The core of the dynamic hash chain construction module lies in fusing information from multiple dimensions to generate a single hash value. And form a chain association. For the i-th encoded block, the process of generating its dynamic hash value is as follows: ; in, This is the payload data (binary sequence) of the i-th coded block. Let be the trusted timestamp of the current moment for the i-th coded block. The dynamic hash value of the previous coded block (for , (as a preset initial vector). The feature key derived from the current coded block data; By setting it up in this way, , , and The four components are concatenated and then input into the SHA-256 hash function, which outputs a 256-bit dynamic hash value. This construction method makes Simultaneously dependent on the content of the current data block, its timestamp, the previous hash value, and the data feature key, any change in any single factor will result in... In the event of unpredictable changes, by fusing four dimensions of information—data content, timestamp, previous hash value, and feature key—into a single SHA-256 hash operation, collision resistance and tamper sensitivity are significantly enhanced. The introduction of timestamps gives hash values ​​a temporal attribute, effectively resisting replay attacks. The chain structure enables verification to have a cumulative effect; tampering with a single data block will invalidate all subsequent hashes, providing stronger traceability capabilities. It is particularly suitable for medical data integrity protection scenarios that are time-sensitive and require strict tamper protection.

[0025] Furthermore, the process by which the adaptive integrity verification module outputs a dynamic integrity score includes: The result is obtained based on multi-dimensional feature fusion operations, which refer to the process of fusing data feature parameters from different dimensions into a comprehensive quantitative index through weighted, nonlinear mapping, or combination operations, as shown in the following formula: ; in, This is the current integrity verification time. The dynamic integrity score at time t is a dimensionless real number; the higher the value, the better the data integrity. Let be the information entropy value of the continuous data block within the sliding window at time t, in bits. This value is obtained statistically based on the numerical distribution of the data blocks within the sliding window. ; This represents the dynamic regularization coefficient of the information entropy term; The smoothing coefficient for the information entropy term is a preset positive real number used to prevent... Approaching zero-time score divergence; This represents the number of data blocks that have successfully passed the checksum verification within the current sliding window; it is a non-negative integer. The total number of data blocks within the current sliding window, which is a positive integer; To verify the dynamic weighting coefficient of the matching rate item; And by scoring the dynamic integrity at time t With preset safety threshold Perform a comparison; like The system determines that there is no integrity abnormality in the data transmission and storage at the current moment; like The system determines that there is an integrity anomaly in the data transmission and storage at the current moment; Through the above technical solution, this embodiment provides a process for the adaptive integrity verification module to output a dynamic integrity score. The adaptive integrity verification module adopts a dual-dimensional fusion scoring mechanism, comprehensively evaluating data integrity from two perspectives: data content randomness (information entropy) and data block verification pass rate (verification matching rate). This measure assesses the degree of randomness in the distribution of data block values ​​within a sliding window. Its calculation is based on the statistical distribution of the payload bytes of all data blocks within the window. When the data is complete, the byte distribution of medical data typically exhibits a specific statistical pattern. Within the normal range; when data is tampered with or corrupted, the byte distribution becomes distorted. The information entropy term may increase or decrease abnormally. Will Mapped to rating contribution value: The smaller the value (the more concentrated and regular the data distribution), the greater the contribution of this item. The larger the value (the more random the data distribution), the smaller the contribution of this term. The introduction of ensures that when When the value approaches 0, the denominator is not 0 to prevent scoring divergence and to verify the matching rate item. It directly reflects the proportion of data blocks within the sliding window that have been verified by checksums. The final score is obtained by comparing the embedded checksum (such as CRC checksum or hash checksum) in the data block with the recalculated value. The weighted sum of the two items. and The weights of the two items in the total score are controlled separately, and finally compared with a preset safety threshold. By comparing the continuous quantitative scores, the system transforms them into a binary integrity status judgment. By employing this dual-dimensional fusion scoring mechanism of information entropy and verification matching rate, the shortcomings of a single verification indicator, which is prone to misjudgment or missed judgment, are overcome. The information entropy term can capture changes in the statistical characteristics of data content and has the ability to detect attacks that change the data distribution without altering the checksum. The verification matching rate term directly reflects the verification status of data blocks and has high sensitivity to random corruption or bit flipping. The weighted fusion of the two gives the scoring system the dual advantages of statistical anomaly detection and deterministic verification. Continuous quantitative scoring provides the system with a refined measurement of data integrity and supports progressive anomaly warning and graded response. It should be noted that, The method of obtaining it is: ; Where v is the byte index, The proportion of bytes with the value v in all data blocks within the sliding window at time t; It should be noted that the dynamic regularization coefficient of the information entropy term... Dynamic weighting coefficients of the matching rate term The time-series change rate of the data block within the current sliding window is dynamically determined. Specifically, , ; in, and The preset baseline coefficient, A preset attenuation coefficient is used to automatically reduce the weight of the information entropy term and increase the weight of the verification matching rate term when the data distribution changes drastically. It should be noted that the multi-dimensional feature fusion operation refers to the process of fusing data feature parameters from different dimensions into a comprehensive quantitative index through weighted summation, nonlinear mapping, or combination operations. In this embodiment, the multi-dimensional features include two dimensions: the statistical distribution characteristics of the data block content and the data block verification pass rate characteristics. A dynamic integrity score is obtained by weighted fusion of these two dimensions. In other embodiments, the multi-dimensional features may also include data block timestamp deviation characteristics, data block length consistency characteristics, etc.

[0026] The encoding process of the data segmentation and encoding module includes: Through formula Calculate the number of original data symbols k in the data segmentation and encoding module; Where n is the total number of symbols in the forward error correction coding after encoding. Let be the number of original data symbols in the forward error correction coding, and , This represents the real-time bit error rate of the current transmission link, and , This represents the real-time available transmission bandwidth of the current transmission link. This is a bandwidth utilization adjustment factor. , This is a floor function; By configuring the system in this way, the ratio of the original number of data symbols to the total number of encoded symbols decreases as the bit error rate increases and increases as bandwidth increases. Based on this, the Reed-Solomon coding parameters are dynamically adjusted according to the real-time channel conditions, achieving an optimal balance between transmission reliability and bandwidth efficiency. When the channel bit error rate increases, redundancy is automatically increased, enabling the receiver to correct more errors and ensuring the recoverability of medical data under adverse channel conditions. When the channel quality is good or bandwidth is sufficient, redundancy is automatically reduced, minimizing unnecessary transmission overhead and improving data transmission efficiency. This adaptive mechanism allows the system to maintain optimal operating conditions in different network environments (such as high-speed wired networks, wireless LANs, and wide-area mobile networks), avoiding the drawbacks of fixed coding parameters that either result in excessive redundancy wasting bandwidth or insufficient redundancy failing to correct errors when the channel changes. It should be noted that the bit error rate E and bandwidth B in the formula are expressed in the denominator. With the numerator The combined effect of these factors has a nonlinear coupling effect on the original number of data symbols k, i.e., the bit error rate. Increase directly decrease molecules A decrease in bandwidth B reduces the denominator. Both factors contribute to the accelerated decrease of k under the dual adverse conditions of increased bit error rate and reduced bandwidth, meaning that coding redundancy shows an accelerated increasing trend.

[0027] Furthermore, the process of generating ciphertext data blocks in the quantum noise encryption module includes: Encryption Key Payload for the i-th coded block After performing symmetric encryption, the encryption result is XORed with the output of a pseudo-random function to generate the final ciphertext data block. The input to the pseudo-random function includes the dynamic hash value of the i-th coded block. And a one-time random number; Where i is any coded block; Through the above technical solution, this embodiment provides a process for generating ciphertext data blocks in a quantum noise encryption module. The quantum noise encryption module uses a two-layer encryption structure to generate ciphertext data blocks. The first layer is a symmetric encryption layer: using quantum random numbers. As the encryption key, the payload of the i-th encoded block Execute a symmetric encryption algorithm (such as AES) to obtain the intermediate ciphertext. ; ; in, Indicated by AES encryption operation for the key; The second layer is the XOR mask layer: it converts the intermediate ciphertext... Perform a bitwise XOR operation with the output of a pseudo-random function to generate the final ciphertext. ; ; in, Let i be the dynamic hash value of the i-th coded block. It is a one-time random number (a different value is used for each encryption). For and The output is the pseudo-random function input. This is a bitwise XOR operation, where the pseudo-random function... Implemented using HMAC-SHA256 key derivation functions: ,in As The key, A 128-bit one-time random number. It is a 32-bit counter, and the output is a 256-bit pseudo-random mask; The mathematical essence of this construction is: even if the attacker gains... and Information, due to The output is from and A joint decision, and It is also associated with all previous data blocks in the hash chain, so an attacker cannot construct a valid ciphertext without breaking the hash chain. This design couples the ciphertext space with the dynamic hash chain state, so that the encryption security depends not only on the confidentiality of the key, but also on the integrity of the hash chain. By using this configuration, a two-layer encryption structure of symmetric encryption and pseudo-random mask based on dynamic hash values ​​is constructed, which strongly couples ciphertext generation with the hash chain state. Even if an attacker obtains the symmetric key through side-channel or brute-force attacks, the attacker cannot correctly decrypt or forge ciphertext without triggering hash verification failure because the pseudo-random output depends on the dynamic hash value, and the correctness of the hash value depends on the integrity of the entire hash chain. This design deeply integrates encryption security and integrity verification, forming a two-way protection that "integrity failure will inevitably lead to decryption failure". The one-time random number ensures that the same plaintext generates different ciphertexts, effectively resisting replay attacks and known plaintext attacks. It should be noted that the quantum random number generation adopts a zero-difference detection scheme based on vacuum fluctuations: a balanced zero-difference detector is used to continuously measure the orthogonal components of the quantum vacuum state. The measurement results are converted from analog to digital to obtain the original random bit sequence, which is then post-processed using a Toeplitz hash extractor to eliminate possible technical noise correlations, ultimately obtaining a truly random key. The local oscillation optical power of the balanced homodyne detector is The detection bandwidth is Sampling rate ,satisfy .

[0028] Furthermore, the dynamic hash chain construction module also includes a timestamp credibility evaluation unit; configured to calculate timestamp credibility weights based on the historical continuous quantized integrity score sequence output by the adaptive integrity verification module. The timestamp credibility weight adopts the form of a Sigmoid function, with the deviation of the arithmetic mean of historical scores relative to the preset security threshold as the independent variable; During the generation of the dynamic hash value, when the timestamp credibility weight The timestamp credibility threshold is lower than the preset threshold. At this point, the dynamic hash chain construction module suspends the use of trusted timestamps and replaces them with a monotonically increasing counter based on data block sequence numbers for chain construction, until... Restore to above; Through the above technical solution, this embodiment provides a timestamp credibility assessment unit, which dynamically assesses the credibility of the current time source through statistical analysis of historical integrity scoring sequences, and automatically switches to a backup scheme when the time source is unreliable. Timestamp Credibility Weight The calculation method is as follows: ; in, is the timestamp credibility weight, a dimensionless real number, with a value range of (0, 1). It is the arithmetic mean of the continuous quantization scores at the most recent multiple verification times. This is the preset sigmoid function steepness coefficient, a positive real number, used to control the sensitivity of the weights to scoring bias. It is a natural exponential function, and based on this, when Much larger hour, A value close to 1 indicates good historical integrity and high reliability of the timestamp; conversely, a value close to 1 indicates poor historical integrity and high reliability of the timestamp. much smaller hour, A value close to 0 indicates abnormal historical integrity and low timestamp reliability. By introducing a timestamp trustworthiness evaluation unit, the system can automatically degrade to a lower level when the time synchronization service is attacked or malfunctions, avoiding the risk of the entire hash chain failing due to untrustworthy timestamps. The trustworthiness weight, in the form of a sigmoid function, provides a smooth quantification of trust, avoiding the oscillation problem caused by binary judgment. The evaluation mechanism based on historical integrity scoring sequences ensures that the trustworthiness judgment of the time source is based on objective statistical data, rather than subjective settings. When the time source regains trust, the system automatically switches back to normal mode, achieving adaptive management of timestamp usage. This design significantly enhances the system's survivability under time synchronization attacks and ensures the robustness of hash chain construction. It should be noted that the preset sigmoid function steepness coefficient The range of values ​​is Preferred Its value is pre-calibrated based on the system's sensitivity requirements to changes in timestamp reliability. It is the arithmetic mean of the continuous quantization scores of the most recent M verification times (M=100). The value of M should cover at least one complete sliding window period to ensure statistical significance.

[0029] Furthermore, the process of adjusting the encoding parameters in real time in the data segmentation and encoding module includes: The number of original data symbols k in the forward error correction coding is continuously adjusted according to the change in the continuous quantization integrity score, forming a nonlinear coupling between redundancy and integrity deterioration rate; Adjusted effective number of original data symbols The adjustment amount is obtained by subtracting the adjustment amount from the original number of data symbols k. The adjustment amount is the product of the absolute value of the rate of change of the continuous quantification integrity score, the preset coupling coefficient, and a logarithmic function. The independent variable of the logarithmic function is the ratio of the difference between the preset safety threshold and the current score to the preset safety threshold plus 1. Through the above technical solution, this embodiment provides a process for real-time adjustment of coding parameters in the data segmentation and coding module. Its working principle is that when dynamically adjusting coding parameters, the data segmentation and coding module not only considers the channel state (bandwidth and bit error rate) but also introduces integrity scoring feedback, forming a non-linear coupling adjustment between redundancy and integrity degradation rate, effectively increasing the number of original data symbols. The calculation method is as follows; ; in, The original number of data symbols, The adjustment amount is calculated using the following formula: ; in, This is a preset coupling used to control the strength of redundancy adjustment based on the rate of integrity degradation. For dynamic integrity scoring The absolute value of the first derivative with respect to time t, the data meaning of this formula is the adjustment amount. With the rate of integrity deterioration It is directly proportional; that is, the faster the integrity declines, the greater the redundancy required. The adjustment is logarithmically related to the degree to which the current score deviates from the safety threshold; that is, the greater the deviation, the larger the adjustment. However, using a logarithmic function avoids oscillations caused by over-adjustment. hour, ,at this time , , This indicates that when the integrity is good, the proportion of the original data can be maintained or appropriately increased; conversely, when... hour, , When an integrity anomaly is indicated, the number of original data symbols should be reduced and the number of redundant symbols increased to enhance error correction capabilities. By nonlinearly coupling the adjustment of coding redundancy with the rate of change and deviation of the integrity score, the system can proactively increase forward error correction capability when data integrity begins to deteriorate, achieving a preventative protection effect. Compared to adjustment methods that rely solely on channel conditions (bandwidth, bit error rate), this mechanism introduces integrity feedback at the data semantic level, making the adjustment of the coding strategy more precise and timely. The nonlinear mapping in the form of a logarithmic function ensures the smoothness of the adjustment amount, avoiding drastic oscillations in coding parameters caused by score fluctuations. The introduction of this term enables the system to respond to the rate of integrity degradation rather than just the current state, achieving predictive redundancy adjustment.

[0030] Furthermore, the secure transmission protocol module includes: The resource arbitration unit is configured to calculate the load based on the currently available real-time transmission bandwidth B and the system load. The key refresh frequency of the quantum noise encryption module A mutual exclusion constraint is established between the forward error correction coding redundancy of the data segmentation and encoding module, so that the sum of the normalized key refresh frequency and redundancy does not exceed the total security overhead budget that the system can currently bear. When the system detects insufficient bandwidth or excessive computational load, the resource arbitration unit dynamically balances encryption strength and error correction redundancy according to the following priority strategy: By using dynamic integrity scoring With respect to the preset safety threshold range Perform a comparison; like Prioritize encryption strength, that is, maintain it under the mutual exclusion constraint. Reduce redundancy while keeping the same; like Prioritize error correction capabilities, that is, under the aforementioned mutual exclusion constraints, prioritize maintaining redundancy while reducing [the degree of redundancy]. ; like The current ratio of encryption strength to error correction redundancy will remain unchanged. Through the above technical solution, this embodiment provides resource arbitration. When system resources are limited, the resource arbitration unit in the secure transmission protocol module dynamically balances the security overhead of encryption strength and error correction redundancy. The mutual exclusion constraint can be expressed as: ; in, The key refresh frequency for the quantum noise encryption module. This is the maximum key refresh frequency. For forward error correction coding redundancy, To maximize the allowable redundancy, The total security overhead budget that the system can currently bear, with a value in the range (0, 1], is determined by the real-time available transmission bandwidth B and the system's calculated load. The information entropy determines this; the greater the bandwidth and the lower the load, the better. The larger; This constraint indicates a mutually exclusive relationship between encryption strength (characterized by normalized key refresh frequency) and error correction capability (characterized by normalized redundancy): the combined strength of both cannot exceed the system's current acceptable security overhead budget. When the system detects insufficient bandwidth or excessive computational load, the resource arbitration unit dynamically assigns an integrity score based on the current integrity score. With respect to the preset safety threshold range The comparison results determine the priority; like Prioritize encryption strength, that is, maintain it under the mutual exclusion constraint. If the redundancy is reduced while keeping it unchanged, then... If the unchanged condition causes the sum of the normalized key refresh frequency and redundancy to exceed the total security overhead budget, then the cost will be reduced synchronously according to the mutual exclusion constraint. With redundancy, until the mutual exclusion constraint is satisfied, wherein The reduction in redundancy is less than the reduction in encryption strength, in order to reflect the strategy of prioritizing the protection of encryption strength. like Prioritize error correction capabilities, that is, under the aforementioned mutual exclusion constraints, prioritize maintaining redundancy while reducing [the degree of redundancy]. If maintaining the redundancy level results in the sum of the normalized key refresh frequency and the redundancy level exceeding the total security overhead budget, then the redundancy level will be synchronously reduced according to the mutual exclusion constraint. The redundancy is adjusted until the mutual exclusion constraint is satisfied, wherein the reduction in redundancy is less than [a certain percentage]. The reduction range is designed to reflect a strategy that prioritizes error correction capabilities. like The current ratio of encryption strength to error correction redundancy will remain unchanged. By setting it up in this way, a mutual exclusion constraint and dynamic trade-off is established between encryption strength and error correction redundancy through the resource arbitration unit. This allows the system to make the optimal security resource allocation based on the real-time status of data integrity when bandwidth is insufficient or computing resources are tight. When the integrity is good, priority is given to ensuring encryption strength to resist eavesdropping; when the integrity deteriorates, priority is given to ensuring error correction capability to ensure recoverability. This priority strategy based on integrity scoring realizes the intelligent allocation of security resources between "anti-eavesdropping" and "anti-damage". It avoids the loss of critical protection due to "one-size-fits-all" degradation in resource-constrained scenarios. The normalized mutual exclusion constraint ensures that the adjustment is always within the system's tolerance range and avoids overload. It should be noted that, .

[0031] Furthermore, the adaptive integrity verification module also includes: A parallel speculation verification unit is configured to trigger branch speculation verification when the hash verification of a preset number of consecutive encoded blocks in the dynamic hash chain fails. The verification process of the parallel speculation verification unit includes: The parallel speculative verification unit maintains three speculative hash chain branches simultaneously and performs verification in parallel: The first branch assumes that the data block has not been tampered with and only the timestamp is inaccurate, and performs an exhaustive matching of the timestamp within a preset tolerance range; The second branch assumes that the data block has been tampered with and the tampering occurred at the transport layer. The data block is then recovered using the redundant check symbols of the forward error correction coding, and the hash value is recalculated. The third branch assumes that the data block has been maliciously tampered with, triggering the highest level of anomaly response; The branch that completes verification and hash matching first among the three branches is adopted as the current verification result, and the remaining branches terminate execution. The results of the branch's inferred verification are fed back to the data segmentation and encoding module to mark the current channel state: when the first branch is adopted, it is marked as time synchronization state; when the second branch is adopted, it is marked as channel quality state; and when the third branch is adopted, it is marked as security attack state. With this configuration, this embodiment provides a parallel speculative verification unit. The parallel speculative verification unit is activated when the hash verification of multiple consecutive coded blocks fails. By executing three verification branches with different hypotheses in parallel, it quickly locates the root cause of the failure. The mathematical essence of the three branches is as follows: First branch, assuming the data block content Unaltered, only timestamp There is a deviation; the verification process is within the time tolerance range. Internal exhaustive search , making Established, among which, For nominal timestamps, Preset tolerance; The second branch assumes that a bit error occurs in the data block during transmission, but the degree of corruption is within the error correction capability of the Reed-Solomon code. The verification process involves using the redundant check symbols in the coded block to perform RS decoding to recover the data. Then recalculate the hash value; The third branch assumes that the data block has been maliciously tampered with and cannot be recovered by the first two methods, and directly triggers the highest level of abnormal response (such as terminating transmission, isolating data, issuing security alarms, etc.). The three branches execute in parallel. The branch that completes verification and hash matching first is adopted. The verification result is fed back to the data segmentation and encoding module to mark the channel status: the first branch is adopted and marked as "time synchronization status" (time source needs to be calibrated), the second branch is adopted and marked as "channel quality status" (channel bit error rate is too high and redundancy needs to be added), and the third branch is adopted and marked as "security attack status" (security emergency response needs to be initiated). With this setup, the parallel speculative verification mechanism can quickly distinguish the fault type when hash verification fails, i.e., quickly locate whether it is a time synchronization problem, a channel transmission quality problem, or a malicious tampering attack. This guides the system to take targeted repair or response measures. Compared with the traditional simple "verification failure equals alarm" approach, this mechanism significantly reduces the false alarm rate. At the same time, the parallel execution of the three branches can improve the response speed. After the branch speculation results are fed back to the data segmentation and encoding module, the system can adaptively adjust the encoding parameters or time synchronization strategy accordingly, realizing adaptive adjustment driven by the root cause of the fault. It should be noted that the time tolerance range is dynamically determined based on the system's time synchronization accuracy. Specifically, ,in, The maximum synchronization error between the system and the trusted time source. The optimal value is the maximum jitter of network transmission latency. Within the tolerance range, an exhaustive search is performed with a step size of 10ms.

[0032] Please see Figure 2 As shown, a method for medical data integrity verification and transmission security protection includes: S1: Receive raw medical data through the data segmentation and encoding module, segment it into multiple data blocks according to the preset data block size threshold, and perform redundant encoding on each data block based on forward error correction encoding to generate an encoded block; S2: The dynamic hash chain building module generates a dynamic hash value for each coding block based on a trusted timestamp, the dynamic hash value of the previous coding block, and the feature key derived from the data features of the current coding block, and builds the dynamic hash values ​​of all coding blocks into a chain structure according to the original sequence of the data blocks. S3: Extract quantum random numbers from physical random sources of vacuum fluctuations or shot noise using a quantum noise encryption module as encryption keys. Use these encryption keys to perform symmetric encryption on the encoded block. Then, perform a bitwise XOR operation on the encryption result with the output of a pseudo-random function that takes the current encoded block's dynamic hash value and a one-time random number as inputs to generate a ciphertext data block. S4: Receive and decrypt the ciphertext data block through the adaptive integrity verification module, extract the feature parameters of the continuous data block according to the sliding window mechanism, and calculate the dynamic integrity score based on the weighted fusion of information entropy and check code matching rate. S5: After the encrypted data block is encapsulated by the secure transmission protocol module, it is transmitted through the encrypted channel. When the dynamic integrity score is lower than the preset security threshold, an abnormal handling operation is triggered. Through the above technical solution, this embodiment provides a method for medical data integrity verification and secure transmission protection. By sequentially connecting the five steps (S1 to S5), end-to-end integrity protection of medical data is achieved from initial input to secure transmission. S1's adaptive redundancy coding ensures data recoverability at the transmission level; S2's dynamic hash chain provides temporally correlated tamper detection capabilities; S3's quantum noise encryption endows the ciphertext with information theory security; S4's multi-dimensional fusion verification enables refined real-time assessment of data integrity; and S5's dynamic resource balancing and anomaly handling ensure robust system operation under resource-constrained conditions. The five steps form a complete secure link—"encoding → hashing → encryption → verification → transmission → feedback adjustment"—through closed-loop feedback. The synergistic effect of each step, rather than simple summation, makes the overall security significantly superior to the arithmetic sum of the security levels of each step. This method can be widely applied in scenarios such as telemedicine, electronic medical record sharing, and medical image transmission, providing systematic protection for the integrity, confidentiality, and availability of medical data throughout its entire lifecycle.

[0033] The foregoing has provided a detailed description of one embodiment of the present invention, but this description is merely a preferred embodiment and should not be construed as limiting the scope of the invention. All equivalent variations and modifications made within the scope of the claims of this invention should still fall within the patent coverage of this invention.

Claims

1. A medical data integrity verification and transmission security protection system, characterized in that, The system includes: The data segmentation and encoding module is configured to receive raw medical data, segment it into N data blocks according to a preset data block size threshold, and perform redundant encoding on each data block based on forward error correction encoding to generate an encoded block containing raw data and check data; the encoding parameters of the forward error correction encoding are dynamically adjusted according to the real-time transmission bandwidth and bit error rate. The dynamic hash chain construction module is configured to generate a dynamic hash value for each coding block based on a trusted timestamp, the dynamic hash value of the previous coding block, and a feature key derived from the data characteristics of the current coding block, and to construct a chain structure of the dynamic hash values ​​of all coding blocks according to the original sequence of the data blocks. A quantum noise encryption module is configured to generate a quantum random number based on a physical random source as an encryption key, and use the encryption key to encrypt the encoded block to generate a ciphertext data block; during the ciphertext construction process of the quantum noise encryption module, the input of the pseudo-random mask used for ciphertext construction includes the dynamic hash value, so that a coupling relationship is formed between the ciphertext and the dynamic hash chain state. An adaptive integrity verification module is configured to receive and decrypt the ciphertext data block, extract feature parameters of continuous data blocks according to a preset sliding window mechanism, perform real-time integrity verification based on multi-dimensional feature fusion operation, and output a dynamic integrity score to characterize the degree of data integrity. The secure transmission protocol module is configured to encapsulate the encrypted data block, transmit the data through an encrypted channel, and trigger an anomaly handling operation when the dynamic integrity score is detected to be lower than a preset threshold. The output of the adaptive integrity verification module is connected to the quantum noise encryption module, the data segmentation and encoding module, and the secure transmission protocol module, respectively. It is used to feed back the dynamic integrity score and the control signal derived from the dynamic integrity score to each module to adjust the encryption strength, encoding redundancy and anomaly handling trigger sensitivity, forming a closed-loop adaptive security adjustment link with the dynamic integrity score as the unified state variable.

2. The medical data integrity checking and transmission security protection system of claim 1, wherein, The construction process of the dynamic hash chain construction module includes: A hash chain based on SHA-256 is constructed by concatenating the payload data of the current coding block, the trusted timestamp, the dynamic hash value of the previous coding block, and the feature key derived from the current coding block data, and then performing a SHA-256 hash operation to generate the current dynamic hash value. The feature key is obtained by performing a bitwise XOR operation between the check value obtained by performing a 32-bit cyclic redundancy check on the payload of the current coding block and the byte length of the payload.

3. The medical data integrity checking and transmission security protection system of claim 1, wherein, The process by which the adaptive integrity verification module outputs a dynamic integrity score includes: The result is obtained based on multi-dimensional feature fusion operations, which refer to the process of fusing data feature parameters from different dimensions into a comprehensive quantitative index through weighted, nonlinear mapping, or combined operations, as shown in the following formula: ; in, This is the current integrity verification time. The dynamic integrity score at time t; Let be the information entropy value of the continuous data block within the sliding window at time t, and ; is the dynamic regularization coefficient of the information entropy term; The smoothing coefficient for the information entropy term; This represents the number of data blocks that have successfully passed the checksum verification within the current sliding window. This represents the total number of data blocks within the current sliding window. To verify the dynamic weight coefficient of the matching rate term, the dynamic regularization coefficient of the information entropy term... Dynamic weighting coefficients of the matching rate term The time-series change rate of the data block within the current sliding window is dynamically determined. Specifically, , ; in, and The preset baseline coefficient, For the preset attenuation coefficient, Information entropy The first derivative with respect to time t; And by scoring the dynamic integrity at time t With preset safety threshold Perform a comparison; like The system determines that there is no integrity abnormality in the data transmission and storage at the current moment; like The system determines that there is an integrity anomaly in the data transmission and storage at the current moment.

4. The medical data integrity verification and transmission security protection system according to claim 1, characterized in that, The encoding process of the data segmentation and encoding module includes: Through formula Calculate the number of original data symbols k in the data segmentation and encoding module; Where n is the total number of symbols in the forward error correction coding after encoding. Let be the number of original data symbols in the forward error correction coding, and , This represents the real-time bit error rate of the current transmission link, and , This represents the real-time available transmission bandwidth of the current transmission link. As a bandwidth utilization adjustment factor, , This is for floor function.

5. The medical data integrity verification and transmission security protection system according to claim 1, characterized in that, The process of generating ciphertext data blocks in the quantum noise encryption module includes: Encryption Key Payload for the i-th coded block After performing symmetric encryption, the encryption result is XORed with the output of a pseudo-random function to generate the final ciphertext data block. The input to the pseudo-random function includes the dynamic hash value of the i-th coded block. And a one-time random number; Where i is any coded block.

6. The medical data integrity verification and transmission security protection system according to claim 1, characterized in that, The dynamic hash chain construction module further includes a timestamp credibility evaluation unit, configured to calculate timestamp credibility weights based on the historical continuous quantized integrity score sequence output by the adaptive integrity verification module. The timestamp credibility weight adopts the form of a Sigmoid function, with the deviation of the arithmetic mean of historical scores relative to the preset security threshold as the independent variable; During the generation of the dynamic hash value, when the timestamp credibility weight The timestamp credibility threshold is lower than the preset threshold. At this point, the dynamic hash chain construction module suspends the use of trusted timestamps and replaces them with a monotonically increasing counter based on data block sequence numbers for chain construction, until... Restore to above.

7. The medical data integrity verification and transmission security protection system according to claim 4, characterized in that, The process of real-time adjustment of encoding parameters in the data segmentation and encoding module includes: The number of original data symbols k in the forward error correction coding is continuously adjusted according to the change in the continuous quantization integrity score, forming a nonlinear coupling between redundancy and integrity deterioration rate; Adjusted effective number of original data symbols The adjustment amount is obtained by subtracting the adjustment amount from the original number of data symbols k. The adjustment amount is the product of the absolute value of the rate of change of the continuous quantification integrity score, the preset coupling coefficient, and a logarithmic function. The independent variable of the logarithmic function is the ratio of the difference between the preset safety threshold and the current score to the preset safety threshold plus 1.

8. The medical data integrity verification and transmission security protection system according to claim 1, characterized in that, The secure transmission protocol module includes: The resource arbitration unit is configured to calculate the load based on the currently available real-time transmission bandwidth B and the system load. The key refresh frequency of the quantum noise encryption module A mutual exclusion constraint is established between the forward error correction coding redundancy of the data segmentation and encoding module, so that the sum of the normalized key refresh frequency and redundancy does not exceed the total security overhead budget that the system can currently bear. When the system detects insufficient bandwidth or excessive computational load, the resource arbitration unit dynamically balances encryption strength and error correction redundancy according to the following priority strategy: By using dynamic integrity scoring With respect to the preset safety threshold range Perform a comparison; like Prioritize encryption strength, that is, maintain it under the mutual exclusion constraint. Reduce redundancy without changing the overall performance; like Prioritize error correction capabilities, that is, under the aforementioned mutual exclusion constraints, prioritize maintaining redundancy while reducing [the degree of redundancy]. ; like The current ratio of encryption strength to error correction redundancy will remain unchanged.

9. A medical data integrity verification and transmission security protection system according to claim 1, characterized in that, The adaptive integrity verification module also includes: A parallel speculation verification unit is configured to trigger branch speculation verification when the hash verification of a preset number of consecutive encoded blocks in the dynamic hash chain fails. The verification process of the parallel speculation verification unit includes: The parallel speculative verification unit maintains three speculative hash chain branches simultaneously and performs verification in parallel: The first branch assumes that the data block has not been tampered with and only the timestamp is inaccurate, and performs an exhaustive matching of the timestamp within a preset tolerance range; The second branch assumes that the data block has been tampered with and the tampering occurred at the transport layer. The data block is then recovered using the redundant check symbols of the forward error correction coding, and the hash value is recalculated. The third branch assumes that the data block has been maliciously tampered with, triggering the highest level of anomaly response; The branch that completes verification and hash matching first among the three branches is adopted as the current verification result, and the remaining branches terminate execution. The results of the branch-based verification are then fed back to the data segmentation and encoding module to mark the current channel state: when the first branch is adopted, it is marked as time synchronization state; when the second branch is adopted, it is marked as channel quality state; and when the third branch is adopted, it is marked as security attack state.

10. A method for verifying the integrity of medical data and ensuring secure transmission, applicable to the medical data integrity verification and secure transmission system as described in any one of claims 1 to 9, characterized in that, The method includes: S1: Receive raw medical data through the data segmentation and encoding module, segment it into multiple data blocks according to the preset data block size threshold, and perform redundant encoding on each data block based on forward error correction encoding to generate an encoded block; S2: The dynamic hash chain building module generates a dynamic hash value for each coding block based on a trusted timestamp, the dynamic hash value of the previous coding block, and the feature key derived from the data features of the current coding block, and builds the dynamic hash values ​​of all coding blocks into a chain structure according to the original sequence of the data blocks. S3: Extract quantum random numbers from physical random sources of vacuum fluctuations or shot noise using a quantum noise encryption module as encryption keys. Use these encryption keys to perform symmetric encryption on the encoded block. Then, perform a bitwise XOR operation on the encryption result with the output of a pseudo-random function that takes the current encoded block's dynamic hash value and a one-time random number as inputs to generate a ciphertext data block. S4: Receive and decrypt the ciphertext data block through the adaptive integrity verification module, extract the feature parameters of the continuous data block according to the sliding window mechanism, and calculate the dynamic integrity score based on the weighted fusion of information entropy and check code matching rate. S5: After the encrypted data block is encapsulated by the secure transmission protocol module, it is transmitted through the encrypted channel. When the dynamic integrity score is lower than the preset security threshold, an abnormal handling operation is triggered.