Quantum key distribution network multipoint cooperative key supply fault recovery method and related system

Abstract

The invention belongs to the field of quantum key distribution, and discloses a quantum key distribution network multipoint cooperative key supply fault recovery method and a related system.According to the quantum key distribution network multipoint cooperative key supply fault recovery method and system, through the design of a plurality of paths and a backup path, when one path breaks down or key supply is interrupted, a protection path can be rapidly switched to, and the fault recovery efficiency is improved. Therefore, interruption of secret key supply is avoided. The path redundancy design effectively enhances the fault-tolerant capability and stability of the system, and can maintain the continuous supply of keys especially in the face of high-concurrency key requests. According to the invention, the proper working path and protection path are selected from the plurality of paths, so that the key distribution efficiency can be improved. By preferentially selecting the path with sufficient key quantity in the key pool for key distribution, the phenomenon of key request queuing waiting or failure caused by insufficient path resources can be reduced, so that the key supply process is accelerated.

Description

Technical Field

[0001] The present invention belongs to the field of quantum key distribution, and in particular relates to a quantum key distribution network multi-point collaborative key supply fault recovery method and a related system. Background Art

[0002] Based on the Heisenberg unmeasurable and single-photon non-cloning theorems in quantum mechanics, quantum key distribution (QKD) has become one of the most secure key negotiation schemes in the current information technology context. Compared with traditional cryptography, quantum key distribution can capture any eavesdropping behavior during the key negotiation process, so it has the potential to provide a long-term security mechanism for future communication systems that can resist quantum computer cracking. With the continuous deepening of research on quantum key distribution, point-to-point key negotiation has gradually evolved to networked quantum key sharing and supply, and many problems in the quantum key distribution network (QKDN) need to be studied. In order to ensure the security and reliability of communications, ensuring a stable supply of quantum keys is the primary requirement of QKDN, so the survivability issue is one of its core research topics.

[0003] Current key supply research is often based on a single-node service model, that is, the user node is provided with keys by a single QKD node. On the one hand, the QKD node itself has a low rate, and a single QKD node is difficult to cope with services with high key requirements. As the business needs of the user layer continue to increase, in highly concurrent business scenarios, user nodes require a large number of key resources, resulting in high pressure on single QKD nodes and abnormal QKDN key supply, which requires network configuration recovery strategies to be repaired in a timely manner; on the other hand, the recovery of key supply when a failure occurs involves multiple factors, and the selection of strategies involves different degrees of overhead and delay. In summary, it is very important to propose a method to alleviate the pressure on QKD nodes during the key exchange process and minimize the key supply recovery time when a failure occurs. Summary of the invention

[0004] The purpose of the present invention is to overcome the problem that a single quantum key distribution (QKD) node is difficult to maintain the stability of key supply when dealing with high-concurrency key requests, which easily leads to key interruption and link failure, and to provide a quantum key distribution network multi-point collaborative key supply fault recovery method and related system.

[0005] In order to achieve the above object, the present invention adopts the following technical solution: In a first aspect, the present invention provides a method for recovering a quantum key distribution network multi-point collaborative key provisioning fault, comprising the following steps: According to the user's request, a quantum key distribution node is randomly assigned to the user, and m paths between users are determined; Among the m paths, if the minimum key amount of the key pool is greater than or equal to the key amount of the key request, two paths that meet the conditions are selected, one path is used as the working path, and the other path is used as the protection path; Establish a link based on the working path and the protection path and generate a shared key; When the key supply is interrupted, the key supply is switched from the working path to the protection path; After key synchronization, the shared key is passed to the quantum key distribution node of the requesting party; The user who initiates the request requests a key from the quantum key distribution node, and the quantum key distribution node provides the required key and the ID number corresponding to the key; The initiator sends the key and ID number to the receiver, and the receiver provides the key according to the user's request.

[0006] A further improvement of the present invention is that if the minimum key amount of the key pool is smaller than the key amount of the key request, the current path is discarded, other paths are reselected for comparison, and two paths that meet the conditions are selected.

