Key dynamic XOR method of centralized quantum key relay network and relay node

By establishing a temporary key pool in a centralized quantum key relay network and selecting the XOR link according to link weight sorting, the problem of inefficient XOR keys between nodes is solved, and more efficient key management is achieved. Reduces bandwidth consumption.

CN119030708AActive Publication Date: 2024-11-26中电信量子信息科技集团有限公司

Patent Information

Application Number
CN202411099477.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-12
Publication Date
2024-11-26
Estimated Expiration
2044-08-12

AI Technical Summary

Technical Problem

In centralized quantum key relay network, nodes are less efficient when selecting different QKD links for key XOR, and existing methods fail to effectively solve the problems of different key generation and high bandwidth consumption for multiple links.

Method used

A dynamic key xOR method is proposed. By establishing a temporary key pool, sorting it according to the weights of the quantum link (key usage and generation efficiency), selecting the link with the highest weight and non-highest weight for key xOR. And optimize the XOR process when N>2 to reduce bandwidth consumption.

Benefits of technology

It improves the efficiency of key xOR, reduces key waste and computing management difficulty, and is suitable for use in multi-node and long-link quantum networks.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119030708A_ABST
    Figure CN119030708A_ABST
Patent Text Reader

Abstract

The invention discloses a key dynamic XOR method for a centralized quantum key relay network and a relay node, and the method comprises the steps: building temporary key pools corresponding to the number of quantum links, and enabling the temporary key pools to be used for storing keys generated in a current key uploading period of the corresponding quantum links; in Ngt; when 1, 2, every time a key uploading period is reached, the weights of the connected quantum links are added pairwise, weight adding results are obtained and sorted, and the weights of the quantum links are obtained by multiplying the key utilization rate of the quantum links by the node utilization rate of the quantum links by the key generation efficiency of the quantum links; keys are selected from the temporary key pools corresponding to the two quantum links with the highest weight addition results respectively for XOR; keys are selected from the temporary key pools corresponding to any two quantum links with the non-highest weight addition result for XOR; according to the invention, the problem of low quantum network node key XOR efficiency is solved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of quantum communication technology, and in particular to a key dynamic XOR method and a relay node of a centralized quantum key relay network. Background Art

[0002] Quantum cryptography technology is based on the quantum key distribution (QKD) protocol and has achieved rapid development in recent years. Unlike traditional cryptography, quantum cryptography is based on quantum mechanics and uses quantum physics properties such as Heisenberg's uncertainty principle and the no-cloning theorem to achieve secure long-distance negotiation of symmetric keys.

[0003] Multiple quantum key distribution nodes can form a quantum key distribution network (QKDN). Due to the limited distance between adjacent nodes, quantum key relay distribution is required in long-distance key generation scenarios. Quantum networks generally include QKD devices for quantum key distribution, KM devices (Key Management) for key management of QKD devices, and QKDN controllers for network control. In current quantum networks, QKDN control has multiple forms, namely: (1) Distributed control scheme, each node contains a complete QKD device, KM key management function and QKDN controller function, distributed routing control is used to achieve distributed networking, and key relay is implemented by KM; (2) Centralized control scheme, each node contains QKD devices and KM functions, there are one or more centralized QKDN controllers in the network, the routing control, resource scheduling and other functions of each node and link are uniformly controlled by the centrally deployed QKDN controller, and key relay is implemented by KM; (3) Multi-level node clustering Central control: network nodes, i.e., QKD nodes, are divided into user nodes, access nodes, and relay nodes according to their different roles. Network nodes that only receive quantum keys from one QKD are considered user nodes, access nodes are nodes adjacent to user nodes, and other network nodes are considered relay nodes. Access nodes are the same as relay nodes in the relay management and control process. Access nodes and relay nodes are controlled by a centralized QKDN controller, and key relay is implemented by KM. (4) Centralized control and key relay: controller functions and key relay functions are centralized in the QKDN controller, and there is no key encryption transmission between QKD nodes.

[0004] In the above-mentioned QKDN networking scheme, the distributed control scheme, the centralized control scheme and the multi-level node centralized control scheme all relay the key by the KM in each node in a chain transmission manner. The transmitted quantum key will pass through each relay node, which places high requirements on the management security of the relay node.

