Distributed data storage transmission method and system based on quantum security and dynamic fragmentation merging
By employing a quantum-safe and dynamic fragmentation merging approach, the problems of low transmission efficiency, high bandwidth consumption, low fault tolerance, and insufficient security in distributed data storage and transmission systems are solved, achieving efficient and secure data transmission and storage.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- TIANJIN URBAN PLANNING & DESIGN INST CO LTD
- Filing Date
- 2026-05-11
- Publication Date
- 2026-07-24
AI Technical Summary
Existing distributed data storage and transmission systems suffer from problems such as low transmission efficiency, high bandwidth consumption, low fault tolerance, poor network condition adaptability, and insufficient security of fragmentation. In particular, they exhibit poor transmission stability and weak resistance to quantum computing attacks in scenarios with large data volumes.
A quantum-safe and dynamic fragmentation merging method is adopted. By binding fragments with unique identifiers to calculate verification values, a multi-dimensional transmission state quantification system is constructed, the number of fragments is dynamically adjusted, and quantum-safe session keys are used for encrypted transmission. A local retransmission mechanism is also adopted to achieve end-to-end security and efficient transmission.
It improves transmission efficiency by more than 30%, reduces bandwidth usage by more than 40%, improves fault tolerance efficiency by 60%, ensures quantum security across the entire link, adapts to network state fluctuations, and solves the problems of transmission stability and security.
Smart Images

