Dynamic fragmentation data transmission method and related device
By combining quantum-resistant encryption algorithms with dynamic fragmentation parameter generation, the security and efficiency issues of traditional encryption methods under complex network attacks are solved, achieving high-security and low-overhead data transmission.
Patent Information
- Application Number
- CN202611299172.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2026-08-25
- Publication Date
- 2026-11-17
AI Technical Summary
When faced with complex network attacks, existing encryption methods are vulnerable. Traditional symmetric encryption algorithms are easily cracked by stolen keys, resulting in poor security. Asymmetric encryption algorithms, on the other hand, have high computational complexity, leading to low data transmission efficiency.
Data encryption is performed using quantum-resistant encryption algorithms such as NTRU encryption, and multiple authenticity verifications and data integrity checks are performed by hash encapsulation, combined with dynamic fragmentation generation parameters and zero-knowledge proofs. The Shamir secret sharing algorithm and quantum random number generator are used for fragmentation generation and transmission path optimization.
It improves the resistance of fragmented data to quantum-based attacks, dynamically adapts to attack intensity, ensures data transmission security, reduces data overhead, and meets data transmission security requirements.
Smart Images

Figure CN123122810A_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of data transmission technology, and in particular to a dynamic fragmented data transmission method and related equipment. Background Technology
[0002] Currently, with the continuous improvement of digitalization, network attack methods are also constantly being updated, and single encryption methods are becoming increasingly vulnerable in the face of complex attack forms.
[0003] In related technologies, symmetric and asymmetric encryption algorithms are commonly used to ensure data transmission security. However, in practical applications, it has been found that traditional encryption methods suffer from problems such as the vulnerability of symmetric encryption algorithms to key theft and subsequent cracking, resulting in poor security; the high overhead of asymmetric encryption algorithms due to complex mathematical operations; and low data transmission efficiency.
[0004] In summary, the technical problems existing in the relevant technologies need to be improved. Summary of the Invention
[0005] This application provides a dynamic fragmented data transmission method and related equipment, which can flexibly adapt to the intensity of attacks and perform multiple authenticity verifications and data integrity checks when reassembling data, thereby improving data security and reducing data overhead, and effectively meeting the data transmission security requirements.
[0006] On one hand, embodiments of this application provide a dynamic fragmented data transmission method, the method comprising the following steps: The original data to be transmitted is obtained, encrypted using a quantum-resistant encryption algorithm, and then hashed to obtain a digital envelope. Real-time monitoring and acquisition of transmission network quality indicators and risk assessment are performed. Based on the risk assessment calculation results, fragmentation generation parameters are dynamically determined. The digital envelope is then fragmented according to the fragmentation generation parameters to obtain fragmented data. The fragmentation generation parameters include a fragmentation recovery threshold and a total number of fragments generated. The reliability weight of each node in the transmission network is quantitatively evaluated, and then a transmission path is generated based on the reliability weight of each node and cross-autonomous region constraints, so as to transmit the fragmented data to the target node according to the transmission path. After the target node receives the fragmented data, it verifies the authenticity of the fragmented data through zero-knowledge proof, and performs double verification by combining interpolation recovery and quantum random numbers. Then, if the double verification passes, the original data is recovered from the fragmented data, thus completing the dynamic fragmented data transmission.
[0007] Optionally, the step of obtaining the original data to be transmitted, encrypting the original data using a quantum-resistant encryption algorithm, and hashing and encapsulating the original data to obtain a digital envelope includes: The original data to be transmitted is obtained, and combined with the NTRU public key, the original data is encrypted using the NTRU quantum-resistant encryption algorithm to obtain the encrypted original data. Based on the encrypted original data, a hash calculation is performed using a hash algorithm to obtain the hash value; The encrypted original data, hash calculation value, and timestamp are bound and encapsulated to obtain a digital envelope.
[0008] Optionally, the method further includes: Generate an NTRU private key that satisfies the reversibility requirement; NTRU public key is calculated and generated based on the NTRU private key, and then the public key is exchanged with the target node; Based on the public key exchange result, the master key is derived through computation.
[0009] Optionally, the real-time monitoring acquires transmission network quality indicators and performs risk assessment, dynamically determines fragmentation generation parameters based on the risk assessment calculation results, and performs fragmentation generation processing on the digital envelope according to the fragmentation generation parameters to obtain fragmented data, including: Real-time monitoring acquires transmission network quality indicators, and risk assessment is performed using an S-curve function to obtain risk assessment results; wherein, the transmission network quality indicators include the frequency of distributed denial-of-service attacks and abnormal traffic scores; Based on the risk assessment calculation results, combined with the preset generation formula and constraints, the segmentation generation parameters are dynamically determined; Based on the dynamically determined fragmentation generation parameters, the digital envelope is fragmented using the Shamir secret sharing algorithm, a quantum random number generator, and a salt value to obtain fragmented data.
[0010] Optionally, the quantitative evaluation of the reliability weights of each node in the transmission network, and then, based on the reliability weights of each node and combined with cross-autonomous region constraints, generating a transmission path to transmit the fragmented data to the target node according to the transmission path, includes: The system obtains the node online rate, bandwidth utilization rate, and risk score of each node in the transmission network, and then uses weighted fusion calculation to quantitatively evaluate the reliability weight of each node in the transmission network. Based on the reliability weights of each node, and combined with the objective function of minimizing transmission risk and delay and cross-autonomous region constraints, a transmission path is generated. The fragmented data is transmitted to the target node according to the transmission path.
[0011] Optionally, after the target node receives the fragmented data, it verifies the authenticity of the fragmented data using zero-knowledge proof, and performs dual verification using interpolation recovery and quantum random numbers. Then, if the dual verification passes, the original data is recovered from the fragmented data, completing the dynamic fragmented data transmission. This includes: After the target node receives the fragmented data, it verifies the authenticity of the fragmented data using zero-knowledge proof. After the zero-knowledge proof verification is passed, the fragmented data is recovered by Lagrange interpolation and the recovered secret information is verified by combining the master key, and the response verification is performed by generating quantum random numbers; If the interpolation recovery and quantum random number verification pass, the original data is recovered from the fragmented data, thus completing the dynamic fragmented data transmission.
[0012] On the other hand, embodiments of this application provide a dynamic fragmented data transmission apparatus, the apparatus comprising: The data encryption module is used to acquire the original data to be transmitted, encrypt the original data using a quantum-resistant encryption algorithm, and then perform hash encapsulation to obtain a digital envelope. The fragmentation generation module is used to monitor and acquire transmission network quality indicators in real time and perform risk assessment. Based on the risk assessment calculation results, it dynamically determines fragmentation generation parameters to perform fragmentation generation processing on the digital envelope according to the fragmentation generation parameters to obtain fragmented data. The fragmentation generation parameters include a fragmentation recovery threshold and a total number of fragments generated. The routing and transmission module is used to quantitatively evaluate the reliability weight of each node in the transmission network, and then generate a transmission path based on the reliability weight of each node and cross-autonomous region constraints, so as to transmit the fragmented data to the target node according to the transmission path. The verification and decryption module is used to verify the authenticity of the fragmented data by using zero-knowledge proof after the target node receives the fragmented data, and to perform double verification by combining interpolation recovery and quantum random numbers. Then, if the double verification passes, the original data can be recovered from the fragmented data to complete the dynamic fragmented data transmission.
[0013] On the other hand, embodiments of this application provide an electronic device, which includes a memory and a processor. The memory stores a computer program, and the processor executes the computer program to implement the above-described method.
[0014] On the other hand, embodiments of this application provide a computer-readable storage medium storing a computer program that, when executed by a processor, implements the above-described method.
[0015] On the other hand, embodiments of this application provide a computer program product, including a computer program that, when executed by a processor, implements the above-described method.
[0016] This application embodiment effectively improves the quantum-resistant encryption strength of fragmented data by integrating quantum-resistant encryption algorithms with dynamically generated fragmentation parameters. It also achieves flexible adaptation to attack strength by dynamically adjusting the generation parameters and performs multiple authenticity verifications and data integrity checks during data reassembly, thereby improving data security and reducing data overhead, and effectively meeting the data transmission security requirements. Attached Figure Description
[0017] Figure 1 This is a schematic diagram of the implementation environment of a dynamic fragmented data transmission method provided in an embodiment of this application; Figure 2 This is a flowchart illustrating a dynamic fragmented data transmission method provided in an embodiment of this application; Figure 3 This is a flowchart illustrating the structure of dynamic fragmented data transmission according to an embodiment of this application; Figure 4 This is a schematic diagram of a dynamic fragmented data transmission process provided in an embodiment of this application; Figure 5 This is a schematic diagram of the structure of a dynamic fragmented data transmission device provided in an embodiment of this application; Figure 6 This is a schematic diagram of the hardware structure of an electronic device provided in an embodiment of this application. Detailed Implementation
[0018] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of this application and are not intended to limit it. In the following description, when referring to the accompanying drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with those of this application; they are merely examples of apparatuses and methods consistent with some aspects of the embodiments of this application as detailed in the appended claims.
[0019] It is understood that the terms “first,” “second,” etc., used in this application may be used herein to describe various concepts, but unless otherwise stated, these concepts are not limited by these terms. These terms are only used to distinguish one concept from another. For example, without departing from the scope of the embodiments of this application, first information may also be referred to as second information, and similarly, second information may also be referred to as first information. Depending on the context, the words “if,” “when,” or “in response to a determination” as used herein may be interpreted as “when…” or “when…” or “in response to a determination.”
[0020] As used in this application, the terms "at least one", "multiple", "each", "any", etc., "at least one" includes one, two or more, "multiple" includes two or more, "each" refers to each of the corresponding multiples, and "any" refers to any one of the multiples.
[0021] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein is for the purpose of describing embodiments of this application only and is not intended to limit this application.
[0022] Currently, with the continuous improvement of digitalization, network attack methods are also constantly being updated, and single encryption methods are becoming increasingly vulnerable in the face of complex attack forms.
[0023] In related technologies, symmetric and asymmetric encryption algorithms are commonly used to ensure data transmission security. However, in practical applications, it has been found that traditional encryption methods suffer from problems such as the vulnerability of symmetric encryption algorithms to key theft and subsequent cracking, resulting in poor security; the high overhead of asymmetric encryption algorithms due to complex mathematical operations; and low data transmission efficiency.
[0024] In view of this, this application provides a dynamic fragmented data transmission method and related equipment. By integrating anti-quantum encryption algorithms with dynamically generated fragmentation parameters, the anti-quantum cracking strength of fragmented data can be effectively improved. Furthermore, by dynamically adjusting the generation parameters, the attack strength can be flexibly adapted, and multiple authenticity verifications and data integrity checks can be performed during data reassembly, thereby improving data security and reducing data overhead, and effectively meeting the data transmission security requirements.
[0025] It should be noted that in all specific embodiments of this application, when processing data related to user identity or characteristics, such as user information, user behavior data, user historical data, and user location information, user permission or consent is obtained first. Furthermore, the collection, use, and processing of this data comply with relevant laws, regulations, and standards. In addition, when embodiments of this application require access to sensitive personal information of users, separate permission or consent from the user is obtained through pop-ups or redirection to confirmation pages. Only after obtaining the user's separate permission or consent is the necessary user-related data required for the proper functioning of these embodiments acquired.
[0026] The specific implementation methods of the embodiments of this application will be described in detail below with reference to the accompanying drawings. First, a dynamic fragmented data transmission method provided in the embodiments of this application will be described with reference to the accompanying drawings.
[0027] Please refer to Figure 1 , Figure 1 This is a schematic diagram illustrating the implementation environment of a dynamic fragmented data transmission method provided in this application embodiment. In this implementation environment, the main hardware and software components involved include a terminal processor 110 and a server 120.
[0028] Specifically, the terminal processor 110 may be equipped with a control program for a dynamic fragmented data transmission method, and the server 120 serves as the backend server for this control program. The terminal processor 110 and the backend server 120 are connected via a communication link. The dynamic fragmented data transmission method provided in this embodiment can be executed on the terminal processor 110 side.
[0029] Server 120 can be a standalone physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDN (Content Delivery Network), and big data and artificial intelligence platforms.
[0030] In addition, server 120 can also be a node server in a blockchain network.
[0031] The terminal processor 110 and the server 120 can establish a communication connection via a wireless network. This wireless network uses standard communication technologies and / or protocols. The network can be the Internet or any other network, including but not limited to a Local Area Network (LAN), Metropolitan Area Network (MAN), Wide Area Network (WAN), mobile, or any combination of wireless networks, private networks, or virtual private networks. Furthermore, these hardware and software components can use the same or different communication connection methods; this application does not impose specific limitations in this regard.
[0032] Of course, this is understandable. Figure 1 The implementation environment described in this application is only one of the optional application scenarios for the dynamic fragmented data transmission method provided in this embodiment. The actual application is not fixed. Figure 1 The software and hardware environment shown is not specifically limited in this application.
[0033] like Figure 2 As shown, Figure 2 This is a flowchart illustrating a dynamic fragmented data transmission method provided in an embodiment of this application, specifically including but not limited to steps 100 to 400.
[0034] Step 100: Obtain the original data to be transmitted, encrypt the original data using a quantum-resistant encryption algorithm, and perform hash encapsulation to obtain a digital envelope.
[0035] In this embodiment of the application, after the data transmission task is started, the original data to be transmitted can be obtained, and the original data can be encrypted by using a quantum-resistant encryption algorithm to prevent the quantum computer from stealing and cracking the data information during the transmission process. The encrypted data can be hashed using a hash algorithm, and finally the data is encapsulated to obtain a digital envelope in the data format used for transmission.
[0036] Specifically, please refer to Figure 3 , Figure 3This application provides a flowchart illustrating the structure of dynamic fragmented data transmission. The dynamic fragmented data transmission task mainly includes four steps: data quantum encryption, dynamic fragment generation, intelligent routing control, and secure reassembly verification. By performing quantum-resistant encryption and hash encapsulation on the original data, quantum-safe preprocessing before data transmission can be completed. This can be achieved using the NTRU (N-th Degree Truncated Polynomial Ring) encryption algorithm and HMAC (Hash-based Message Authentication Code) signature authentication.
[0037] In practical applications, the process of acquiring the original data to be transmitted, encrypting the original data using a quantum-resistant encryption algorithm, and hashing and encapsulating the data to obtain a digital envelope includes: The original data to be transmitted is obtained, and combined with the NTRU public key, the original data is encrypted using the NTRU quantum-resistant encryption algorithm to obtain the encrypted original data. Based on the encrypted original data, a hash calculation is performed using a hash algorithm to obtain the hash value; The encrypted original data, hash calculation value, and timestamp are bound and encapsulated to obtain a digital envelope.
[0038] In the embodiments of this application, please refer to Figure 4 , Figure 4 This is a schematic diagram of a dynamic fragmented data transmission process provided in an embodiment of this application. After obtaining the original data to be transmitted, the original data is encrypted using the NTRU quantum-resistant encryption algorithm to obtain the encrypted original data. Specifically, encryption can be performed by combining the original data with the NTRU public key.
[0039] The NTRU public key can be generated from the NTRU private key.
[0040] Furthermore, based on the encrypted original data, a hash calculation is performed using a hash algorithm to obtain the hash value, and the timestamp of the current data security preprocessing is obtained. Thus, the encrypted original data, the hash value, and the timestamp are bound and encapsulated to obtain an immutable digital envelope for transmission.
[0041] In practical applications, the method further includes: Generate an NTRU private key that satisfies the reversibility requirement; NTRU public key is calculated and generated based on the NTRU private key, and then the public key is exchanged with the target node; Based on the public key exchange result, the master key is derived through computation.
[0042] In this embodiment of the application, an NTRU private key that satisfies the reversibility criterion can be generated as the sender's private key, and a public key can be calculated based on the generated NTRU private key that satisfies the reversibility criterion, which can then be used as the sender's key material.
[0043] Furthermore, the public keys of the sender and receiver are exchanged through a secure channel, thereby obtaining a consistent shared secret through a secure key negotiation process. Then, a shared master key is derived through a key derivation function for subsequent data fragment signing.
[0044] Therefore, this application generates quantum-resistant key pairs based on the NTRU lattice basis problem as key materials for the sender and receiver, and derives a shared master key for subsequent fragment signing. This protects the original data from quantum computer cracking by encrypting it with the NTRU quantum-resistant algorithm, calculates the hash value using a hash algorithm to generate a fixed-length data fingerprint for subsequent integrity verification, and adds a timestamp identifier during data security processing to prevent replay attacks and ensure data timeliness. Finally, it encapsulates the data into an immutable digital envelope, which can effectively improve the quantum cracking resistance of fragmented data.
[0045] Step 200: Monitor and acquire transmission network quality indicators in real time and conduct risk assessment. Dynamically determine fragmentation generation parameters based on the risk assessment calculation results, and perform fragmentation generation processing on the digital envelope according to the fragmentation generation parameters to obtain fragmented data; wherein, the fragmentation generation parameters include fragmentation recovery threshold and total number of fragments generated.
[0046] In the embodiments of this application, such as Figure 3 As shown, when dynamically generating fragments based on the digital envelopes that have completed data encryption and encapsulation, the risk assessment results of the current data transmission can be obtained by dynamically sensing the quality indicators of the current transmission network. The fragment generation parameters are then dynamically determined according to the risk level. The fragment generation parameters include the fragment recovery threshold k and the total number of fragments generated n.
[0047] Furthermore, the digital envelope is processed to generate fragments based on the determined fragmentation generation parameters to obtain fragmented data, which can then be transmitted to the target node according to the transmission path.
[0048] Specifically, as an optional implementation, the real-time monitoring acquires transmission network quality indicators and performs risk assessment. Based on the risk assessment calculation results, fragmentation generation parameters are dynamically determined. The digital envelope is then fragmented according to these parameters to obtain fragmented data, including: Real-time monitoring acquires transmission network quality indicators, and risk assessment is performed using an S-curve function to obtain risk assessment results; wherein, the transmission network quality indicators include the frequency of distributed denial-of-service attacks and abnormal traffic scores; Based on the risk assessment calculation results, combined with the preset generation formula and constraints, the segmentation generation parameters are dynamically determined; Based on the dynamically determined fragmentation generation parameters, the digital envelope is fragmented using the Shamir secret sharing algorithm, a quantum random number generator, and a salt value to obtain fragmented data.
[0049] In the embodiments of this application, such as Figure 4 As shown, the risk intensity can be quantitatively assessed by dynamically sensing the current network attack intensity of the transmission network. Specifically, the assessment data can be obtained by detecting the frequency of distributed denial-of-service attacks and abnormal traffic scores.
[0050] The frequency of distributed denial-of-service attacks can be determined by calculating the number of attack packets / the total number of packets, while the abnormal traffic score can be determined by calculating the ratio of abnormal connections / the total number of connections, and then combining the confidence level of the evaluation using an AI model.
[0051] Furthermore, the frequency of distributed denial-of-service attacks and abnormal traffic scores can be used as the data basis, and the risk level R can be calculated using an S-curve function as the result of the risk assessment.
[0052] Furthermore, the fragmentation generation parameters can be quickly and dynamically determined using the following generation formula (1) and preset constraints: (1) Where k is the fragment recovery threshold; n is the total number of fragments generated; and R is the risk assessment calculation result.
[0053] In practical applications, constraints such as k / n≥0.6 and n≤2k-1 can be set to adaptively constrain the fragment recovery threshold and the total number of fragments generated, thereby balancing ensuring the minimum safe redundancy ratio and limiting the total number of fragments generated to avoid excessive redundancy.
[0054] Furthermore, based on the determined fragmentation generation parameters, the Shamir secret sharing algorithm is used, and quantum random numbers and salt values are introduced into the fragmentation generation process to defend against quantum computing and pre-computation attacks. The salt value can be bound to a timestamp to ensure the timeliness of fragmentation, thereby processing the digital envelope into fragmented data.
[0055] Furthermore, when generating fragments using the Shamir secret sharing algorithm, the secrets that need to be protected can be set in the 0th term, and the coefficients of the remaining k-1th term can be randomly obtained using quantum random numbers. This enhances randomness and reduces the possibility that attackers can infer the polynomial structure by predicting random coefficients.
[0056] In practical applications, during the fragment generation process, the key derivation function can be used... Through multiple iterations, the anti-brute-force attack capability of the sharded data is enhanced. Ultimately, by using timestamps, random values, and salt values, random sharded content is generated, making it more difficult for attackers to establish a fixed mapping through historical shards. Thus, by driving the (k,n) parameter adaptive adjustment through a risk assessment model that analyzes DDoS frequency and abnormal traffic characteristics in real time, the shard redundancy dynamically increases with the attack intensity, establishing a resilient security barrier.
[0057] Therefore, compared to traditional secret sharing algorithms that pre-set fixed fragment recovery thresholds and the total number of fragments generated, this application can dynamically adjust relevant fragment generation parameters in real time according to the changes in the risk of the current transmission network. When there are few or no attacks, a smaller number of fragments can be set to reduce network overhead and improve recovery fault tolerance. However, when the attack intensity increases and the risk assessment result is high, the number of fragments and the recovery threshold can be increased, and distributed redundancy can be used to reduce the impact of failure of a single path, a single node, or a single network area on the overall data recovery.
[0058] Step 300: Quantitatively evaluate the reliability weight of each node in the transmission network, and then generate a transmission path based on the reliability weight of each node and cross-autonomous region constraints, so as to transmit the fragmented data to the target node according to the transmission path.
[0059] In the embodiments of this application, such as Figure 3 As shown, in the intelligent routing control phase, the reliability weights of each node in the transmission network are quantitatively evaluated as the basis for judgment data to optimize transmission paths. By using pre-set cross-autonomous region constraints, fragmented cross-autonomous region transmission is forced, ultimately generating a transmission path, and the fragmented data is transmitted to the target node according to the transmission path. Specifically, as an optional implementation, the quantitative evaluation of the reliability weights of each node in the transmission network, and then, based on the reliability weights of each node and combined with cross-autonomous region constraints, generating a transmission path to transmit the fragmented data to the target node according to the transmission path, includes: The system obtains the node online rate, bandwidth utilization rate, and risk score of each node in the transmission network, and then uses weighted fusion calculation to quantitatively evaluate the reliability weight of each node in the transmission network. Based on the reliability weights of each node, and combined with the objective function of minimizing transmission risk and delay and cross-autonomous region constraints, a transmission path is generated. The fragmented data is transmitted to the target node according to the transmission path.
[0060] In the embodiments of this application, such as Figure 4 As shown, the reliability weight of each node can be calculated by obtaining the node online rate, bandwidth utilization rate and risk score of each node in the transmission network, and then performing weighted fusion calculation through pre-set weights.
[0061] Among them, the node online rate can be calculated based on the ratio of online time to the maximum online time of all nodes, the bandwidth utilization rate can be calculated based on the throughput per unit gigabit through the saturation processing of the hyperbolic tangent function, and the risk score can be calculated based on the number of risk events and the total number of transmissions. The weights of 0.4, 0.3 and -0.3 can be set for the node online rate, bandwidth utilization rate and risk score respectively, so as to calculate the reliability weight of each node.
[0062] Furthermore, based on the reliability weights of each node, a target function that minimizes transmission risk and transmission delay is constructed. A low-risk, high-bandwidth transmission path is selected through an optimization algorithm. Combined with preset cross-autonomous region constraints, fragments are forced to pass through different autonomous regions to prevent attackers from associating fragments. Finally, the transmission path used to transmit fragmented data is determined.
[0063] In practical applications, the total delay constraint can be further combined to avoid selecting too many transmission nodes in the transmission path, which would result in low transmission efficiency.
[0064] Furthermore, the fragmented data is transmitted to the target node according to the determined transmission path. For example, the determined transmission path is as follows: fragments S1 and S2 are transmitted via the 5G private network through the AS4134 autonomous system, fragments S3 and S4 are transmitted via the Internet of Things through the AS4809 autonomous system, fragments S5 and S6 are transmitted via satellite link, and fragments S7 and S8 can be transmitted via backup optical fiber. Different priorities can be set for different transmission links.
[0065] Therefore, this application selects the transmission path based on the trust evaluation matrix of node online rate, bandwidth saturation function and risk factors, forces fragmented cross-autonomous region transmission and optimizes the risk delay balance objective function, thereby dismantling the attack surface from the transmission level.
[0066] Step 400: After the target node receives the fragmented data, it verifies the authenticity of the fragmented data through zero-knowledge proof, and performs double verification by combining interpolation recovery and quantum random numbers. Then, if the double verification passes, the original data is recovered from the fragmented data, and the dynamic fragmented data transmission is completed.
[0067] In the embodiments of this application, such as Figure 3 As shown, after the target node at the receiving end receives the fragmented data, it can first prove that the fragment holder knows the shared secret through zero-knowledge proof (non-interactive ZKP protocol) without disclosing the shared secret itself. This can improve the anti-forgery capability and ensure the authenticity of the fragments based on the discrete logarithm problem.
[0068] For example, if an attacker forges a shard and sends it to the target node, but cannot provide a correct proof response using zero-knowledge proof, the target node at the receiving end can determine that the forged shard is an illegal shard and discard it.
[0069] Furthermore, after the authenticity of the fragmented data is verified, the secret shared information can be recovered by interpolation to determine whether the transmitted data has been tampered with, and the signature can be verified by quantum random numbers. The double verification can determine whether the current communication peer actually has legitimate key materials, thus verifying the data in two different dimensions: the authenticity of the fragments and the legitimacy of the communication end.
[0070] Furthermore, if all verifications pass, the original data is recovered from the fragmented data, completing the dynamic fragmented data transmission. If any verification fails, it indicates that the current data transmission may be under attack, and the fragmented data received in this transmission can be used.
[0071] Therefore, this application constructs a protection chain at four levels: encryption algorithm, dynamic generation of fragmentation parameters, cross-domain transmission mechanism, and verification protocol, comprehensively covering the data encryption, fragmentation, transmission, and reassembly stages, and is effectively applicable to the current quantum-level data transmission requirements.
[0072] Furthermore, by integrating quantum-resistant encryption algorithms with dynamically generated fragmentation parameters, this application can effectively improve the quantum-resistant strength of fragmented data. By dynamically adjusting the generation parameters, it can achieve elastic adaptation to attack strength and perform multiple authenticity verifications and data integrity checks during data reassembly, thereby improving data security and reducing data overhead, effectively meeting the data transmission security requirements.
[0073] Specifically, as an optional implementation, after the target node receives the fragmented data, it verifies the authenticity of the fragmented data through zero-knowledge proof, and performs dual verification using interpolation recovery and quantum random numbers. Then, if the dual verification passes, the original data is recovered from the fragmented data, completing the dynamic fragmented data transmission. This includes: After the target node receives the fragmented data, it verifies the authenticity of the fragmented data using zero-knowledge proof. After the zero-knowledge proof verification is passed, the fragmented data is recovered by Lagrange interpolation and the recovered secret information is verified by combining the master key, and the response verification is performed by generating quantum random numbers; If the interpolation recovery and quantum random number verification pass, the original data is recovered from the fragmented data, thus completing the dynamic fragmented data transmission.
[0074] In the embodiments of this application, such as Figure 4 As shown, after the target node receives the fragmented data, it verifies the authenticity of the fragmented data through zero-knowledge proof. After successful verification, it recovers the target shared secret for data transmission by performing Lagrange interpolation on the fragmented data. Then, it verifies the target shared secret against the master key binding value to determine whether the target shared secret is consistent with the master key binding value. The target node randomly generates a quantum random number and sends it to the sender. The sender generates a signature based on the NTRU private key and returns it to the receiver for verification. Finally, the sender's identity and key holding are verified through dual-factor authentication.
[0075] Finally, after the interpolation recovery and quantum random number verification passes, the original data is recovered from the fragmented data and output, thus completing the dynamic fragmented data transmission.
[0076] For example, taking the secure transmission of medical images as an example, if multiple DICOM files need to be transmitted, all the original data can first be encrypted using the NTRU-743 encryption algorithm, and then the data can be encapsulated by combining the hash value and timestamp to generate a digital envelope.
[0077] Furthermore, network quality indicators are monitored in real time according to the preset update cycle, and risk assessments are conducted. The risk level is calculated, and the fragment recovery threshold and the total number of fragments generated are determined by combining the preset generation formula and constraints.
[0078] Furthermore, a polynomial is constructed for the digital envelope based on the fragment generation parameters, and quantum random numbers are introduced as random coefficients of the polynomial. When generating each fragment, the salt value calculation result is introduced, and the forged fragments are defended by binding the device hardware identifier, and finally fragment data is generated.
[0079] Furthermore, the fragmented transmission path is determined based on the reliability weights of the nodes in the transmission network, and data transmission is performed. After the target node receives the fragmented data, zero-knowledge proof and double-factor verification are performed to complete the data transmission process.
[0080] Therefore, this application constructs a quantum immune foundation through NTRU lattice-based encryption, injects quantum random number salt values by combining an improved Shamir sharding algorithm, and enables data shards to have quantum-resistant cracking strength. It also innovates a dynamic threshold control system to perceive DDoS attack intensity and abnormal traffic in real time, driving intelligent switching of sharding generation parameters and improving security redundancy elasticity. Furthermore, it can optimize transmission paths in 5G / satellite hybrid networks based on node trust scoring and multi-path routing algorithms with cross-autonomous region constraints, reducing end-to-end latency while ensuring that the attack surface of shard distribution is minimized. At the receiving end, it completes shard authenticity verification and data integrity verification in milliseconds through innovative zero-knowledge proof and two-factor recombination verification protocols, ensuring that the original data can be recovered without loss even in extreme network environments, improving data transmission security and meeting the usage requirements of dynamic sharded data transmission.
[0081] Please see Figure 5 , Figure 5 This is a schematic diagram of a dynamic fragmented data transmission device provided in an embodiment of this application. This application also provides a dynamic fragmented data transmission device that can implement the above-described dynamic fragmented data transmission method. The device includes: The data encryption module 510 is used to acquire the original data to be transmitted, encrypt the original data using a quantum-resistant encryption algorithm, and perform hash encapsulation to obtain a digital envelope; The fragmentation generation module 520 is used to monitor and acquire transmission network quality indicators in real time and perform risk assessment. Based on the risk assessment calculation results, it dynamically determines fragmentation generation parameters to perform fragmentation generation processing on the digital envelope according to the fragmentation generation parameters to obtain fragmented data. The fragmentation generation parameters include a fragmentation recovery threshold and a total number of fragments generated. The routing transmission module 530 is used to quantitatively evaluate the reliability weight of each node in the transmission network, and then generate a transmission path based on the reliability weight of each node and cross-autonomous region constraints, so as to transmit the fragmented data to the target node according to the transmission path. The verification and decryption module 540 is used to verify the authenticity of the fragmented data by using zero-knowledge proof after the target node receives the fragmented data, and to perform double verification by combining interpolation recovery and quantum random numbers. Then, if the double verification passes, the original data can be recovered from the fragmented data to complete the dynamic fragmented data transmission.
[0082] It is understood that the content of the above method embodiments is applicable to the present device embodiments. The specific functions implemented by the present device embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.
[0083] Please see Figure 6 , Figure 6 This is a schematic diagram of the hardware structure of an electronic device provided in an embodiment of this application. The electronic device includes: The processor 601 can be implemented using a general-purpose CPU (Central Processing Unit), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this application. The memory 602 can be implemented as a read-only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM). The memory 602 can store the operating system and other applications. When the technical solutions provided in the embodiments of this specification are implemented through software or firmware, the relevant program code is stored in the memory 602 and is called and executed by the processor 601 using the methods described in the embodiments of this application. The input / output interface 603 is used to implement information input and output; The communication interface 604 is used to enable communication and interaction between this device and other devices. Communication can be achieved through wired means (such as USB, network cable, etc.) or wireless means (such as mobile network, WIFI, Bluetooth, etc.). Bus 605 transmits information between various components of the device (e.g., processor 601, memory 602, input / output interface 603, and communication interface 604); The processor 601, memory 602, input / output interface 603, and communication interface 604 are connected to each other within the device via bus 605.
[0084] This application also provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the above-described method.
[0085] It is understood that the content of the above method embodiments is applicable to this storage medium embodiment. The specific functions implemented in this storage medium embodiment are the same as those in the above method embodiments, and the beneficial effects achieved are also the same as those achieved in the above method embodiments.
[0086] This application also provides a computer program product, including a computer program that, when executed by a processor, implements the above-described method.
[0087] It is understood that the content of the above method embodiments is applicable to the embodiments of this program product. The specific functions implemented by the embodiments of this program product are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.
[0088] Memory, as a non-transitory computer-readable storage medium, can be used to store non-transitory software programs and non-transitory computer-executable programs. Furthermore, memory may include high-speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid-state storage device. In some embodiments, memory may optionally include memory remotely located relative to the processor, and these remote memories can be connected to the processor via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.
[0089] This application provides a dynamic fragmented data transmission method and related equipment, which effectively improves the quantum-resistant strength of fragmented data by integrating anti-quantum encryption algorithms with dynamically generated fragmentation parameters. It also achieves elastic adaptation to attack strength by dynamically adjusting the generation parameters and performs multiple authenticity verifications and data integrity checks when reassembling data, thereby improving data security and reducing data overhead, and effectively meeting the data transmission security requirements.
[0090] The embodiments described in this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided by the embodiments of this application. As those skilled in the art will know, with the evolution of technology and the emergence of new application scenarios, the technical solutions provided by the embodiments of this application are also applicable to similar technical problems.
[0091] Those skilled in the art will understand that the technical solutions shown in the figures do not constitute a limitation on the embodiments of this application, and may include more or fewer steps than shown, or combine certain steps, or different steps.
[0092] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs.
[0093] Those skilled in the art will understand that all or some of the steps in the methods disclosed above, as well as the functional modules / units in the systems and devices, can be implemented as software, firmware, hardware, or suitable combinations thereof.
[0094] The terms “first,” “second,” “third,” “fourth,” etc. (if present) in the specification and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of this application described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms “comprising” and “having,” and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.
[0095] It should be understood that in this application, "at least one (item)" means one or more, and "more than" means two or more. "And / or" is used to describe the relationship between related objects, indicating that three relationships can exist. For example, "A and / or B" can represent three cases: only A exists, only B exists, and both A and B exist simultaneously, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one (item) of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one (item) of a, b, or c can represent: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be single or multiple.
[0096] In the several embodiments provided in this application, it should be understood that the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of the units described above is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.
[0097] The units described above as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.
[0098] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.
[0099] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes multiple instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of the various embodiments of this application. The aforementioned storage medium includes various media capable of storing programs, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.
[0100] The preferred embodiments of the present application have been described above with reference to the accompanying drawings, but this does not limit the scope of the claims of the present application. Any modifications, equivalent substitutions, and improvements made by those skilled in the art without departing from the scope and substance of the embodiments of the present application shall be within the scope of the claims of the present application.
Claims
1. A dynamic fragmented data transmission method, characterized in that, The method includes the following steps: The original data to be transmitted is obtained, encrypted using a quantum-resistant encryption algorithm, and then hashed to obtain a digital envelope. Real-time monitoring and acquisition of transmission network quality indicators and risk assessment are performed. Based on the risk assessment calculation results, fragmentation generation parameters are dynamically determined. The digital envelope is then fragmented according to the fragmentation generation parameters to obtain fragmented data. The fragmentation generation parameters include a fragmentation recovery threshold and a total number of fragments generated. The reliability weight of each node in the transmission network is quantitatively evaluated, and then a transmission path is generated based on the reliability weight of each node and cross-autonomous region constraints, so as to transmit the fragmented data to the target node according to the transmission path. After the target node receives the fragmented data, it verifies the authenticity of the fragmented data through zero-knowledge proof, and performs double verification by combining interpolation recovery and quantum random numbers. Then, if the double verification passes, the original data is recovered from the fragmented data, thus completing the dynamic fragmented data transmission.
2. The method according to claim 1, characterized in that, The process of acquiring the original data to be transmitted, encrypting the original data using a quantum-resistant encryption algorithm, and hashing and encapsulating the original data to obtain a digital envelope includes: The original data to be transmitted is obtained, and combined with the NTRU public key, the original data is encrypted using the NTRU quantum-resistant encryption algorithm to obtain the encrypted original data. Based on the encrypted original data, a hash calculation is performed using a hash algorithm to obtain the hash value; The encrypted original data, hash calculation value, and timestamp are bound and encapsulated to obtain a digital envelope.
3. The method according to claim 2, characterized in that, The method further includes: Generate an NTRU private key that satisfies the reversibility requirement; NTRU public key is calculated and generated based on the NTRU private key, and then the public key is exchanged with the target node; Based on the public key exchange result, the master key is derived through computation.
4. The method according to claim 1, characterized in that, The real-time monitoring acquires transmission network quality indicators and performs risk assessment. Based on the risk assessment calculation results, fragmentation generation parameters are dynamically determined. The digital envelope is then fragmented according to these parameters to obtain fragmented data, including: Real-time monitoring acquires transmission network quality indicators, and risk assessment is performed using an S-curve function to obtain risk assessment results; wherein, the transmission network quality indicators include the frequency of distributed denial-of-service attacks and abnormal traffic scores; Based on the risk assessment calculation results, combined with the preset generation formula and constraints, the segmentation generation parameters are dynamically determined; Based on the dynamically determined fragmentation generation parameters, the digital envelope is fragmented using the Shamir secret sharing algorithm, a quantum random number generator, and a salt value to obtain fragmented data.
5. The method according to claim 1, characterized in that, The quantitative evaluation assesses the reliability weights of each node in the transmission network, and then, based on these reliability weights and cross-autonomous region constraints, generates a transmission path to transmit the fragmented data to the target node according to the transmission path, including: The system obtains the node online rate, bandwidth utilization rate, and risk score of each node in the transmission network, and then uses weighted fusion calculation to quantitatively evaluate the reliability weight of each node in the transmission network. Based on the reliability weights of each node, and combined with the objective function of minimizing transmission risk and delay and cross-autonomous region constraints, a transmission path is generated. The fragmented data is transmitted to the target node according to the transmission path.
6. The method according to claim 1, characterized in that, After the target node receives the fragmented data, it verifies the authenticity of the fragmented data using zero-knowledge proof, and performs dual verification using interpolation recovery and quantum random numbers. If the dual verification passes, the original data is recovered from the fragmented data, completing the dynamic fragmented data transmission. This includes: After the target node receives the fragmented data, it verifies the authenticity of the fragmented data using zero-knowledge proof. After the zero-knowledge proof verification is passed, the fragmented data is recovered by Lagrange interpolation and the recovered secret information is verified by combining the master key, and the response verification is performed by generating quantum random numbers; If the interpolation recovery and quantum random number verification pass, the original data is recovered from the fragmented data, thus completing the dynamic fragmented data transmission.
7. A dynamic fragmented data transmission device, characterized in that, The device includes: The data encryption module is used to acquire the original data to be transmitted, encrypt the original data using a quantum-resistant encryption algorithm, and then perform hash encapsulation to obtain a digital envelope. The fragmentation generation module is used to monitor and acquire transmission network quality indicators in real time and perform risk assessment. Based on the risk assessment calculation results, it dynamically determines fragmentation generation parameters to perform fragmentation generation processing on the digital envelope according to the fragmentation generation parameters to obtain fragmented data. The fragmentation generation parameters include a fragmentation recovery threshold and a total number of fragments generated. The routing and transmission module is used to quantitatively evaluate the reliability weight of each node in the transmission network, and then generate a transmission path based on the reliability weight of each node and cross-autonomous region constraints, so as to transmit the fragmented data to the target node according to the transmission path. The verification and decryption module is used to verify the authenticity of the fragmented data by using zero-knowledge proof after the target node receives the fragmented data, and to perform double verification by combining interpolation recovery and quantum random numbers. Then, if the double verification passes, the original data can be recovered from the fragmented data to complete the dynamic fragmented data transmission.
8. An electronic device, characterized in that, The electronic device includes a memory and a processor, the memory storing a computer program, and the processor executing the computer program to implement the method according to any one of claims 1 to 6.
9. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by a processor, it implements the method of any one of claims 1 to 6.
10. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the method of any one of claims 1 to 6.