[0005] The centralized control and key relay scheme can reduce the connection management and authentication signaling overhead required for direct interaction between multiple relay nodes in QKDN when performing key relay, simplify the functions of QKD nodes, and improve the efficiency of key relay. It is suitable for use in networks with many nodes, large ranges, and long relay key links. However, there is currently no specific implementation method for this scheme. There are still many unresolved issues when implementing quantum networks with centralized schemes, such as how to perform the XOR of the keys of the previous and subsequent QKD links, how to solve the problem of different amounts of keys generated by different links in the node at the same time, and how the QKDN controller manages uploaded XOR keys.

[0006] At present, some methodologies have proposed that when a quantum network node reports an XOR key, all keys on different links can be XORed indiscriminately. However, this method greatly increases the upload bandwidth of each network node. The QKDN controller faces a large number of keys continuously uploaded by all nodes in the entire network, and the storage space consumption and computational management difficulty of the XOR key are increased. In addition, it has not considered the actual situation that a node may be connected to more than two other nodes, and the number of keys generated on each link is different.

[0007] In the related art, the patent application document with publication number CN114900293A proposes to establish a connection between all quantum key management nodes in the quantum network and the dispatching center. The dispatching center requests quantum key XOR information from the relay nodes respectively. The relay nodes calculate their key XOR information and report it. When the relay node has N adjacent nodes, that is, it is connected to N QKD links. For the relay node, when N=2, the relay node XORs the quantum keys of the two links to assemble a quantum key XOR response; when N>2, when the relay node has more than 2 adjacent nodes, that is, more than two QKD links, the relay node uses a certain link key as the reference key, and XORs it with other link keys respectively to obtain N-1 units of quantum key XOR information, which is called direct key XOR information. However, this scheme only proposes a centralized key relay scheduling method in a methodological way. The core lies in the entire key relay process, which includes reporting information from nodes, establishing topology at the center, uploading XOR values ​​at relay nodes, forming a global XOR key table in the entire network, forming keys between any two points in the network, and issuing keys. The scheme also refines and constrains various types of identification information in the relay process. The method of reducing network bandwidth is to use XOR characteristics. Nodes with more than 2 connection links can upload one less XOR value, which is calculated by the scheduling center itself, and pays more attention to the scheduling method of the scheduling center. Summary of the invention

[0008] The present invention aims to solve the problem of low efficiency in selecting different QKD link key XORs by network nodes in a centralized quantum key relay network.

[0009] The present invention solves the above technical problems by the following technical means:

[0010] On the one hand, a key dynamic XOR method of a centralized quantum key relay network is proposed, which is applied to a relay node, and the number of quantum links connected to the relay node is N. The method includes:

[0011] Establish a temporary key pool corresponding to the number of quantum links, where the temporary key pool is used to store the keys generated in the current key upload cycle of the corresponding quantum link;

[0012] When N>2, each time the key upload cycle is reached, the weights of the connected quantum links are added in pairs, the weight addition results are obtained and sorted, and the weight of the quantum link is the key usage rate of the quantum link / node usage rate × the key generation efficiency of the quantum link;

[0013] Select keys from the temporary key pools corresponding to the two quantum links with the highest weighted summation results and perform XOR on them;

[0014] Select keys from the temporary key pool corresponding to any two quantum links whose weight addition result is not the highest and perform XOR.

[0015] Furthermore, the node usage rate is the number of times the node key has been used within a set period of time, and the link key usage rate is the number of times a key generated on a certain quantum link has been used within a set period of time;

[0016] For any relay node that satisfies V Node =∑V Link , V Node is the node utilization rate, V Link is the link key usage rate.

[0017] Furthermore, the key generation efficiency is the ratio of the average key generation rate of each quantum link to a preset key generation reference rate.

[0018] Furthermore, the selecting of keys from the temporary key pools corresponding to the two quantum links with the highest weight addition results for XOR respectively includes:

[0019] The minimum capacity of the temporary key pool corresponding to the two quantum links with the highest weight addition result is taken as the maximum XOR amount in this cycle, and keys of the same time and length are selected from the two temporary key pools for XOR according to the maximum XOR amount in this cycle.

[0020] Furthermore, selecting keys from the temporary key pools corresponding to any two quantum links whose weight addition results are not the highest and performing XOR respectively includes:

[0021] Calculate the first key quantity, which is P×(W A +W B ) / W max , where P is the maximum XOR value in the current cycle, W A and W B are the weights of two arbitrarily selected quantum links, W max is the sum of the weights of the two links with the highest weights in the current period;

[0022] Determine whether the minimum capacity of the temporary key pool corresponding to any two selected quantum links is greater than the first key amount;

[0023] If yes, then select keys from the temporary key pool corresponding to two randomly selected quantum links according to the minimum capacity and perform XOR;

[0024] If not, keys are selected from the temporary key pools corresponding to two arbitrarily selected quantum links according to the first key quantity for exclusive OR.

[0025] Furthermore, when N=2, each time a key upload cycle is reached, keys are selected from the temporary key pools corresponding to the two quantum links according to the minimum capacity in the temporary key pools corresponding to the two quantum links for XOR.

[0026] Furthermore, after performing the key XOR, the method further includes:

[0027] The key XOR result, the IDs of the two quantum links and the key for the XOR operation are uploaded to the QKDN controller at their respective locations in the temporary key pool.

[0028] Furthermore, after performing the key XOR, the method further includes:

[0029] Keep the keys used in the XOR operation and discard all unused keys.

[0030] In a second aspect, a relay node is proposed, wherein the number of quantum links connected to the relay node is N, and the relay node includes:

[0031] A key pool establishment module is used to establish a temporary key pool corresponding to the number of quantum links, and the temporary key pool is used to store the keys generated in the current key upload cycle of the corresponding quantum link;

[0032] The weight calculation module is used to add the weights of the connected quantum links in pairs each time the key upload cycle is reached when N>2, obtain the weight addition results and sort them. The weight of the quantum link is the key usage rate of the quantum link / node usage rate × the key generation efficiency of the quantum link;

[0033] The key XOR module is used to select keys from the temporary key pools corresponding to the two quantum links with the highest weight addition results for XOR, and to select keys from the temporary key pools corresponding to any two quantum links with non-highest weight addition results for XOR.

[0034] In a third aspect, the present invention proposes a centralized quantum key relay network system, the system comprising a QKDN controller and a network node, the network node comprising a user node and a relay node, wherein:

[0035] The relay node XORs the quantum keys generated by different quantum links according to the method described above and uploads them to the QKDN controller;

[0036] The QKDN controller receives the key request sent by the network node, and sends an XOR key to the service target node based on the key request.

[0037] In a fourth aspect, the present invention also proposes a computer device, comprising a memory and a processor; wherein the processor runs a program corresponding to the executable program code by reading the executable program code stored in the memory, so as to implement the key dynamic XOR method of the centralized quantum key relay network as described above.

[0038] In a fifth aspect, the present invention also proposes a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, the key dynamic XOR method of the centralized quantum key relay network as described above is implemented.

[0039] The advantages of the present invention are:

[0040] (1) The proposed method for dynamic XOR of the key in the centralized quantum key relay network combines the utilization rate of the key link with the key generation rate, and uploads the key on the link that is used more frequently as much as possible to avoid the service without key availability. At the same time, considering the key generation rate, the key waste on the link with more key generation is avoided as much as possible, which can solve the problem of low efficiency of XOR of quantum network nodes and provide a guidance scheme for the XOR key selection of quantum nodes in the quantum network with centralized control and key relay architecture.

[0041] Additional aspects and advantages of the present invention will be given in part in the following description and in part will be obvious from the following description, or will be learned through practice of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0042] Figure 1 This is a schematic diagram of a centralized control and key relay quantum network architecture in one embodiment of the present invention;

[0043] Figure 2 It is a flow chart of a key dynamic XOR method of a centralized quantum key relay network proposed in one embodiment of the present invention;

[0044] Figure 3 is a schematic diagram of the structure of a relay node proposed in one embodiment of the present invention;

[0045] Figure 4 It is a structural schematic diagram of a computer device proposed in one embodiment of the present invention. DETAILED DESCRIPTION