Figure CN122160054B_ABST
Abstract
Description
Technical Field
[0001] This invention belongs to the field of information technology, and in particular relates to a distributed data storage and transmission method and system based on quantum security and dynamic fragmentation and merging. Background Technology
[0002] In distributed data storage and transmission systems, data confidentiality, integrity, and transmission efficiency are core requirements. Existing technologies typically employ data sharding and encrypted transmission to ensure security, but these methods still have many shortcomings in practical applications. Currently, distributed sharding transmission mostly adopts an independent transmission mode for each shard. This not only involves numerous transmissions and high bandwidth consumption, leading to low transmission efficiency in large data volume scenarios, but also suffers from imperfect fault tolerance mechanisms—when a storage shard is lost or a transmission anomaly occurs, all shards must be retransmitted in full, resulting in a significant waste of network and computing resources.
[0003] Meanwhile, network conditions suffer from occasional temporary anomalies such as stuttering and packet loss, as well as persistent issues like long-term instability. Existing fragmented transmission methods lack dynamic adaptation strategies and cannot adjust the number of fragments merged based on transmission success rates, resulting in poor transmission stability and a high failure frequency. Furthermore, traditional encryption methods use classical keys, which are weak against quantum computing attacks, and some encryption algorithms have vulnerabilities such as symbol obfuscation and indecipherability. More importantly, existing solutions do not provide security protection for the number of fragments, and fragment segmentation lacks effective confidentiality mechanisms, making it easy for unauthorized interception and cracking of fragmented data, thus failing to achieve a high level of security across the entire storage and transmission chain.
[0004] The aforementioned shortcomings and problems can be summarized into four pain points: 1. Low transmission efficiency and high bandwidth consumption: The existing single-segment independent transmission method has a high frequency of transmissions, which is inefficient in the case of large data volume and consumes a lot of network bandwidth, increasing the system transmission pressure; 2. Low storage and transmission fault tolerance efficiency: When storage fragments are lost, transmission is abnormal, or verification fails, all fragments need to be retransmitted in full, and it is impossible to retransmit the abnormal unit locally, which wastes a lot of network and computing resources. 3. Poor network condition adaptability: It lacks a dynamic fragmentation adjustment mechanism based on transmission success rate, cannot distinguish between occasional and long-term network problems, and is difficult to adapt to network condition fluctuations, resulting in poor transmission stability and high failure frequency; 4. Insufficient security of fragmentation: The number of fragments, as the core parameter of fragmentation, is not kept confidential, making it easy for fragment data to be intercepted and cracked, further reducing the security of data transmission. Summary of the Invention
[0005] This invention proposes a distributed data storage and transmission method and system based on quantum security and dynamic fragmentation merging. It integrates quantum security encryption, dynamic fragmentation merging, double verification and fragmentation quantity confidentiality, takes into account transmission efficiency, fault tolerance and anti-quantum attack characteristics, adapts to network state fluctuations, and solves the pain points of existing technologies.
[0006] To achieve the above objectives, the technical solution of the present invention is implemented as follows: A distributed data storage and transmission method based on quantum security and dynamic fragmentation merging includes: S1. Split the original data into multiple independent fragments, and bind each fragment with a unique identifier ID as a complete fragment; calculate the check value for each complete fragment separately. S2. A preset range for the number of fragments to be transmitted and multi-dimensional indicators for determining the real-time transmission status; a quantitative system for the real-time transmission status is constructed through the multi-dimensional indicators, and a dynamic adjustment rule for adjusting the number of complete fragments is constructed based on the quantitative system; the dynamic adjustment rule quantifies the number of complete fragments based on the multi-dimensional indicators and applies boundary constraints based on the range of the number of fragments. S3. Obtain the number of complete fragments transmitted in the current batch according to the dynamic adjustment rules, merge all complete fragments in the current batch into a transmission unit, and extract the check values corresponding to each complete fragment, and merge them into a fragment check subset corresponding to the transmission unit; encrypt the transmission unit and the fragment check subset based on the quantum-secure session key; calculate a total check value after encryption. S4. The total check value, the encrypted transmission unit, and the encrypted fragment check subset are synchronously transmitted to the receiving end. The receiving end decrypts the data based on the quantum-safe session key and verifies the total check value using the same method as in step S3. After the verification is successful, the number of fragments is estimated based on the decrypted data, and the data is divided to obtain independent fragments and independent fragment check values. S5. Calculate the verification value of each independent fragment obtained from the segmentation using the same method as in step S1, match and verify it with the verification value of the independent fragment obtained from the segmentation, and confirm the legality of the fragment; if the verification fails, retransmit.
[0007] Furthermore, step S1 includes: Assign a unique string identifier to each shard, which includes the shard number, data length, and timestamp; Each shard's unique identifier ID is bound to the shard data itself, forming a complete shard consisting of the identifier ID and the shard data. Calculate the check value for each complete fragment separately, and then summarize them to form a fragment check set.
[0008] Furthermore, in step S2, the preset range of the number of fragments for transmission and the multi-dimensional indicators for determining the real-time transmission status include: The preset range for the number of fragments to be merged and transmitted includes the minimum number of fragments to be merged. Maximum number of fragments to merge ; Preset transmission status judgment parameters, including real-time transmission success rate. Number of consecutive failures Failure rate ; in ; .
[0009] Furthermore, in step S2, the quantization system for real-time transmission status includes: Stable state: ; Sudden abnormal state: ; Long-term anomalous state: ; in This represents the critical value of the network state.
[0010] Furthermore, in step S2, the construction of the dynamic adjustment rules includes: The real-time transmission state is in a stable state: ,like ,Pick ; The real-time transmission status is in a sudden abnormal state: ,like ,Pick ; The real-time transmission status is in a long-term abnormal state: ,like ,Pick ; in This represents the total number of complete fragments transmitted in the current batch. This represents the total number of complete fragments transmitted in the previous batch. This represents the success rate weighting coefficient. This represents the penalty coefficient for consecutive failures. represents the periodic failure decay coefficient, and k represents the incremental step size coefficient.
[0011] Furthermore, the dynamic adjustment rules also include: Single adjustment range constraint: If it exceeds the limit, the maximum range will apply. Adjustment; Recovery transition rule: After a sudden abnormal state returns to a stable state, the current transition rule is applied. Maintain one statistical period Then execute the dynamic adjustment rules; after the long-term abnormal state returns to the stable state, with Maintain 2 statistical periods Then execute the dynamic adjustment rules.
[0012] Furthermore, in step S3, the calculation of the total check value includes: Encrypting the transmission unit with a quantum-safe session key yields an encrypted transmission unit, and encrypting the fragmented verification subset yields an encrypted fragmented verification subset. After the encrypted transmission unit and the encrypted fragment verification subset are concatenated, a hash operation is performed to obtain the total verification value.
[0013] Furthermore, in step S4, estimating the number of fragments for partitioning includes: The receiving end decrypts the transmission unit and the encrypted fragment verification subset based on the quantum-safe session key; Based on the total size of the transmission unit and the data length of a single complete fragment recorded in the master node mapping table, the number of fragments received in the current batch is estimated; the master node mapping table is obtained by communication between the receiving end and the sending end. The transmission unit is divided according to the number of fragments to obtain the independent fragments. The fragment verification subset is divided according to the number of fragments to obtain the independent fragment verification values.
[0014] Furthermore, the retransmission in step S5 adopts a transmission unit local retransmission mechanism, which only retransmits the transmission unit that failed the verification, its corresponding fragment verification subset, and the total verification value. During retransmission, the sending end still executes the same encryption and verification rules according to the number of currently effective complete fragments until the total verification, fragment verification, and fragment legality are all normal.
[0015] In another aspect, this invention proposes a distributed data storage and transmission system based on quantum security and dynamic fragmentation merging, comprising: Splitting module: Splits the original data into multiple independent shards, each shard is bound to a unique identifier ID as a complete shard; calculates a checksum for each complete shard separately; Adjustment rule module: presets the range of the number of fragments to be transmitted and multi-dimensional indicators for determining the real-time transmission status; constructs a quantitative system of the real-time transmission status through the multi-dimensional indicators, and constructs dynamic adjustment rules for adjusting the number of complete fragments based on the quantitative system; the dynamic adjustment rules quantify the number of complete fragments based on the multi-dimensional indicators and impose boundary constraints based on the range of the number of fragments. The merging encryption module: Based on the dynamic adjustment rules, the number of complete fragments transmitted in the current batch is obtained. All complete fragments in the current batch are merged into a transmission unit. Simultaneously, the checksums corresponding to each complete fragment are extracted and merged to form the fragment checksum subset corresponding to the transmission unit. The transmission unit and the fragment checksum subset are encrypted separately based on the quantum-safe session key. After encryption, a total checksum is calculated. Decryption and segmentation module: synchronously transmits the total check value, encrypted transmission unit, and encrypted fragment check subset to the receiving end; the receiving end decrypts based on the quantum-safe session key and verifies the total check value using the same method as the merging encryption module in calculating the total check value; after the verification is successful, the number of fragments is estimated based on the decrypted data, and the data is segmented to obtain independent fragments and independent fragment check values; Verification module: Calculates the verification value of each independent fragment obtained from the splitting module using the same method, matches and verifies the verification value of the independent fragment obtained from the splitting module, and confirms the legality of the fragment; if the verification fails, it is retransmitted.
[0016] Compared with the prior art, the present invention has the following beneficial effects: 1. Improve transmission efficiency and reduce bandwidth usage: This invention uses a dynamic fragmentation and merging adjustment mechanism based on transmission success rate. When the network condition is good, the number of fragments merged is gradually increased, reducing the number of transmissions; when the network condition is poor, the number of merging is reasonably reduced, achieving a balance between efficiency and stability. Compared with independent transmission of a single fragment, the transmission efficiency is improved by more than 30%, and the bandwidth usage is reduced by more than 40%, effectively solving the problems of low transmission efficiency and high bandwidth usage. 2. Improve fault tolerance efficiency and reduce resource waste: This invention adopts a transmission unit local retransmission mechanism, which only retransmits the abnormal transmission unit containing the corresponding check subset and the total check value, without having to retransmit all fragments in full. This improves fault tolerance efficiency by more than 60%, significantly reduces the waste of network and computing resources, and solves the problem of low fault tolerance efficiency in storage and transmission. 3. Ensuring end-to-end quantum security and eliminating decryption vulnerabilities: This invention uses quantum-secure key negotiation to generate session keys, which possess resistance to quantum computing attacks; the decryption logic is completely consistent with the encryption logic, thus completely eliminating decryption vulnerabilities; at the same time, the number of fragments is estimated, and they are not transmitted or encrypted. Combined with the data volume estimation mechanism at the receiving end, the confidentiality of fragment segmentation is further improved, effectively solving the problems of insufficient encryption security and poor fragmentation security, and ensuring the confidentiality, integrity and availability of data from storage to transmission throughout the entire link. 4. Highly implementable and widely adaptable: The solution of this invention has clear steps and is highly operable. All parameters can be customized and adjusted according to system performance and actual network scenarios. No complex hardware upgrades are required. It can be adapted to various distributed data storage and transmission scenarios such as small and medium-sized distributed systems and big data transmission systems. It is highly practical and easy to deploy in engineering. Attached Figure Description
[0017] Figure 1 This is a flowchart of Embodiment 1 of the present invention.
[0018] Figure 2 This is a schematic diagram of the structure of Embodiment 2 of the present invention. Detailed Implementation
[0019] It should be noted that, unless otherwise specified, the embodiments and features described in the present invention can be combined with each other.
[0020] To make the purpose and features of this invention patent more apparent and understandable, the invention will be further described below in conjunction with the accompanying drawings and specific embodiments.
[0021] Example 1: The distributed data storage and transmission method based on quantum security and dynamic fragmentation merging applied in Embodiment 1, such as... Figure 1 As shown, it includes: Step 1: Data fragmentation process: The original data D is split into n independent fragments, each fragment is assigned a unique identifier ID, and the identifier corresponds one-to-one with the fragment.
[0022] The specific binding rules are as follows: 1.1 Assign a unique string identifier ID to each shard. The identifier format is "shard number-data length-timestamp". For example, the ID of the first shard is "1-1024-20260301100000". Where 1 is the shard number; 1024 is the shard data length in bytes; and 20260301100000 is the timestamp, which is obtained based on the shard generation time.
[0023] 1.2 Bind the unique string identifier ID of each shard to the shard data itself. The binding method is to add the identifier ID to the header of the shard data. In this embodiment, the identifier ID is exemplarily fixed at 32 bytes, padded with 0 if necessary, to form a complete shard structure of "identifier ID + shard data". 1.3 Calculate the verification value for each shard separately. The calculation method is exemplarily hash, i.e., Hash(“Identifier ID + Shard Data”), which means performing hash verification on each complete shard and summing the verification values of all shards to form a shard verification set.
[0024] Step 2: Set transmission parameters: The preset range for the number of fragments to be merged and transmitted includes the minimum number of fragments to be merged. Maximum number of fragments to merge The maximum number of fragments to be merged can be customized based on system performance; at the same time, preset transmission status judgment parameters, including real-time transmission success rate, are also included. Number of consecutive failures Failure rate .
[0025] in The value is [0,1]. The value is [0, +∞).
[0026] Step 3: Dynamically adjust the rules for merging fragments: First, a quantization system for real-time transmission status is constructed based on transmission status determination parameters. This quantization system is divided into stable state, sudden abnormal state, and long-term abnormal state, including: Stable state: ; Sudden abnormal state: ; Long-term anomalous state: ; in This is the critical value for the network state, with a value of (0,1), which can be customized according to requirements.
[0027] Based on the above quantification system, a dynamic adjustment rule for the number of fragments during fragment merging is constructed. This dynamic adjustment rule also includes boundary constraints, specifically: The real-time transmission state is in a stable state: ,like ,Pick ; The real-time transmission status is in a sudden abnormal state: ,like ,Pick ; The real-time transmission status is in a long-term abnormal state: ,like ,Pick ; in This represents the total number of complete fragments transmitted in the current batch. This represents the total number of complete fragments transmitted in the previous batch. This represents the success rate weighting coefficient, with a value of (0,1]. This represents the penalty coefficient for consecutive failures, and its value is [1, +∞). This represents the periodic failure attenuation coefficient, with a value of (0,1); k represents the incremental step size coefficient, which takes a positive integer value and can be customized according to requirements.
[0028] All formulas use floor functions, and all calculation results are guaranteed to be positive integers.
[0029] This embodiment also sets smoothing and recovery rules in the dynamic adjustment rules.
[0030] Single adjustment range constraint: If it exceeds the limit, the maximum range will apply. Adjustment; Recovery transition rule: After a sudden abnormal state returns to a stable state, the current transition rule is applied. Maintain one statistical period Then execute the dynamic adjustment rules; after the long-term abnormal state returns to the stable state, with Maintain 2 statistical periods Then execute the dynamic adjustment rules.
[0031] This embodiment constructs a dynamic adjustment rule for the number of fragments, breaking through the existing single threshold and fixed increase / decrease fragment adjustment mode. It innovatively constructs a multi-dimensional quantitative indicator system, integrating real-time transmission success rate, consecutive failure count, and periodic failure frequency to determine network status. A differentiated mathematical formula is designed to achieve non-linear dynamic adjustment of the fragment merging number. A weighted increase is applied to stable states, while penalties decrease for sudden abnormal states. For long-term abnormal states, the attenuation magnitude is positively correlated with the number of failures through exponentiation. Furthermore, amplitude constraints and recovery transition rules are added to avoid abrupt adjustments and oscillations. Compared to traditional coarse-grained adjustments, this achieves precise adaptation between network status and the number of fragments, making adjustments more scientific, dynamic, and aligned with actual network fluctuation characteristics, improving the adaptability of transmission efficiency and stability.
[0032] Step 4: Encrypt the transmission unit: The number of complete fragments m in the current batch is obtained according to the dynamic adjustment rules. All complete fragments in the current batch are then transferred. The fragments are merged into a single transmission unit, and the checksums corresponding to the m complete fragments are extracted simultaneously. This forms the fragmented verification subset corresponding to the transmission unit; a quantum-secure session key K is generated using a quantum-secure key negotiation mechanism to encrypt both the transmission unit and the fragmented verification subset, with the encryption formulas as follows: , ;in, For encrypted transmission units, For encrypted fragment verification subsets, " This indicates the concatenation operation of complete fragments or check values, that is, concatenating m complete fragments in sequence to form a transmission unit, and concatenating m check values in sequence to form a fragment check subset; "" indicates that a symmetric encryption algorithm (XOR) is used to encrypt the concatenated content with a quantum-safe session key K.
[0033] Step 5: Generate total checksum: Storage layer for encrypted transmission units and encrypted fragment verification subset Together, they calculate a total check value. This is used to generate a total checksum by combining two encrypted contents; the total checksum is used for the first round of integrity verification at the receiving end; the total checksum and the encrypted transmission unit... Encryption fragment verification subset Synchronized storage, with a one-to-one correspondence.
[0034] Step 6: Data transmission: During transport layer transmission, the following content is transmitted synchronously: encrypted transmission unit. Encryption fragment verification subset Total check value The value of m is not transmitted separately. The receiving end can estimate the number of complete fragments m transmitted in the current batch by combining the total amount of data in the decrypted transmission unit with the preset length of a single fragment in the master node mapping table, thus ensuring the confidentiality of m and further improving transmission security. The encryption process only uses the quantum-safe session key K to ensure the consistency between encryption security and title quantum security.
[0035] Step 7: Data Decryption and Verification: After receiving all transmitted content, the receiving end performs decryption, segmentation, and verification according to the following steps: 7.1 First, decrypt using the quantum-safe session key K. and The decryption logic is: the concatenated set of fragments = The concatenated set of verification values = The symmetric decryption operation (XOR) is performed in accordance with the symmetric encryption during encryption to obtain the merged data (transmission unit) of m complete fragments spliced in order and the fragment check subset spliced in order of m check values.
[0036] 7.2 Based on the total size of the decrypted and merged data, and combined with the length of a single fragment recorded in the master node mapping table, the receiving end estimates the number of complete fragments m transmitted in the current batch. This m is consistent with that of the sending end. This step ensures that only the sending and receiving parties know this information, thus improving security and confidentiality. The master node mapping table is obtained through communication between the receiving end and the sending end (master node), such as by the master node actively pushing it or the receiving end actively pulling it. The length of a single fragment can be queried through the identifier ID in the master node mapping table.
[0037] 7.3 The decrypted transmission unit and fragment check subset are concatenated, and then the same hash operation as in step 5 is performed to calculate the hash value of the concatenated part, which is then compared with the received total check value. Compare the data to complete the first round of overall verification; if the overall verification fails, it is directly determined as data anomaly, and the anomaly handling steps in step 8 are executed.
[0038] 7.4 After the overall verification passes, based on the estimated m, m independent complete fragments are divided. In this embodiment, each fragment is "32-byte identifier ID + fragment data". Therefore, the fixed length of the identifier ID (32 bytes) can be combined to accurately divide and obtain independent fragments. At the same time, based on the fragment verification subset obtained after decryption and division by m, m independent fragment verification values are obtained. 7.5 For each independent shard, perform the same hash operation as in step 1 to calculate the check value separately, and then match the check value with the check value of the independent shard one by one; at the same time, extract the identifier ID of each shard, parse the information and match it with the master node mapping table to confirm the legality of the shard; 7.6 If all fragment checks match and the identifiers pass the check, the data transmission is considered normal; if any fragment check fails or the identifier is abnormal, the data is considered abnormal, and the abnormal handling steps in step 8 are executed.
[0039] Step 8: Exception Handling Steps: If the overall verification fails, the fragment verification fails, or the identifier is abnormal, it is considered that the data is abnormal; in this case, only the corresponding abnormal encrypted transmission unit is retransmitted. Encryption fragment verification subset and total check value There is no need to retransmit all fragments; during retransmission, the sending end still merges fragments and generates verification according to the currently effective m, and the receiving end still estimates m based on the amount of decrypted data. The encryption process always uses the quantum-safe session key K and is executed according to the same encryption and verification rules until the total verification, fragment verification and identifier matching are all normal.
[0040] Through steps 1-8 above, the receiving end obtains the correct fragmented data. After all fragmented data transmission is completed, the receiving end restores the entire original data D based on the identifier ID of each fragmented data.
[0041] This embodiment integrates quantum-secure encryption and dynamic fragmentation merging, while performing dual verification and keeping the number of fragments confidential. It balances transmission efficiency, fault tolerance, and resistance to quantum attacks, adapts to network state fluctuations, and can solve many pain points of existing technologies.
[0042] Example 2: This embodiment proposes a distributed data storage and transmission system based on quantum security and dynamic fragmentation merging, such as... Figure 2 As shown, it includes: Splitting module: Splits the original data into multiple independent shards, each shard is bound to a unique identifier ID as a complete shard; calculates a checksum for each complete shard separately; Adjustment rule module: presets the range of the number of fragments to be transmitted and multi-dimensional indicators for determining the real-time transmission status; constructs a quantitative system of the real-time transmission status through the multi-dimensional indicators, and constructs dynamic adjustment rules for adjusting the number of complete fragments based on the quantitative system; the dynamic adjustment rules quantify the number of complete fragments based on the multi-dimensional indicators and impose boundary constraints based on the range of the number of fragments. The merging encryption module: Based on the dynamic adjustment rules, the number of complete fragments transmitted in the current batch is obtained. All complete fragments in the current batch are merged into a transmission unit. Simultaneously, the checksums corresponding to each complete fragment are extracted and merged to form the fragment checksum subset corresponding to the transmission unit. The transmission unit and the fragment checksum subset are encrypted separately based on the quantum-secure session key. After encryption, a total checksum is calculated. Decryption and segmentation module: synchronously transmits the total check value, encrypted transmission unit, and encrypted fragment check subset to the receiving end; the receiving end decrypts based on the quantum-safe session key and verifies the total check value using the same method as the merging encryption module in calculating the total check value; after the verification is successful, the number of fragments is estimated based on the decrypted data, and the data is segmented to obtain independent fragments and independent fragment check values; Verification module: Calculates the verification value of each independent fragment obtained from the splitting module using the same method, matches and verifies the verification value of the independent fragment obtained from the splitting module, and confirms the legality of the fragment; if the verification fails, it is retransmitted.
[0043] The split modules include: Assign a unique string identifier to each shard, which includes the shard number, data length, and timestamp; Each shard's unique identifier ID is bound to the shard data itself, forming a complete shard consisting of the identifier ID and the shard data. Calculate the check value for each complete fragment separately, and then summarize them to form a fragment check set.
[0044] The adjustment rules module includes preset ranges for the number of fragments to be transmitted and multi-dimensional indicators for determining the real-time transmission status, such as: The preset range for the number of fragments to be merged and transmitted includes the minimum number of fragments to be merged. Maximum number of fragments to merge ; Preset transmission status judgment parameters, including real-time transmission success rate. Number of consecutive failures Failure rate ; in ; .
[0045] In the adjustment rules module, the quantification system for real-time transmission status includes: Stable state: ; Sudden abnormal state: ; Long-term anomalous state: ; in This represents the critical value of the network state.
[0046] In the adjustment rules module, the construction of dynamic adjustment rules includes: The real-time transmission state is in a stable state: ,like ,Pick ; The real-time transmission status is in a sudden abnormal state: ,like ,Pick ; The real-time transmission status is in a long-term abnormal state: ,like ,Pick ; in This represents the total number of complete fragments transmitted in the current batch. This represents the total number of complete fragments transmitted in the previous batch. This represents the success rate weighting coefficient. This represents the penalty coefficient for consecutive failures. represents the periodic failure decay coefficient, and k represents the incremental step size coefficient.
[0047] The dynamic adjustment rules in the adjustment rules module also include: Single adjustment range constraint: If it exceeds the limit, the maximum range will apply. Adjustment; Recovery transition rule: After a sudden abnormal state returns to a stable state, the current transition rule is applied. Maintain one statistical period Then execute the dynamic adjustment rules; after the long-term abnormal state returns to the stable state, with Maintain 2 statistical periods Then execute the dynamic adjustment rules.
[0048] In the merged encryption module, the calculation of the total checksum includes: Encrypting the transmission unit with a quantum-safe session key yields an encrypted transmission unit, and encrypting the fragmented verification subset yields an encrypted fragmented verification subset. After the encrypted transmission unit and the encrypted fragment verification subset are concatenated, a hash operation is performed to obtain the total verification value.
[0049] In the decryption and segmentation module, the process of estimating the number of fragments and then segmenting includes: The receiving end decrypts the transmission unit and the encrypted fragment verification subset based on the quantum-safe session key; Based on the total size of the transmission unit and the data length of a single complete fragment recorded in the master node mapping table, the number of fragments received in the current batch is estimated; the master node mapping table is obtained by communication between the receiving end and the sending end. The transmission unit is divided according to the number of fragments to obtain the independent fragments. The fragment verification subset is divided according to the number of fragments to obtain the independent fragment verification values.
[0050] The retransmission in the verification module adopts a transmission unit local retransmission mechanism, which only retransmits the transmission unit that failed the verification, its corresponding fragment verification subset, and the total verification value. During retransmission, the sending end still executes the same encryption and verification rules according to the number of currently effective complete fragments until the total verification, fragment verification, and fragment legality are all normal.
[0051] The distributed data storage and transmission system based on quantum security and dynamic fragmentation merging proposed in this embodiment can realize the distributed data storage and transmission method based on quantum security and dynamic fragmentation merging described in Embodiment 1, and has the same technical effect as Embodiment 1.
[0052] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the protection scope of the present invention.
Claims
1. A distributed data storage and transmission method based on quantum security and dynamic fragmentation merging, characterized in that, include: S1. Split the original data into multiple independent shards, and bind each shard with a unique identifier ID as a complete shard; Calculate the checksum separately for each complete fragment; S2. A preset range for the number of fragments to be transmitted and multi-dimensional indicators for determining the real-time transmission status; a quantitative system for the real-time transmission status is constructed through the multi-dimensional indicators, and a dynamic adjustment rule for adjusting the number of complete fragments is constructed based on the quantitative system; the dynamic adjustment rule quantifies the number of complete fragments based on the multi-dimensional indicators and applies boundary constraints based on the range of the number of fragments. S3. According to the dynamic adjustment rules, obtain the number of complete fragments transmitted in the current batch, merge all complete fragments in the current batch into a transmission unit, and extract the check value corresponding to each complete fragment, and merge them into the fragment check subset corresponding to the transmission unit. The transmission unit and the fragmented verification subset are encrypted using quantum-safe session keys. After encryption, a total checksum is calculated together. S4. The total check value, the encrypted transmission unit, and the encrypted fragment check subset are synchronously transmitted to the receiving end; the receiving end decrypts the total check value based on the quantum-safe session key and verifies the total check value using the same method as calculating the total check value in step S3. After the verification is successful, the number of fragments is estimated based on the decrypted data, and the data is divided to obtain independent fragments and independent fragment verification values; S5. Calculate the verification value of each independent fragment obtained from the segmentation using the same method as in step S1, match and verify it with the verification value of the independent fragment obtained from the segmentation, and confirm the legality of the fragment; if the verification fails, retransmit.
2. The distributed data storage and transmission method based on quantum security and dynamic fragmentation merging according to claim 1, characterized in that, include: Assign a unique string identifier to each shard, which includes the shard number, data length, and timestamp; Each shard's unique identifier ID is bound to the shard data itself, forming a complete shard consisting of the identifier ID and the shard data. Calculate the check value for each complete fragment separately, and then summarize them to form a fragment check set.
3. The distributed data storage and transmission method based on quantum security and dynamic fragmentation merging according to claim 1, characterized in that, In step S2, the preset range of the number of fragments to be transmitted and the multi-dimensional indicators for determining the real-time transmission status include: The preset range for the number of fragments to be merged and transmitted includes the minimum number of fragments to be merged. Maximum number of fragments to merge ; Preset transmission status judgment parameters, including real-time transmission success rate. Number of consecutive failures Failure rate ; in ; 。 4. The distributed data storage and transmission method based on quantum security and dynamic fragmentation merging according to claim 3, characterized in that, In step S2, the quantization system for real-time transmission status includes: Stable state: ; Sudden abnormal state: ; Long-term anomalous state: ; in This represents the critical value of the network state.
5. The distributed data storage and transmission method based on quantum security and dynamic fragmentation merging according to claim 4, characterized in that, In step S2, the construction of the dynamic adjustment rules includes: The real-time transmission state is in a stable state: ,like ,Pick ; The real-time transmission status is in a sudden abnormal state: ,like ,Pick ; The real-time transmission status is in a long-term abnormal state: ,like ,Pick ; in This represents the total number of complete fragments transmitted in the current batch. This represents the total number of complete fragments transmitted in the previous batch. This represents the success rate weighting coefficient. This represents the penalty coefficient for consecutive failures. represents the periodic failure decay coefficient, and k represents the incremental step size coefficient.
6. The distributed data storage and transmission method based on quantum security and dynamic fragmentation merging according to claim 5, characterized in that, The dynamic adjustment rules also include: Single adjustment range constraint: If it exceeds the limit, the maximum range will apply. Adjustment; Recovery transition rule: After a sudden abnormal state returns to a stable state, the current transition rule is applied. Maintain one statistical period Then execute the dynamic adjustment rules; after the long-term abnormal state returns to the stable state, with Maintain 2 statistical periods Then execute the dynamic adjustment rules.
7. The distributed data storage and transmission method based on quantum security and dynamic fragmentation merging according to claim 1, characterized in that, In step S3, the calculation of the total check value includes: Encrypting the transmission unit with a quantum-safe session key yields an encrypted transmission unit, and encrypting the fragmented verification subset yields an encrypted fragmented verification subset. After the encrypted transmission unit and the encrypted fragment verification subset are concatenated, a hash operation is performed to obtain the total verification value.
8. The distributed data storage and transmission method based on quantum security and dynamic fragmentation merging according to claim 1, characterized in that, In step S4, estimating the number of fragments for partitioning includes: The receiving end decrypts the transmission unit and the encrypted fragment verification subset based on the quantum-safe session key; Based on the total size of the transmission unit and the data length of a single complete fragment recorded in the master node mapping table, the number of fragments received in the current batch is estimated; the master node mapping table is obtained by communication between the receiving end and the sending end. The transmission unit is divided according to the number of fragments to obtain the independent fragments. The fragment verification subset is divided according to the number of fragments to obtain the independent fragment verification values.
9. The distributed data storage and transmission method based on quantum security and dynamic fragmentation merging according to claim 1, characterized in that, The retransmission in step S5 adopts a transmission unit local retransmission mechanism, which only retransmits the transmission unit that failed the verification, its corresponding fragment verification subset, and the total verification value. During retransmission, the sending end still executes the same encryption and verification rules according to the number of currently effective complete fragments until the total verification, fragment verification, and fragment legality are all normal.
10. A distributed data storage and transmission system based on quantum security and dynamic fragmentation merging, characterized in that, include: Splitting module: Splits the original data into multiple independent shards, and each shard is bound to a unique identifier ID as a complete shard; Calculate the checksum separately for each complete fragment; Adjustment rule module: presets the range of the number of fragments to be transmitted and multi-dimensional indicators for determining the real-time transmission status; constructs a quantitative system of the real-time transmission status through the multi-dimensional indicators, and constructs dynamic adjustment rules for adjusting the number of complete fragments based on the quantitative system; the dynamic adjustment rules quantify the number of complete fragments based on the multi-dimensional indicators and impose boundary constraints based on the range of the number of fragments. Merge encryption module: According to the dynamic adjustment rules, the number of complete fragments transmitted in the current batch is obtained, all complete fragments in the current batch are merged into a transmission unit, and the corresponding check values of each complete fragment are extracted and merged to form the fragment check subset corresponding to the transmission unit. The transmission unit and the fragmented verification subset are encrypted using quantum-safe session keys. After encryption, a total checksum is calculated together. Decryption and segmentation module: synchronously transmits the total check value, the encrypted transmission unit, and the encrypted fragment check subset to the receiving end; the receiving end decrypts based on the quantum-safe session key and verifies the total check value using the same method as the merging encryption module in calculating the total check value. After the verification is successful, the number of fragments is estimated based on the decrypted data, and the data is divided to obtain independent fragments and independent fragment verification values; Verification module: Calculates the verification value of each independent fragment obtained from the splitting module using the same method, matches and verifies the verification value of the independent fragment obtained from the splitting module, and confirms the legality of the fragment; if the verification fails, it is retransmitted.
Citation Information
Patent Citations
Symmetric encryption key secure transmission method and system
CN121239405A
Power real-time data dynamic encryption transmission method and system based on national secret algorithm
CN121239449A