[0007] A further improvement of the present invention is that, if two paths satisfying the conditions cannot be selected, two paths are selected as working paths and two paths are selected as protection paths.

[0008] A further improvement of the present invention is that the initiator of the request sends the key and the ID number to the receiver, and the receiver provides the key according to the user's request in the following specific method: The requesting party sends the key and ID number to the receiving party; The receiver sends the key and ID number to the receiver’s quantum key distribution node; The receiver's quantum key distribution node provides the key based on the user's request.

[0009] In a second aspect, the present invention provides a quantum key distribution network multi-point collaborative key supply fault recovery system, comprising: The path selection module is used to randomly assign a quantum key distribution node to the user according to the user's request, and determine m paths between the users; among the m paths, if the minimum key amount of the key pool is greater than or equal to the key amount of the key request, then select two paths that meet the conditions, one path as the working path, and the other path as the protection path; establish a link according to the working path and the protection path, and generate a shared key; The interruption recovery module is used to switch from the working path to the protection path for key supply when the key supply is interrupted; after the key is synchronized, the shared key is passed to the quantum key distribution node of the initiator of the request; the user of the initiator of the request requests the key from the quantum key distribution node, and the quantum key distribution node provides the required key and the ID number corresponding to the key; the initiator of the request sends the key and the ID number to the receiver, and the receiver provides the key according to the user's request.

[0010] A further improvement of the present invention is that the path selection module includes a path reselection module for discarding the current path when the minimum key amount in the key pool is less than the key amount in the key request, reselecting other paths for comparison, and selecting two paths that meet the conditions.

[0011] A further improvement of the present invention is that the path reselection module includes a path merging module for selecting two paths as working paths and two paths as protection paths when two paths meeting the conditions cannot be selected.

[0012] A further improvement of the present invention is that the interruption recovery module includes a key forwarding module, which is used for the initiator of the request to send the key and ID number to the receiver; the receiver sends the key and ID number to the receiver's quantum key distribution node; the receiver's quantum key distribution node provides the key according to the user's request.

[0013] In a third aspect, the present invention provides a quantum key distribution network multi-point collaborative key supply fault recovery system, comprising: A path determination module is used to randomly assign a quantum key distribution node to a user according to a user request and determine m paths between users; A path distinguishing module, for selecting two paths that meet the condition if the minimum key amount of the key pool is greater than or equal to the key amount of the key request among the m paths, one path being used as a working path and the other path being used as a protection path; A shared key generation module, used to establish a link according to the working path and the protection path and generate a shared key; A path switching module, used to switch from a working path to a protection path for key supply when key supply is interrupted; A shared key sending module is used to transmit the shared key to the quantum key distribution node of the requesting party after key synchronization; A key providing module, used for the quantum key distribution node to provide the required key and the ID number corresponding to the key when the user who initiates the request requests the key from the quantum key distribution node; The key sending module is used to enable the initiator of the request to send the key and ID number to the receiver, and the receiver provides the key according to the user's request.

[0014] In a fourth aspect, the present invention provides an electronic device comprising a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of a quantum key distribution network multi-point collaborative key supply fault recovery method when executing the computer program.

[0015] In a fifth aspect, the present invention provides a storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of a method for recovering from a multi-point collaborative key supply failure in a quantum key distribution network.