[0046] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in combination with the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0047] In this embodiment, the centralized control and key relay quantum network architecture is as follows Figure 1 As shown in the figure, the network nodes in the network architecture are divided into user nodes and relay nodes according to the connection conditions (locations). The network nodes that only receive quantum keys from one QKD are regarded as user nodes, and other network nodes are regarded as relay nodes. Both relay nodes and network nodes can connect to the user business system and provide quantum key services to the outside world. Only relay nodes upload quantum keys generated by different links after XOR. The quantum network contains a QKDN controller that can receive the XOR keys uploaded by each node and send the XOR keys to the business target nodes.

[0048] The QKDN controller is also responsible for calculating the optimal path for key requests in the quantum network and selecting XOR values ​​along the way based on the optimal path. After each path is selected, the QKDN controller sends a notification to each node on the path that the key has been used.

[0049] The relay node periodically uploads the XOR key, and the period of uploading the XOR key is called the key upload period. When a quantum link is established between two nodes, the quantum link is named after the IDs of the two nodes.

[0050] When a relay node establishes a quantum link with other nodes and generates a quantum key, the relay node establishes several temporary key pools for the quantum link. The number of key pools is consistent with the number of quantum links established by the node. The keys generated in the current upload cycle on each link are stored separately, and the temporary key pool is named after the ID of the link peer node.

[0051] Specifically, Figure 2As shown, this embodiment proposes a key dynamic XOR method for a centralized quantum key relay network, which is applied to a relay node, and the number of quantum links connected to the relay node is N. The method includes the following steps:

[0052] S10, establishing a temporary key pool corresponding to the number of quantum links, wherein the temporary key pool is used to store the keys generated in the current key upload cycle of the corresponding quantum link;

[0053] S20, when N>2, each time the key upload cycle is reached, the weights of the connected quantum links are added up in pairs, the weight addition results are obtained and sorted, and the weight of the quantum link W=V Link / V Node ×R,V Link is the link key usage rate, V Node is the node utilization rate, R is the key generation efficiency;

[0054] S30, selecting keys from the temporary key pools corresponding to the two quantum links with the highest weight addition results and performing XOR;

[0055] S40: Select keys from the temporary key pools corresponding to any two quantum links whose weight addition results are not the highest, and perform XOR.

[0056] This embodiment combines the utilization rate of the key link with the key generation rate, and uploads the keys on the links that are used more frequently as much as possible to avoid the business without keys. At the same time, considering the key generation rate, try not to waste the keys on the links with more key generation, which can solve the problem of low efficiency of quantum network node key XOR, and provide a guidance scheme for the selection of XOR keys of quantum nodes in quantum networks with centralized control and key relay architecture.

[0057] As a further preferred technical solution, the node usage rate is the number of times the node key has been used within a set time, and the link key usage rate is the number of times a key generated on a certain quantum link has been used within a set time;

[0058] For any relay node that satisfies V Node =∑V Link , V Node is the node utilization rate, V Link is the link key usage rate;

[0059] The key generation efficiency is the ratio of the average key generation rate of each quantum link to the preset key generation reference rate.

[0060] Specifically, this embodiment records in the node the number of times the node key is used in the past certain period of time and the number of times the key generated on each link passing through the node is used, and the number of times the node key is used in a certain period of time is recorded as the node usage rate V Node , the number of times a key is generated on a link within a certain period of time is taken as the link usage rate V Link For any node, V Node =∑V Link ; Record the average key generation rate of each link passing through this node in the past certain period of time in the node, and take the ratio of the average key generation rate to the key generation rate benchmark preset by the system as the key generation efficiency R of the link.

[0061] It should be understood that the multiple time values ​​mentioned in this embodiment are empirical values ​​of custom settings, such as tens of minutes to several days, and this embodiment does not make specific limitations.

[0062] It should be noted that the key demand that may be generated in the future is estimated based on the nodes and links that have been frequently used in the past, and the keys generated on these nodes and links are preferentially XOR uploaded. The key generation rate on different links is evaluated, and the keys on the links with more key generation are also preferentially XOR uploaded to minimize key waste and avoid the situation where many keys are generated but not used. The link utilization rate / node utilization rate is calculated to identify the proportion of keys generated by a link connected to a node that are used in all the keys of the node. The entire formula is used to count the importance of a link connected to a node.

[0063] As a further preferred technical solution, the step S30: selecting keys from the temporary key pools corresponding to the two quantum links with the highest weight addition results and performing XOR, specifically includes:

[0064] The minimum capacity of the temporary key pool corresponding to the two quantum links with the highest weight addition result is taken as the maximum XOR amount in this cycle, and keys of the same time and length are selected from the two temporary key pools for XOR according to the maximum XOR amount in this cycle.

[0065] It should be noted that any two links need to upload XOR keys. Since the location of the long-distance key request is relatively random, this embodiment uploads keys from any two quantum links whose weight addition results are not the highest. Specifically, step S40: selecting keys from the temporary key pools corresponding to any two quantum links whose weight addition results are not the highest for XOR respectively includes the following steps:

[0066] S41, calculate the first key amount, the first key amount is P×(W A+W B ) / W max , where P is the maximum XOR value in the current cycle, W A and W B are the weights of two arbitrarily selected quantum links, W max is the sum of the weights of the two links with the highest weights in the current period;

[0067] S42, determining whether the minimum capacity of the temporary key pool corresponding to any two selected quantum links is greater than the first key amount, if so, executing step S43, if not, executing step S44;

[0068] S43, selecting keys from the temporary key pools corresponding to two arbitrarily selected quantum links according to the minimum capacity and performing XOR operations;

[0069] S44. According to the first key quantity, keys are respectively selected from temporary key pools corresponding to two arbitrarily selected quantum links for exclusive OR.

[0070] As a further preferred technical solution, when N=2, each time a key upload cycle is reached, keys are selected from the temporary key pools corresponding to the two quantum links according to the minimum capacity in the temporary key pools corresponding to the two quantum links for XOR.

[0071] As a further preferred technical solution, after performing the key XOR, the method further includes:

[0072] The key XOR result, the IDs of the two quantum links and the key for the XOR operation are uploaded to the QKDN controller at their respective locations in the temporary key pool.

[0073] As a further preferred technical solution, after performing the key XOR, the method further includes:

[0074] Keep the keys used in the XOR operation and discard all unused keys.

[0075] In addition, if Figure 3 As shown, another embodiment of the present invention further proposes a relay node, the number of quantum links connected to the relay node is N, and the relay node includes:

[0076] A key pool establishment module 10 is used to establish a temporary key pool corresponding to the number of quantum links, and the temporary key pool is used to store the keys generated in the current key upload cycle of the corresponding quantum link;

[0077] The weight calculation module 20 is used to add the weights of the connected quantum links in pairs each time the key upload cycle is reached when N>2, obtain the weight addition results and sort them, and the weight of the quantum link is the key usage rate of the quantum link / node usage rate×the key generation efficiency of the quantum link;

[0078] The key XOR module 30 is used to select keys from the temporary key pools corresponding to the two quantum links with the highest weight addition results for XOR, and to select keys from the temporary key pools corresponding to any two quantum links with non-highest weight addition results for XOR.

[0079] As a further preferred technical solution, the node usage rate is the number of times the node key has been used within a set time, and the link key usage rate is the number of times the key generated on a certain quantum link has been used within a set time; for any relay node that satisfies V Node =∑V Link , V Node is the node utilization rate, V Link is the link key usage rate;

[0080] The key generation efficiency is the ratio of the average key generation rate of each quantum link to the preset key generation reference rate.

[0081] As a further preferred technical solution, the key XOR module 30 is also used for: when N=2, each time the key upload cycle is reached, keys are selected from the temporary key pools corresponding to the two quantum links according to the minimum capacity in the temporary key pools corresponding to the two quantum links for XOR.

[0082] As a further preferred technical solution, the relay node also includes an XOR result uploading module, which is used to upload the key XOR result, the IDs of the two quantum links and the key for the XOR operation to the QKDN controller at their respective positions in the temporary key pool.

[0083] In addition, an embodiment of the present invention further proposes a centralized quantum key relay network system, the system comprising a QKDN controller and a network node, the network node comprising a user node and a relay node, wherein:

[0084] The relay node XORs the quantum keys generated by different quantum links according to the method described in the above embodiment and uploads them to the QKDN controller;

[0085] The QKDN controller receives the key request sent by the network node, and sends an XOR key to the service target node based on the key request.

