Quantum key distribution technical method for forward detection and reverse distribution
By adopting the forward detection and reverse distribution method in quantum key distribution technology, the key loss problem caused by insufficient key quantity and network link disconnection is solved, and the balanced use of key resources and the security and efficiency of communication are achieved.
Patent Information
- Application Number
- CN202510178186.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2024-10-12
- Filing Date
- 2025-02-18
- Publication Date
- 2025-06-10
AI Technical Summary
In the existing quantum key distribution technology, insufficient key quantity and disconnection of network links lead to loss of key components, which affects the effectiveness and reliability of the quantum key distribution technology.
The quantum key distribution technology method of forward detection reverse distribution is adopted. By reading and comparing the number of shared keys between each node, the minimum number of shared keys is determined for subsequent operations, ensuring that key synchronization and communication steps are performed only when there are sufficient available key resources.
By rationally utilizing limited key resources and avoiding unreasonable resource allocation or waste, the balanced and coordinated use of the number of keys in the entire network is achieved, ensuring the security and efficiency of communication.
Smart Images
Figure CN120128318A_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the technical field of quantum communication. More specifically, the present invention relates to a quantum key distribution technology method of forward detection and reverse distribution. Background Art
[0002] The background art of quantum key distribution is the result of the integration of multiple factors. On the one hand, with the rapid development of information technology, the demand for information security has increased sharply, and the security of traditional encryption technologies is facing challenges. There is an urgent need for a theoretically unconditionally secure key distribution method, and quantum key distribution has emerged as the times require. On the other hand, in-depth research on quantum mechanics has laid a theoretical foundation for it. For example, characteristics such as the superposition and entanglement of quantum states are used for key generation and distribution, and the progress of modern communication technologies provides a basis for high-speed and stable information transmission. Coupled with the continuous search for more reliable key distribution methods in cryptography research, it has jointly promoted the emergence and development of quantum key distribution technology.
[0003] In the existing quantum key distribution process, insufficient key amount is a common and critical problem. When the generated key quantity cannot meet the actual communication requirements, the security and efficiency of information transmission will be affected. In addition, the disconnection of the network link is also a factor that cannot be ignored. In a complex network environment, various reasons may cause the interruption of the network link, such as physical line failures, network device failures, and the impact of bad weather conditions on communication lines. Once the network link is disconnected, the key components being transmitted will be severely lost. Insufficient key amount or disconnection of the network link will both cause losses of key components, greatly affecting the effect and reliability of quantum key distribution technology in practical applications. Summary of the Invention
[0004] The present invention aims to solve at least the technical problems existing in the prior art; for this purpose, the present invention proposes a quantum key distribution technology method of forward detection and reverse distribution, which is used to solve the technical problem of reducing the loss of quantum keys caused by insufficient quantum key amount or network connection problems at any node in the distribution route.
[0005] To achieve the above object, the present invention provides a quantum key distribution technology method of forward detection and reverse distribution, including:
[0006] Step 1: After the first node receives a quantum key network distribution request, read the number S1 of shared keys between the first node and the second node, and send the number S1 of shared keys to the second node;
[0007] Step 2: After the second node receives the number of shared keys S1, it reads the number of shared keys S2 between the second node and the third node, and determines whether the number of shared keys S1 is greater than the number of shared keys S2. If yes, it sends the number of shared keys S2 to the third node; if no, it sends the number of shared keys S1 to the third node;
[0008] Step 3: The third node determines whether the value of the received number of shared keys is greater than 0. If yes, the third node reads the shared symmetric key K2 with the second node and sends a key synchronization lock request to the second node; if no, the process terminates and waits for the next complete process;
[0009] Step 4: After the second node receives the key synchronization lock request, it reads the shared symmetric key K2 with the third node and the shared symmetric key K1 with the first node, calculates the key component and transmits it to the third node, and sends a key synchronization lock request to the first node;
[0010] Step 5: After the first node receives the key synchronization lock request, it reads the shared symmetric key K1, calculates the key component through the end-to-end key K, and transmits the key component to the third node;
[0011] Step 6: After the third node receives the key components from the second node and the first node, it calculates the end-to-end key K and stores it, and sends a key sharing confirmation to the first node;
[0012] Step 7: After the first node receives the key sharing confirmation, it stores the end-to-end key in the key library.
[0013] It should be noted that in the process of quantum key distribution, a node refers to each endpoint or device participating in key distribution and exchange. For example: photon devices, qubits or other quantum communication devices. A node can be a sender, a receiver or a relay station, etc.; after the third node receives the minimum key amount on the route, it determines two basic information: ① all nodes are online, ② the minimum key amount.
[0014] By reading and comparing the number of shared keys between each node, the present invention can accurately understand the key resource situation between different nodes, and then rationally utilize the limited key resources to avoid problems such as unreasonable resource allocation or waste; taking the number of shared keys corresponding to the minimum value for subsequent operations helps to achieve the balance and coordinated use of the number of keys in the entire network; further operations are carried out when the minimum number of shared keys is greater than 0, ensuring that critical synchronization and communication steps are only carried out when there are sufficient available key resources.
[0015] Preferably, the distribution request is distributed by the management server and sent down through the quantum key network. The first node reads the number S1 of shared keys with the second node from its local key library.
[0016] Preferably, calculating the key component and transmitting it to the third node includes: after receiving the key synchronization lock request sent by the third node, the second node reads the shared symmetric key K2 with the third node and the shared symmetric key K1 with the first node from its local key library, calculates the key component K1⊕K2 using the XOR algorithm, transmits the key component to the third node, and then sends a key synchronization lock request to the first node.
[0017] It should be noted that the key synchronization lock request: to ensure that during the key distribution between the two communication parties, the process of key generation and exchange can be kept synchronized and accurate. When one party detects a deviation, out-of-synchronization or possible error in the key generation or exchange with the other party, a key synchronization lock request will be sent. The purpose of this request is to suspend the current key distribution process, perform error correction and adjustment to ensure that the finally generated shared key is accurate and consistent; the XOR calculation restoration is to split the key into several components with the same length as its own, and use the XOR calculation to restore the original key when importing.
[0018] In the present invention, through a series of key component calculations and transmissions, the key component is calculated using the XOR algorithm, which enhances the confidentiality during the key transmission and sharing process.
[0019] Preferably, the end-to-end key K is generated by a hardware quantum random number card, and the hardware quantum random number card generates the key using the principle of quantum randomness.
[0020] Preferably, calculating the key component through the end-to-end key K includes: after receiving the key synchronization lock request, the first node reads the shared symmetric key K1 with the second node from its local key library, calculates the key component K⊕K1 using the XOR algorithm, and transmits the key component to the third node.
[0021] Preferably, after receiving the key components from the second node and the first node, the third node calculates (K⊕K1)⊕(K1⊕K2)⊕K2 using the XOR algorithm, that is, the end-to-end key K, stores the end-to-end key K, and then sends a key sharing confirmation to the first node.
[0022] The present invention stores the end-to-end key K in the key library, which is convenient for quickly and securely calling the key when needed later, providing a reliable guarantee for operations such as communication and data encryption in the entire quantum key network.
[0023] Compared with the prior art, the beneficial effects of the present invention are:
[0024] (1) This application aims to provide a system that can perform quantum key distribution efficiently, securely, and flexibly across multiple nodes to protect the integrity of communication and data privacy. By introducing an adaptive key amount distribution strategy and a key synchronization locking mechanism, and cooperating with a quantum random number card to generate end-to-end keys, the security and efficiency of communication are maintained while sharing keys in a multi-node network.
[0025] (2) Prevent the loss of quantum keys caused by the offline of quantum key network distribution nodes through communication link detection.
[0026] (3) The real-time key amount in each node can be obtained through key amount detection, so as to perform the minimum quantum key network distribution and prevent the loss of quantum keys of other nodes. BRIEF DESCRIPTION OF THE DRAWINGS
[0027] In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the drawings required for the description of the embodiments or the prior art. Obviously, the drawings in the following description are only some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.
[0028] Figure 1 It is a flowchart of quantum key network distribution of the present invention;
[0029] Figure 2 It is a schematic diagram of quantum key network distribution of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS
[0030] The following will clearly and completely describe the technical solutions of the present invention in conjunction with the embodiments. Obviously, the described embodiments are only some embodiments of the present invention, rather than all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts belong to the scope of protection of the present invention.
[0031] Please refer to Figure 1 - Figure 2 , the embodiments of the present invention provide a quantum key distribution technical method of forward detection and reverse distribution, including:
[0032] Step 1: After the first node receives the distribution request distributed by the management server and sent through the quantum key network, read the number of shared keys S1 between the first node and the second node from its local key library, and send the number of shared keys S1 to the second node;
[0033] Step 2: After the second node receives the number of shared keys S1, it reads the number of shared keys S2 between the second node and the third node from its local key library, and determines whether the number of shared keys S1 is greater than the number of shared keys S2. If yes, it sends the number of shared keys S2 to the third node; if no, it sends the number of shared keys S1 to the third node.
[0034] Step 3: The third node determines whether the value of the received number of shared keys is greater than 0. If yes, the third node reads the shared symmetric key K2 with the second node and sends a key synchronization lock request to the second node; if no, it terminates the process and waits for the next complete process.
[0035] Step 4: After the second node receives the key synchronization lock request sent by the third node, it reads the shared symmetric key K2 with the third node and the shared symmetric key K1 with the first node from its local key library, calculates the key component K1⊕K2 using the XOR algorithm, and transmits the key component to the third node, and then sends a key synchronization lock request to the first node.
[0036] Step 5: After the first node receives the key synchronization lock request, it reads the shared symmetric key K1 with the second node from its local key library, calculates the key component K⊕K1 using the XOR algorithm through the end-to-end key K, and transmits the key component to the third node. Among them, the end-to-end key K is generated by a hardware quantum random number card, and the hardware quantum random number card generates the key using the principle of quantum randomness.
[0037] Step 6: After the third node receives the key components from the second node and the first node, it calculates (K⊕K1)⊕(K1⊕K2)⊕K2 using the XOR algorithm, that is, the end-to-end key K, stores the end-to-end key K, and then sends a key sharing confirmation to the first node.
[0038] Step 7: After the first node receives the key sharing confirmation, it stores the end-to-end key in the key library.
[0039] Reference Figure 2 , a private network for government and enterprises is built between the headquarters (the first node) of a large enterprise, the regional branch (the second node), and an important data processing center (the third node) within the enterprise.
[0040] When the headquarters needs to send some important files involving business secrets to the data processing center:
[0041] The headquarters, as the first node, receives the quantum key network distribution request, reads the number of shared keys S1 with the regional branch, for example, there are 50, and sends it to the regional branch.
[0042] The number of shared keys S2 between the regional branch and the data processing center is read, assumed to be 30. Determine the number of shared keys corresponding to the minimum value of 30 and send it to the data processing center.
[0043] The data processing center determines that 30 is greater than 0, reads the shared symmetric key K2 with the regional branch, and sends a key synchronization lock request to the regional branch.
[0044] After receiving the request, the regional branch reads the shared symmetric key K2 with the data processing center (e.g., "0011") and the shared symmetric key K1 with the headquarters (e.g., "1100") from local, calculates the key component K1⊕K2, i.e., "1100⊕0011 = 1111", and transmits the key component to the data processing center, then sends a key synchronization request to the headquarters.
[0045] After receiving the key synchronization request, the headquarters reads the shared symmetric key K1 with the regional branch from the key library, calculates the key component K⊕K1 from the end-to-end key K (assumed to be "1010") generated by the hardware quantum random number card, i.e., "1010⊕1100 = 0110", and transmits it to the data processing center.
[0046] After receiving the key component, the data processing center calculates (K⊕K1)⊕(K1⊕K2)⊕K2. Actual calculation: ("1010⊕1100")⊕("1100⊕0011")⊕0011 = "1010" to obtain the end-to-end key K and store it, then sends a key sharing confirmation to the headquarters.
[0047] After receiving the confirmation, the headquarters stores the end-to-end key K in the key library. In this way, the end-to-end key K can be used between the headquarters and the data processing center to encrypt the file transfer channel, ensuring the secure transmission of business secrets within the government-enterprise private network.
[0048] The working principle of the present invention: After the first node receives the distribution request, it reads the number of shared keys with the second node and sends it to the second node; the second node reads the number of shared keys with the third node, and after comparing with the key quantity of the first node, sends the number of keys corresponding to the minimum value to the third node. Then, the third node judges the minimum value. If it is greater than 0, it reads the symmetric key K1 with the second node and sends a key synchronization lock request to the second node. After receiving the request, the second node reads the symmetric key K1 with the third node and the symmetric key K2 with the first node, calculates the key component through the end-to-end key K generated by the hardware quantum random number card and transmits it to the third node, and also sends a key synchronization lock request to the first node. After receiving the key components from the second node and the first node, the third node calculates the end-to-end key K through the XOR algorithm and stores it, and sends a key sharing confirmation to the first node. Finally, after receiving the confirmation, the first node stores the end-to-end key K in the key library.
[0049] The above embodiments are only used to illustrate the technical method of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the preferred embodiments, those of ordinary skill in the art should understand that the technical method of the present invention can be modified or equivalently replaced without departing from the spirit and scope of the technical method of the present invention.
Claims
1. A quantum key distribution method for forward detection and reverse distribution, which is executed in a network channel by a first node, a second node and a third node, characterized in that: The distribution technology includes the following processes: Step 1: After receiving the quantum key network distribution request, the first node reads the number of shared keys S1 between the first node and the second node, and sends the number of shared keys S1 to the second node; Step 2: After receiving the shared key quantity S1, the second node reads the shared key quantity S2 between the second node and the third node, and determines whether the shared key quantity S1 is greater than the shared key quantity S2. If yes, the shared key quantity S2 is sent to the third node; if no, the shared key quantity S1 is sent to the third node; Step 3: The third node determines whether the value of the received shared key quantity is greater than 0. If yes, the third node reads the shared symmetric key K2 between the third node and the second node, and sends a key synchronization lock request to the second node; If not, terminate the process and wait for the next complete process; Step 4: After receiving the key synchronization lock request, the second node reads the shared symmetric key K2 with the third node and the shared symmetric key K1 with the first node, calculates the key component and transmits it to the third node, and sends a key synchronization lock request to the first node; Step 5: After receiving the key synchronization lock request, the first node reads the shared symmetric key K1, calculates the key component through the end-to-end key K, and transmits the key component to the third node; Step 6: After receiving the key components from the second node and the first node, the third node calculates the end-to-end key K and stores it, and sends a key sharing confirmation to the first node; Step 7: After receiving the key sharing confirmation, the first node stores the end-to-end key in the key library.
2. According to claim 1, a quantum key distribution technology method for forward detection and reverse distribution is characterized in that: The distribution request is distributed by the management server and sent down through the quantum key network. The first node reads the number S1 of shared keys between it and the second node from its local key library.
3. According to claim 1, a quantum key distribution method for forward detection and reverse distribution is characterized in that: The method of calculating the key component and transmitting it to the third node includes: after receiving the key synchronization locking request sent by the third node, the second node reads the shared symmetric key K2 with the third node and the shared symmetric key K1 with the first node from its local key library, calculates the key component K1⊕K2 using an XOR algorithm, transmits the key component to the third node, and then sends a key synchronization locking request to the first node.
4. According to claim 1, a quantum key distribution method for forward detection and reverse distribution is characterized in that: The end-to-end key K is generated by a hardware quantum random number card, and the hardware quantum random number card generates a key using the principle of quantum randomness.
5. The quantum key distribution method of forward detection and reverse distribution according to claim 1 is characterized in that: The method of calculating the key component through the end-to-end key K includes: after receiving the key synchronization lock request, the first node reads the shared symmetric key K1 with the second node from its local key library, calculates the key component K⊕K1 using an XOR algorithm, and transmits the key component to the third node.
6. The quantum key distribution technology method of forward detection and reverse distribution according to claim 1 is characterized in that: After receiving the key components from the second node and the first node, the third node uses an XOR algorithm to calculate (K⊕K1)⊕(K1⊕K2)⊕K2, that is, the end-to-end key K, stores the end-to-end key K, and then sends a key sharing confirmation to the first node.