[0016] Compared with the prior art, the present invention has the following beneficial effects: The present invention can quickly switch to the protection path when a path fails or the key supply is interrupted through the design of multiple paths and backup paths, thereby avoiding the interruption of key supply. This path redundancy design effectively enhances the fault tolerance and stability of the system, especially when facing high concurrent key requests, it can maintain the continuous supply of keys. The present invention selects a suitable working path and protection path from multiple paths to improve the efficiency of key distribution. By giving priority to the path with sufficient key quantity in the key pool for key distribution, the queuing or failure of key requests caused by insufficient path resources can be reduced, thereby accelerating the key supply process. The present invention sets the working path and the protection path separately, and the system can immediately switch to the backup path when the main path fails to ensure that the key distribution is not affected. This design helps to enhance the reliability and robustness of the entire quantum key distribution network, especially in the face of network failures or large-scale concurrent requests. In the traditional single QKD node design of the present invention, the interruption of key supply often leads to the paralysis of the service of the entire network. However, the present method can effectively avoid the large-scale impact caused by single point failures by introducing measures such as multi-node collaborative work and path redundancy. This enables the system to share the key supply load among multiple nodes, reducing the impact of a single node failure on the entire system. In a high-concurrency environment, the number of key requests is large, and traditional QKD systems may fail to distribute keys due to resource competition or path congestion. However, this method can more efficiently handle a large number of concurrent requests by dynamically selecting available paths and performing load balancing based on requests, ensuring that each user can obtain the required keys in a timely manner. The design of the key synchronization process of the present invention allows the consistency and synchronization of keys to be maintained when the key supply is switched, ensuring that the keys between the request initiator and the recipient are consistent, thereby ensuring communication security. In summary, the present invention can effectively solve the stability and reliability problems of the QKD system in a high-concurrency environment through technical means such as multi-path collaboration, path redundancy, fault recovery mechanism and load balancing strategy, especially in the case of key supply and link failures, and has significant performance advantages. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] Figure 1 is a flow chart of the present invention; Figure 2 is a system diagram of the present invention; Figure 3 is a flow chart of Example 2; Figure 4 Diagram of a key provisioning failure recovery model for multi-point coordination; Figure 5 A diagram of a KDN multi-point collaborative key provisioning failure recovery scenario; Figure 6 is a system diagram of Example 7; DETAILED DESCRIPTION In order to further understand the content of the present invention, the present invention is described in detail below in conjunction with the accompanying drawings and specific embodiments. It should be understood that the embodiments are only for explaining the present invention and are not intended to limit it.

[0018] See also Figure 1 , a quantum key distribution network multi-point collaborative key supply fault recovery method, comprising the following steps: S1, based on the user’s request, randomly assigns a quantum key distribution node to the user and determines m paths between users.

[0019] S2: Among the m paths, if the minimum key amount of the key pool is greater than or equal to the key amount of the key request, two paths that meet the conditions are selected, one path is used as the working path, and the other path is used as the protection path.

[0020] S3: Establish a link based on the working path and the protection path and generate a shared key.

[0021] S4: When the key supply is interrupted, the key supply is switched from the working path to the protection path.

[0022] S5, after key synchronization, the shared key is passed to the quantum key distribution node of the requesting party.

[0023] S6: The user who initiates the request requests a key from the quantum key distribution node, and the quantum key distribution node provides the required key and the ID number corresponding to the key.

[0024] S7, the requesting party sends the key and ID number to the receiving party, and the receiving party provides the key according to the user's request.

[0025] See also Figure 2 , quantum key distribution network multi-point collaborative key supply fault recovery system, including: A path determination module is used to randomly assign a quantum key distribution node to a user according to a user request and determine m paths between users; A path distinguishing module, for selecting two paths that meet the condition if the minimum key amount of the key pool is greater than or equal to the key amount of the key request among the m paths, one path being used as a working path and the other path being used as a protection path; A shared key generation module, used to establish a link according to the working path and the protection path and generate a shared key; A path switching module, used to switch from a working path to a protection path for key supply when key supply is interrupted; A shared key sending module is used to transmit the shared key to the quantum key distribution node of the requesting party after key synchronization; A key providing module, used for the quantum key distribution node to provide the required key and the ID number corresponding to the key when the user who initiates the request requests the key from the quantum key distribution node; The key sending module is used to enable the initiator of the request to send the key and ID number to the receiver, and the receiver provides the key according to the user's request.

[0026] See also Figure 3 , quantum key distribution network multi-point collaborative key supply fault recovery system, including: The path selection module is used to randomly assign a quantum key distribution node to the user according to the user's request, and determine m paths between the users; among the m paths, if the minimum key amount of the key pool is greater than or equal to the key amount of the key request, then select two paths that meet the conditions, one path as the working path, and the other path as the protection path; establish a link according to the working path and the protection path, and generate a shared key; The interruption recovery module is used to switch from the working path to the protection path for key supply when the key supply is interrupted; after the key is synchronized, the shared key is passed to the quantum key distribution node of the initiator of the request; the user of the initiator of the request requests the key from the quantum key distribution node, and the quantum key distribution node provides the required key and the ID number corresponding to the key; the initiator of the request sends the key and the ID number to the receiver, and the receiver provides the key according to the user's request.