[0086] In addition, the system described above can be implemented in the form of a computer program. Figure 4 Runs on the computer device shown. Figure 4 1 is a schematic block diagram of a computer device provided in an embodiment of the present application. The computer device may be a server.

[0087] The computer device includes a processor, a memory and a network interface connected via a system bus, wherein the memory may include a non-volatile storage medium and an internal memory.

[0088] The non-volatile storage medium can store an operating system and a computer program. The computer program includes program instructions, and when the program instructions are executed, the processor can execute any key dynamic XOR method of a centralized quantum key relay network.

[0089] The processor is used to provide computing and control capabilities and support the operation of the entire computer equipment.

[0090] The internal memory provides an environment for the operation of a computer program in a non-volatile storage medium. When the computer program is executed by a processor, the processor can execute any key dynamic XOR method of a centralized quantum key relay network.

[0091] The network interface is used for network communication, such as sending assigned tasks, etc. Those skilled in the art will understand that Figure 4 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0092] In addition, this embodiment also proposes a computer-readable storage medium, which stores a computer program, and the computer program includes program instructions. The processor executes the program instructions to implement the key dynamic XOR method of the centralized quantum key relay network provided in the above embodiment of the present application.

[0093] It should be noted that the logic and / or steps represented in the flowchart or otherwise described herein, for example, can be considered as a sequenced list of executable instructions for implementing logical functions, and can be specifically implemented in any computer-readable medium for use by an instruction execution system, device or apparatus (such as a computer-based system, a system including a processor, or other system that can fetch instructions from an instruction execution system, device or apparatus and execute instructions), or in combination with these instruction execution systems, devices or apparatuses. For the purposes of this specification, "computer-readable medium" can be any device that can contain, store, communicate, propagate or transmit a program for use by an instruction execution system, device or apparatus, or in combination with these instruction execution systems, devices or apparatuses. More specific examples of computer-readable media (a non-exhaustive list) include the following: an electrical connection portion with one or more wirings (electronic device), a portable computer disk box (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable and programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disk read-only memory (CDROM). In addition, the computer-readable medium may even be paper or other suitable medium on which the program is printed, since the program may be obtained electronically, for example, by optically scanning the paper or other medium and then editing, interpreting or processing in other suitable ways if necessary, and then stored in a computer memory.

[0094] It should be understood that the various parts of the present invention can be implemented by hardware, software, firmware or a combination thereof. In the above-mentioned embodiments, a plurality of steps or methods can be implemented by software or firmware stored in a memory and executed by a suitable instruction execution system. For example, if implemented by hardware, as in another embodiment, it can be implemented by any one of the following technologies known in the art or their combination: a discrete logic circuit having a logic gate circuit for implementing a logic function for a data signal, a dedicated integrated circuit having a suitable combination of logic gate circuits, a programmable gate array (PGA), a field programmable gate array (FPGA), etc.

[0095] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "examples", "specific examples", or "some examples" means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representation of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner.

[0096] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined as "first" and "second" may explicitly or implicitly include at least one of the features. In the description of the present invention, the meaning of "plurality" is at least two, such as two, three, etc., unless otherwise clearly and specifically defined.

[0097] Although the embodiments of the present invention have been shown and described above, it is to be understood that the above embodiments are exemplary and are not to be construed as limitations of the present invention. A person skilled in the art may change, modify, replace and vary the above embodiments within the scope of the present invention.

Claims

1. A key dynamic XOR method for a centralized quantum key relay network, characterized in that: Applied to a relay node, the number of quantum links connected to the relay node is N, and the method comprises: Establish a temporary key pool corresponding to the number of quantum links, where the temporary key pool is used to store the keys generated in the current key upload cycle of the corresponding quantum link; When N>2, each time the key upload cycle is reached, the weights of the connected quantum links are added in pairs, the weight addition results are obtained and sorted, and the weight of the quantum link is the key usage rate of the quantum link / node usage rate × the key generation efficiency of the quantum link; Select keys from the temporary key pools corresponding to the two quantum links with the highest weighted summation results and perform XOR on them; Select keys from the temporary key pool corresponding to any two quantum links whose weight addition result is not the highest and perform XOR.

2. The key dynamic XOR method of the centralized quantum key relay network as claimed in claim 1, characterized in that: The node usage rate is the number of times the node key has been used within a set period of time, and the link key usage rate is the number of times a key generated on a quantum link has been used within a set period of time; For any relay node that satisfies V Node =∑V Link , V Node is the node utilization rate, V Link is the link key usage rate.

3. The key dynamic XOR method of the centralized quantum key relay network as claimed in claim 1, characterized in that: The key generation efficiency is the ratio of the average key generation rate of each quantum link to the preset key generation reference rate.

4. The key dynamic XOR method of the centralized quantum key relay network as claimed in claim 1, characterized in that: The selecting keys from the temporary key pools corresponding to the two quantum links with the highest weight addition results and performing XOR respectively includes: The minimum capacity of the temporary key pool corresponding to the two quantum links with the highest weight addition result is taken as the maximum XOR amount in this cycle, and keys of the same time and length are selected from the two temporary key pools for XOR according to the maximum XOR amount in this cycle.

5. The key dynamic XOR method of the centralized quantum key relay network as claimed in claim 1, characterized in that: The selecting keys from the temporary key pools corresponding to any two quantum links whose weight addition results are not the highest and performing XOR respectively includes: Calculate the first key quantity, which is P×(W A +W B ) / W max , where P is the maximum XOR value in the current cycle, W A and W B are the weights of two arbitrarily selected quantum links, W max is the sum of the weights of the two links with the highest weights in the current period; Determine whether the minimum capacity of the temporary key pool corresponding to any two selected quantum links is greater than the first key amount; If yes, then select keys from the temporary key pool corresponding to two randomly selected quantum links according to the minimum capacity and perform XOR; If not, keys are selected from the temporary key pools corresponding to two arbitrarily selected quantum links according to the first key quantity for exclusive OR.

6. The key dynamic XOR method of the centralized quantum key relay network as claimed in claim 1, characterized in that: When N=2, each time a key upload cycle is reached, keys are selected from the temporary key pools corresponding to the two quantum links according to the minimum capacity in the temporary key pools corresponding to the two quantum links for XOR.

7. The key dynamic XOR method of a centralized quantum key relay network as claimed in claim 1 or 6, characterized in that: After performing the key XOR, the method further includes: The key XOR result, the IDs of the two quantum links and the key for the XOR operation are uploaded to the QKDN controller at their respective locations in the temporary key pool.

8. The key dynamic XOR method of the centralized quantum key relay network as claimed in claim 1, characterized in that: After performing the key XOR, the method further includes: Keep the keys used in the XOR operation and discard all unused keys.

9. A relay node, characterized in that: The number of quantum links connected to the relay node is N, and the relay node includes: A key pool establishment module is used to establish a temporary key pool corresponding to the number of quantum links, and the temporary key pool is used to store the keys generated in the current key upload cycle of the corresponding quantum link; The weight calculation module is used to add the weights of the connected quantum links in pairs each time the key upload cycle is reached when N>2, obtain the weight addition results and sort them. The weight of the quantum link is the key usage rate of the quantum link / node usage rate × the key generation efficiency of the quantum link; The key XOR module is used to select keys from the temporary key pools corresponding to the two quantum links with the highest weight addition results for XOR; and select keys from the temporary key pools corresponding to any two quantum links with non-highest weight addition results for XOR.

10. A centralized quantum key relay network system, characterized in that: The system includes a QKDN controller and a network node, wherein the network node includes a user node and a relay node, wherein: The relay node XORs the quantum keys generated by different quantum links according to the method described in any one of claims 1 to 9 and uploads them to the QKDN controller; The QKDN controller receives the key request sent by the network node, and sends an XOR key to the service target node based on the key request.

11. A computer device, characterized in that: The device includes a memory and a processor; wherein the processor runs a program corresponding to the executable program code by reading the executable program code stored in the memory, so as to implement the method according to any one of claims 1 to 8.

12. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 8 is implemented.

Citation Information

Patent Citations

  • Routing service method and device of relay node

    CN110690960A

  • Quantum relay node virtualization method and device

    CN112367124A

  • Mobile device with quantum cryptography capability for secure moble commerce and authentification method therefor

    KR1020160091104A

Cited By

  • Centralized quantum key relay network and key distribution method

    CN119766443A

  • Centralized quantum key relay network and key storage method therefor

    WO2026138504A1