[0027] Embodiment 1: See also Figure 4 , assuming that server A1 and client A2 are connected via QKD link Q1-Q x Exchange keys, that is, Q1-Q x As a working path, Q1-Q y As a protection path. If KSA-APP link A1-Q x A failure occurs, or the link Q1-Q between the QKD nodes x If a fault occurs, QKDN can detect the abnormality and quickly switch to the protection path Q1-Q yRe-establish the key routing link and then instruct A1 to y The corresponding key can be obtained from the corresponding QKD node. This model can be used to further enhance business continuity. When any KSA-APP link or the link between the corresponding QKD nodes fails, the impact on key supply will be minimized.

[0028] Embodiment 2: See also Figure 3 , the key relay routing selection method is as follows: Step 1: Receive the request and QKDN controller assigns nodes When a user initiates a request, the QKDN controller selects a QKD node from the QKD nodes that can provide services according to the policy of the QKDN manager, and the user sends the key request information containing the target user ID number to the node. The QKD node receives the corresponding key request information containing the target user ID number and passes the received information to the QKDN controller.

[0029] Step 2: QKDN controller lists m paths The sender user ID has been associated with the sender user's QKD node in advance, so the QKDN controller will list all possible paths with the support of the QKDN manager.

[0030] Step 3: Determine whether the m paths meet the key request requirements When traversing each path, it is necessary to ensure that the number of remaining keys in the key pool on the link between each QKD node of each path is greater than the number of keys required for the protected key request. If the condition is met, jump directly to step five.

[0031] Step 4: Elimination of unsatisfactory paths and coordination of working paths If a path does not meet the conditions, it will be removed. Then it is necessary to determine whether there are less than two paths that meet the conditions: if there are more than or equal to two, you can jump to step five; if there are less than two, the QKDN controller needs to coordinate. If the key quantity of a path is insufficient, the multi-point coordination feature can be used to use two paths to complete the construction of the key pair. After coordination, jump to step six.

[0032] Step 5: Select the working path and protection path Select the path with the most sufficient key as the working path, and randomly select one of the remaining paths that meet the conditions as the protection path. Jump to step 7.

[0033] Step 6: Coordinate resources and select working and protection paths Select a combination path with sufficient key quantity as the working path, and randomly select a group from other combination paths as the protection path.

[0034] Step 7: Establish a link After selecting the route, establish the link and start building the key pair.

[0035] Embodiment 3: The key relay interruption recovery method is as follows: Step 1: Switch paths when an interrupt occurs When the key supply is interrupted, the QKDN controller quickly switches to the protection path to build the key pair and restore the key supply.

[0036] Step 2: Generate a shared key and synchronize it to each QKD node When the source QKD node and the destination QKD node generate the required number of keys and synchronize them, the source QKD node obtains the shared key.

[0037] Step 3: The QKD node sends the key and related information to the initiator user The user who initiates the request requests a key from the assigned QKD node. The QKD node will provide both the key ID number and the ID number of the key manager of the QKD node that the destination user has changed.

[0038] Step 4: The initiating user sends relevant information to the destination user The user initiating the request passes the key ID number and the ID number of the key manager to the destination user.

[0039] Step 5: The target user sends a key request to the QKD node The destination user learns the QKD node that stores the key through the ID number of the key manager, sends a key request to the QKD node and provides the key ID number.

[0040] Step 6: QKD node responds to key request The corresponding QKD node responds to the request with the corresponding key.

[0041] Embodiment 4: The core of this embodiment is to associate two or more QKD nodes with user nodes, reserve a protection path when selecting a path, and when a failure occurs, QKDN can coordinate and quickly switch to the protection path, thereby achieving the goal of quickly restoring key supply. The key supply scenario proposed by this method is specifically a scenario where a high-concurrency key request fails during the key exchange process and needs to be restored. For the above scenario, a six-node quantum key distribution network is selected to describe the embodiment.

[0042] like Figure 5As shown in the figure, it is a scenario diagram for fault recovery in the key exchange process of QKDN multi-point collaborative key supply in a highly concurrent business scenario. We assume that the fault is a link failure, user A is the user who initiates the request, Q1 and Q2 are QKD nodes associated with user A, Q3 and Q4 are relay QKD nodes, Qx and Qy are QKD nodes associated with user B, and kc (keyaccount) represents the number of remaining keys in the link key pool.

[0043] Embodiment 5: The key relay routing selection method is as follows: Step 1: Receive the request and QKDN controller assigns nodes The initiator user node A1 has highly concurrent business transmission and requires a large amount of keys. The A1 node sends a key request message to the QKD layer. The QKDN controller selects node Q2 from the QKD nodes that can provide services according to the strategy of the QKDN manager. The user sends the information containing the ID number of the destination user ("id=2" in the figure) to the assigned QKD node Q 2， Node Q2 in the QKD layer receives the request and sends the destination user ID number in the request to the QKDN controller.

[0044] Step 2: QKDN controller lists m paths The sender user ID has been previously associated with the sender user’s QKD node, so the QKDN controller will list all possible paths with the support of the QKDN manager: They are Q2-Q3-Q x ;Q2-Q3-Q y ;Q2-Q4-Q x ;Q2-Q4-Q y There are four paths in total.

[0045] Step 3: Determine whether the m paths meet the key request requirements Assume that the incoming request key quantity ukc=50; traverse Q2-Q3-Q x ;Q2-Q3-Q y ;Q2-Q4-Q x ;Q2-Q4-Q y There are four paths, ensuring that the number of keys in the key pool on the link between each QKD node of each path is greater than the number of keys required for the protected key request. x For example, the number of keys in the Q2-Q3 key pool is kc=60, Q3-Q x The number of keys in the key pool kc=50, which meets the condition; for example, the third path Q2-Q4-Q x , the number of keys in the Q2-Q4 key pool kc=40, Q4-Qx The number of keys in the key pool kc=80, but since the first link does not meet the conditions, this path cannot be used as a routing link; if all four paths meet the conditions, jump to step five.

[0046] Step 4: Elimination of unsatisfactory paths and coordination of working paths From step 3, we can see that the path that needs to be eliminated is Q2-Q4-Q x ;Q2-Q4-Q y , the remaining path is Q2-Q3-Q x ;Q2-Q3-Q y ; Because there are two paths left, no resource coordination is required. If resource coordination is required, for example, two paths are needed to complete the construction of the key pair, jump to step 6.

[0047] Step 5: Select the working path and protection path Because Q2-Q4-Q y The key quantity is more sufficient, so choose Q2-Q4-Q y As a working path, Q2-Q4-Q x As a protection path.

[0048] Step 6: Coordinate resources and select working and protection paths Select a combination path with sufficient key quantity as the working path, and randomly select a group from other combination paths as the protection path.

[0049] Step 7: Establish a link After selecting the route, establish link Q2-Q4-Q y Start building the key pair.

[0050] Embodiment 6: The key relay interruption recovery method is as follows: Step 1: Switch paths when an interrupt occurs When the key supply is interrupted, the QKDN controller quickly switches to the protection path Q2-Q4-Q x Build key pairs and restore key supply.

[0051] Step 2: Generate a shared key and synchronize it to each QKD node In the selected relay route Q2-Q4-Q x On the other hand, the source QKD node Q2 and the destination QKD node Q x After generating the required number of keys and synchronizing them, the source QKD node Q2 obtains the shared key.

[0052] Step 3: The QKD node sends the key and related information to the initiator user The user A1 who initiates the request requests a key from the assigned QKD node Q2. In addition to providing the key, QKD node Q2 also provides the key ID number and the ID number of the key manager of the QKD node changed by the destination user ("id=30" in the figure).

[0053] Step 4: The initiating user sends relevant information to the destination user User A1 who initiates the request passes the key ID number and the ID number of the key manager ("id=30" in the figure) to the destination user A2.

[0054] Step 5: The target user sends a key request to the QKD node The destination user node A2 learns that the QKD node storing the key is Q through the received key manager ID ("id=30" in the figure). x , and then send the QKD node Q x Send a key request and provide the key ID.

[0055] Step 6: QKD node responds to key request QKD Node Q x Receive the request from the destination user node A2 and respond to the request, and provide the key to the destination user node A2, thus completing the key exchange process between the initiator user node A1 and the destination user node A2.

[0056] Embodiment 7: See also Figure 6 As shown, the present invention also provides an electronic device 100 for a quantum key distribution network multi-point collaborative key supply fault recovery method; the electronic device 100 includes a memory 101, at least one processor 102, a computer program 103 stored in the memory 101 and executable on the at least one processor 102, and at least one communication bus 104.

[0057] The memory 101 can be used to store the computer program 103, and the processor 102 implements the steps of the quantum key distribution network multi-point collaborative key supply fault recovery method described in Example 1 by running or executing the computer program stored in the memory 101 and calling the data stored in the memory 101. The memory 101 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function (such as a sound playback function, an image playback function, etc.), etc.; the data storage area may store data (such as audio data) created according to the use of the electronic device 100, etc. In addition, the memory 101 may include a non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), at least one disk storage device, a flash memory device, or other non-volatile solid-state storage devices.

[0058] The at least one processor 102 may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The processor 102 may be a microprocessor or any conventional processor, etc. The processor 102 is the control center of the electronic device 100, and uses various interfaces and lines to connect various parts of the entire electronic device 100.

[0059] The memory 101 in the electronic device 100 stores a plurality of instructions to implement a quantum key distribution network multi-point collaborative key supply failure recovery method, and the processor 102 can execute the plurality of instructions to implement: According to the user's request, a quantum key distribution node is randomly assigned to the user, and m paths between users are determined; Among the m paths, if the minimum key amount of the key pool is greater than or equal to the key amount of the key request, two paths that meet the conditions are selected, one path is used as the working path, and the other path is used as the protection path; Establish a link based on the working path and the protection path and generate a shared key; When the key supply is interrupted, the key supply is switched from the working path to the protection path; After key synchronization, the shared key is passed to the quantum key distribution node of the requesting party; The user who initiates the request requests a key from the quantum key distribution node, and the quantum key distribution node provides the required key and the ID number corresponding to the key; The initiator sends the key and ID number to the receiver, and the receiver provides the key according to the user's request.

[0060] Embodiment 8: If the module / unit integrated in the electronic device 100 is implemented in the form of 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 present invention implements all or part of the process in the above-mentioned embodiment method, and can also be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium, and the computer program can implement the steps of the above-mentioned method embodiments when executed by the processor. Among them, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium may include: any entity or device that can carry the computer program code, recording medium, U disk, mobile hard disk, disk, optical disk, computer memory and read-only memory (ROM, Read-Only Memory).

[0061] It will be appreciated by those skilled in the art that embodiments of the present invention may be provided as methods, systems, or computer program products. Therefore, the present invention may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Furthermore, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0062] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1A device that provides the functions specified in a block or multiple blocks.

[0063] These computer program instructions may also be stored in a computer readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture including an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0064] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process in the computer or other programmable device. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0065] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the above embodiments, ordinary technicians in the relevant field should understand that the specific implementation methods of the present invention can still be modified or replaced by equivalents. Any modification or equivalent replacement that does not depart from the spirit and scope of the present invention should be covered within the scope of protection of the claims of the present invention.

Claims

1. A method for recovering from a multi-point collaborative key supply failure in a quantum key distribution network, characterized in that: The following steps are involved: According to the user's request, a quantum key distribution node is randomly assigned to the user, and m paths between users are determined; Among the m paths, if the minimum key amount of the key pool is greater than or equal to the key amount of the key request, two paths that meet the conditions are selected, one path is used as the working path, and the other path is used as the protection path; Establish a link based on the working path and the protection path and generate a shared key; When the key supply is interrupted, the key supply is switched from the working path to the protection path; After key synchronization, the shared key is passed to the quantum key distribution node of the requesting party; The user who initiates the request requests a key from the quantum key distribution node, and the quantum key distribution node provides the required key and the ID number corresponding to the key; The initiator sends the key and ID number to the receiver, and the receiver provides the key according to the user's request.

2. The quantum key distribution network multi-point collaborative key supply fault recovery method according to claim 1 is characterized in that: If the minimum key amount of the key pool is less than the key amount of the key request, the current path is discarded, and other paths are reselected for comparison, and two paths that meet the conditions are selected.

3. The quantum key distribution network multi-point collaborative key supply fault recovery method according to claim 2 is characterized in that: If two paths that meet the conditions cannot be selected, two paths are selected as working paths and two paths are selected as protection paths.

4. The quantum key distribution network multi-point collaborative key supply fault recovery method according to claim 1 is characterized in that: The initiator sends the key and ID number to the receiver. The receiver provides the key according to the user's request in the following way: The requesting party sends the key and ID number to the receiving party; The receiver sends the key and ID number to the receiver’s quantum key distribution node; The receiver's quantum key distribution node provides the key based on the user's request.

5. Quantum key distribution network multi-point collaborative key supply fault recovery system, characterized in that: include: A path selection module is used to randomly assign a quantum key distribution node to a user according to a user request and determine m paths between users; Among the m paths, if the minimum key amount in the key pool is greater than or equal to the key amount in the key request, two paths that meet the conditions are selected, one path is used as the working path, and the other path is used as the protection path; a link is established based on the working path and the protection path, and a shared key is generated; An interruption recovery module is used to switch from a working path to a protection path for key supply when key supply is interrupted; After key synchronization, the shared key is passed to the quantum key distribution node of the initiator of the request; the user of the initiator of the request requests the key from the quantum key distribution node, and the quantum key distribution node provides the required key and the ID number corresponding to the key; The initiator sends the key and ID number to the receiver, and the receiver provides the key according to the user's request.

6. The quantum key distribution network multi-point collaborative key supply fault recovery system according to claim 5 is characterized in that: The path selection module includes a path reselection module, which is used to abandon the current path when the minimum key amount in the key pool is less than the key amount in the key request, reselect other paths for comparison, and select two paths that meet the conditions.

7. The quantum key distribution network multi-point collaborative key supply fault recovery system according to claim 6 is characterized in that: The path reselection module includes a path merging module, which is used to select two paths as working paths and two paths as protection paths when two paths that meet the conditions cannot be selected.

8. The quantum key distribution network multi-point collaborative key supply fault recovery system according to claim 6 is characterized in that: The interruption recovery module includes a key forwarding module, which is used for the initiator to send the key and ID number to the receiver; the receiver sends the key and ID number to the receiver's quantum key distribution node; The receiver's quantum key distribution node provides the key based on the user's request.

9. Quantum key distribution network multi-point collaborative key supply fault recovery system, characterized in that: include: A path determination module is used to randomly assign a quantum key distribution node to a user according to a user request and determine m paths between users; A path distinguishing module, for selecting two paths that meet the condition if the minimum key amount of the key pool is greater than or equal to the key amount of the key request among the m paths, one path being used as a working path and the other path being used as a protection path; A shared key generation module, used to establish a link according to the working path and the protection path and generate a shared key; A path switching module, used to switch from a working path to a protection path for key supply when key supply is interrupted; A shared key sending module is used to transmit the shared key to the quantum key distribution node of the requesting party after key synchronization; A key providing module, used for the quantum key distribution node to provide the required key and the ID number corresponding to the key when the user who initiates the request requests the key from the quantum key distribution node; The key sending module is used to enable the initiator of the request to send the key and ID number to the receiver, and the receiver provides the key according to the user's request.

10. An electronic device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the quantum key distribution network multi-point collaborative key supply fault recovery method described in any one of claims 1 to 4 are implemented.

11. A storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the quantum key distribution network multi-point collaborative key supply fault recovery method described in any one of claims 1 to 4 are implemented.

Images