Relay method and device for centralized quantum network key resource management

By establishing an undirected topology map in a centralized quantum network, selecting key relay nodes based on the node degree, filtering the key relay routing path, solving the problem of key xOR value waste, reducing resource waste and user experience Delay, improves the efficiency of key resource management.

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

Patent Information

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

AI Technical Summary

Technical Problem

The problem of wasting the key XOR value in centralized quantum networks has not been effectively solved, resulting in waste of resources and delay in user experience.

Method used

By establishing an undirected topology diagram of the quantum network, select key relay nodes based on the degree of the node, and use the key relay method to filter out some nodes to form relay routing paths, avoid uploading the XOR value of all nodes, and reduce waste of key resources .

Benefits of technology

On the basis of taking into account both the system and user experience, it reduces the waste of key resources, reduces the response delay of key systems, and improves the efficiency of key resource management.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118921168A_ABST
    Figure CN118921168A_ABST
Patent Text Reader

Abstract

The invention discloses a relay method and device for centralized quantum network key resource management, and the method comprises the steps: building an undirected topological graph of a quantum network based on the local relay node information of the quantum network, enabling the nodes of the undirected topological graph to be local relay nodes, enabling the edges of the undirected topological graph to be the incidence relation between the local relay nodes, and enabling the edges of the undirected topological graph to be the incidence relation between the local relay nodes; the degree of the node is the number of edges having an association relationship with the current node; three types of centralized quantum network topology models of I-type topology, II-type topology and III-type topology are provided around key consumption; the I-type structure adopts a non-conflict node to upload a key exclusive-or value, the II-type structure adopts a tolerance mechanism to allow uploading of key exclusive-or values of part of nodes, and the III-type structure adopts a shortest path mechanism to select a key relay route for the system; according to the method, the exclusive or value strategy of the key node is selected through the strategy, so that the uploading of exclusive or value strategies of all nodes is avoided, and the time delay that a user requests the response of a key system at one point is sacrificed, so that the waste of centralized routing key resources is reduced.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of security application products, and in particular to a relay method and device for centralized quantum network key resource management. Background Art

[0002] In recent years, the country has vigorously developed quantum information technology, and quantum technology is a strong security foundation for information technology. Researchers and engineering and technical personnel have responded to the national call and actively invested in the development of quantum network-related technologies and the implementation of products. The construction of quantum networks has become an urgent task for the construction of a new generation of networks.

[0003] The standard "YD / T-4301 Quantum Communication Network Architecture" carefully classifies the architecture of quantum networks. According to the control mode, quantum network architecture can be divided into two categories, namely distributed and centralized. Although the standardized network architecture makes a reasonable division and design of network layering, in actual applications, different control modes determine that the control layer will adopt different key management methods. Distributed can use key relay to complete key transfer, and centralized uses uploading key XOR values ​​to the quantum key distribution network controller (Quantum key distribution network controller, QKDNC) to achieve key transfer. However, different control modes have different disadvantages. After the user applies for key resources, the distributed quantum network will calculate the route through QKDNC and complete the key relay through the key generated by QKD. However, the disadvantage of this key relay method is that the distributed quantum network will generate time overhead for generating keys and calculating relay routes, which will cause a certain delay for the intuitive experience of users; and the centralized quantum network uploads the key XOR value in real time because the local key management center (Key Management, KM) uploads the key XOR value in real time. Once the key is used, the key XOR value associated with it will be discarded, which will cause waste.

[0004] In the related art, a centralized quantum key relay management and control method is proposed in the patent application document with publication number CN116366237A. The scheme proposes that the key relay management and control system stores the key XOR data of the relay node, and the relay node no longer stores the key XOR data. The key relay management and control system responds to the key relay request, parses the terminal node information and the key quantity requirement information from the key relay request, queries the topological path of the node corresponding to the terminal node information in the key topology, selects the target topological path from multiple topological paths in which the key quantity of each sub-topological path meets the key quantity requirement information, obtains the key XOR data associated with the terminal node in the topological path as the target key XOR data, performs an XOR operation on the target key XOR data associated with the terminal node information, and sends the XOR operation result to the corresponding terminal node. Therefore, the centralized quantum network strategy proposed in this scheme has the optimization goal of finding the best path for users to meet their key quantity requirements. Its essence is to meet users' key quantity requirements. In addition, the key topology constructed in this scheme uses the edge information of the topology to find the next-hop high-quality node resources. In the process of finding the next hop, there is a restriction on the key quantity of the target node, so the key topology has a certain directional property and is a directed topology graph.

[0005] In the quantum network virtualization architecture method proposed in the patent application document with publication number CN110677241A, the combination problem is used to describe the actual problem, and C(n, 2) is used to calculate the number of combinations of nodes to list the routing status of virtual nodes, where n represents the number of nodes of the virtual node. In the document "Research on Routing and Resource Allocation Technology of Quantum Key Distribution Network Based on Partially Trusted Relays, Zou Xingyu, Master's Thesis", a collaborative routing ILP model of QKD network based on partially trusted relays is proposed, and the key waste problem it optimizes is the key consumption from encryption services and the key consumption of encryption service keys.

[0006] In addition, none of the above-mentioned related technologies can address the problem of waste of key XOR values ​​in centralized networks. Summary of the invention

[0007] The present invention aims to solve the problem of waste of key XOR values ​​in a centralized network.

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

[0009] On the one hand, a relay method for centralized quantum network key resource management is proposed, the method comprising:

[0010] An undirected topological graph of the quantum network is established based on the local relay node information of the quantum network, wherein the nodes of the undirected topological graph are local relay nodes, the edges of the undirected topological graph are associations between the local relay nodes, and the degree of the node is the number of edges associated with the current node;

[0011] When the undirected topology graph is a type I topology, a node with a degree of 2 is selected from the local relay nodes as a first key relay node based on the degree of the node, and some nodes are selected from the remaining local relay nodes in a key relay manner to form a relay routing path with the first key relay node;

[0012] When the undirected topology graph is a type II topology, a node with a degree of 3 is selected from the local relay nodes as a second key relay node based on the degree of the node, and some nodes are selected from the remaining local relay nodes in a key relay manner to form a relay routing path with the second key relay node;

[0013] When the undirected topology graph is a type III topology, a key relay method is used to select some nodes from all local relay nodes for performing distributed routing;

[0014] Among them, in type I topology, except for nodes with degree 1, the minimum degree of nodes is 2; in type II topology, except for nodes with degree 1, the minimum degree of nodes is 3; in type III topology, except for nodes with degree 1, the minimum degree of nodes is greater than 3.

[0015] Furthermore, the KM device and the QKD device constitute the local relay node, the edge between the nodes is the matching relationship between the QKD device and the QKD device to represent a pair of nodes for key distribution, and the value of the edge is the key agreement value generated between the QKD device and the adjacent QKD device.

[0016] Further, the selecting some nodes from the remaining local relay nodes in a key relay manner to form a relay routing path with the first key relay node includes:

[0017] According to the shortest node distance as a screening condition, some nodes that can form a minimum path with the first key relay node are searched from the remaining local relay nodes.

[0018] Furthermore, the selecting of some nodes from the remaining local relay nodes based on the shortest node distance to form a routing path with the second key relay node includes:

[0019] According to the shortest node distance as a screening condition, some nodes that can form a minimum path with the second key relay node are searched from the remaining local relay nodes.

[0020] Furthermore, when the undirected topology graph is a type III topology, a key relay method is used to select some nodes from all local relay nodes for performing distributed routing, including:

[0021] According to the shortest node distance as the screening condition, some nodes are selected from all local relay nodes for performing distributed routing.

[0022] Furthermore, the method further comprises:

[0023] Receiving the XOR value of the key on the edge where two associated nodes are located uploaded by the first key relay node or receiving the XOR value of the key on the edge where two associated nodes are located uploaded by the second key relay node;

[0024] Distributed routing is performed on the relay routing path.

[0025] Furthermore, the degree of the key relay node is determined according to the following objective function:

[0026]

[0027] Where, d i represents the degree of the i-th local relay node, and N represents the total number of local relay nodes.

[0028] In a second aspect, the present invention further proposes a relay device for centralized quantum network key resource management, the system comprising:

[0029] A topology graph construction module is used to establish an undirected topology graph of the quantum network based on the local relay node information of the quantum network, wherein the nodes of the undirected topology graph are local relay nodes, the edges of the undirected topology graph are associations between local relay nodes, and the degree of a node is the number of edges associated with the current node;

[0030] A first path identification module, configured to select a node with a degree of 2 from the local relay nodes as a first key relay node based on the degree of the node when the undirected topology graph is an I-type topology, and select some nodes from the remaining local relay nodes in a key relay manner to form a relay routing path with the first key relay node;

[0031] A second path identification module, used for selecting a node with a degree of 3 from the local relay nodes as a second key relay node based on the degree of the node when the undirected topology graph is a type II topology, and screening out some nodes from the remaining local relay nodes in a key relay manner to form a relay routing path with the second key relay node;

[0032] A third path identification module is used to select some nodes from all local relay nodes for performing distributed routing by using a key relay method when the undirected topology graph is a type III topology;

[0033] Among them, in type I topology, except for nodes with degree 1, the minimum degree of nodes is 2; in type II topology, except for nodes with degree 1, the minimum degree of nodes is 3; in type III topology, except for nodes with degree 1, the minimum degree of nodes is greater than 3.

[0034] In a third aspect, the present invention also proposes a quantum key distribution network controller, the 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 relay method for centralized quantum network key resource management as described above.

[0035] In a fourth aspect, the present invention further proposes a computer-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, the relay method for centralized quantum network key resource management as described above is implemented.

[0036] The advantages of the present invention are:

[0037] (1) The present invention adopts graph theory modeling to model the topological structure of the centralized quantum network. The degree of the node is represented as the number of edges associated with the current node. After the centralized quantum network topology is established, the network is unchanged, the degree of the node is unchanged, and the degree of the node is used to represent the tolerability of key loss. In order to take into account both the system and user experience, a compromise is made between the user and the system. In each resource management cycle, the key relay node is selected from the local relay nodes based on the degree of the node. The degree of the key relay node represents the tolerability of key loss, that is, only some local relay nodes are scheduled to upload the key XOR value, thereby avoiding the XOR value strategy of uploading all nodes through the XOR value strategy of the key node selected by the strategy, sacrificing a little delay in the system response of the user requesting the key, so as to reduce the waste of centralized routing key resources.

[0038] 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

[0039] Figure 1 This is a schematic diagram of centralized quantum network key XOR upload in one embodiment of the present invention;

[0040] Figure 2 is a centralized quantum network KM undirected graph in one embodiment of the present invention;

[0041] Figure 3 It is a flowchart of a relay method for centralized quantum network key resource management proposed in one embodiment of the present invention;

[0042] Figure 4 This is a schematic diagram of XOR value uploading of a type I centralized quantum network topology node in one embodiment of the present invention;

[0043] Figure 5 This is a schematic diagram of XOR value uploading of a type II centralized quantum network topology node in one embodiment of the present invention;

[0044] Figure 6 This is a schematic diagram of XOR value uploading of a type III centralized quantum network topology node in one embodiment of the present invention;

[0045] Figure 7 This is a schematic diagram of the quantum network key resource optimization management strategy process in one embodiment of the present invention;

[0046] Figure 8 It is a structural schematic diagram of a relay device for centralized quantum network key resource management proposed in one embodiment of the present invention;

[0047] Fig. 9 It is a schematic diagram of the structure of a quantum key distribution network controller proposed in one embodiment of the present invention. DETAILED DESCRIPTION

[0048] 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.

[0049] like Figure 1 As shown, a schematic diagram of centralized quantum network key XOR upload is described. The network node that receives quantum keys from only one QKD device is regarded as a user node, and other network nodes are regarded as local relay nodes. Both local relay nodes and user nodes can connect to the user business system and provide quantum key services to the outside, but only local relay nodes upload quantum keys generated by different links after XOR. Among them, the local relay node, also known as the local KM node, needs to generate the XOR value on both sides of the node in real time and upload it to the centralized KM in the QKDNC, and the QKDNC centrally calculates the XOR value to complete the key management requested by the user. Figure 1The local user sends a key request to the centralized quantum network. Since the centralized quantum network collects the key XOR values ​​of different KM nodes in real time, it uploads them to QKDNC and QKDNC completes the XOR value operation, directly completing the key request of the other user.

[0050] like Figure 2 As shown in the figure, the points where the QKD devices and KM devices are located are abstracted into relay nodes. The association relationship between KM nodes is the edge of the undirected graph. The edge of the undirected graph represents the key generated between the QKD devices at the node. The degree of the node represents the matching relationship between the node and the adjacent nodes. That is, the larger the node degree, the more keys are generated between the node and the more QKD nodes. Figure 1 The key XOR value is XORed by the key generated between two adjacent nodes of a node. The higher the node degree, the more XOR value sequences are generated. The degree of the node is d i , i represents the node number, and the associated edge is the degree value. For example, the number of edges associated with node 2 is 3, so the node degree of node 2 is expressed as d i =3. The higher the degree, the more the XOR values ​​of the keys of the nodes satisfy the combination formula. For example, the XOR value of the key generated by node 2 based on the associated edges is:

[0051]

[0052] According to the centralized key management method, the key XOR value will be uploaded to QKDNC at each node. Assuming there are N nodes in total, the number of XOR values ​​uploaded by N nodes to QKDNC is:

[0053]

[0054] like Figure 4 As shown, it is described as a schematic diagram of a centralized quantum network key relay strategy. Figure 4 The nodes and edges described in Figure 1 The graph is abstracted as an undirected topological graph. Figure 4 The nodes and edges of the undirected graph are Figure 2 Definition. For Figure 4 As shown in the undirected graph of N nodes, assume that due to the continuous uploading of XOR values ​​by the centralized system, the key will be discarded after using the XOR value once. For example, the key XOR values ​​of node 2 are 3 in total, namely K 12 +K 25 , K 12 +K 23 , K 23 +K 25 , assuming K 12 +K 25 The key XOR value is used, then K 12The associated edge combination and K 25 The XOR values ​​of node 2 are discarded, and the other XOR values ​​of node 2 are discarded. Define L as the lost key. d i >1, the key lost by node 2 is L:

[0055]

[0056] So the overall key consumption of the N-node centralized key is L:

[0057]

[0058] For the key management of centralized quantum networks, in order to minimize key loss, an optimization objective can be established to describe the key consumption of centralized quantum networks as:

[0059]

[0060] According to the above optimization goals, in order to minimize the above losses, the network can adopt the key relay method to solve it. It is assumed that N nodes in the centralized network are only in the process of policy formulation, and all nodes are waiting to be scheduled. The key consumption is 0 when executing distributed routing. However, this method will incur time overhead for users to wait for key relay policy formulation and key XOR value generation, which is also undesirable.

[0061] In order to take into account both the system and user experience, this embodiment compromises the system optimization goal and the user waiting time overhead, that is, in each resource management cycle, only some local relay nodes are scheduled to upload the key XOR value to the quantum centralized network QKDNC, and the remaining local relay nodes are not uploaded. In view of this situation, a scheduling node strategy is established in a way that approaches the optimization goal. The XOR value strategy of the key node selected by the strategy avoids uploading the XOR value strategy of all nodes, sacrificing a little delay in the user requesting the key system response to reduce the problem of centralized routing key resource waste. To this end, Figure 3 As shown, an embodiment of the present invention proposes a relay method for centralized quantum network key resource management, which is applied to a quantum key distribution network controller. The method includes the following steps:

[0062] S10, establishing an undirected topological graph of the quantum network based on the local relay node information of the quantum network, wherein the nodes of the undirected topological graph are local relay nodes, the edges of the undirected topological graph are associations between local relay nodes, and the degree of the node is the number of edges associated with the current node;

[0063] Specifically, this embodiment depicts the quantum centralized network topology by an undirected graph, wherein the quantum centralized network key network undirected topology graph is represented as C(V, E), and the node v of the undirected topology graph is i is a KM node, v i ∈V, where the KM device and the QKD device together constitute the relay nodes of the centralized quantum network, and the edges e between the nodes of the undirected topological graph i,j It is the match between QKD devices and QKD devices, indicating that there is an association relationship between a pair of nodes i and j for key distribution. The edge value is the key generated between QKD devices and QKD devices. That is, the edge value is the key negotiated between nodes i and j. ij The node degree is used to characterize the relationship between the node and its neighbor nodes. The node degree value is the number of associated edges, where d i Represents the node degree of the i-th node.

[0064] Furthermore, the key waste problem of centralized quantum networks is analyzed by graph theory modeling, and three types of centralized quantum network topology models are proposed around key consumption, namely type I, II, and III topological networks; among them, in type I topology, except for nodes with degree 1, the minimum degree of nodes is 2; in type II topology, except for nodes with degree 1, the minimum degree of nodes is 3; in type III topology, except for nodes with degree 1, the minimum degree of nodes is greater than 3.

[0065] S20, when the undirected topology graph is a type I topology, selecting a node with a degree of 2 from the local relay nodes as a first key relay node based on the degree of the node, and selecting some nodes from the remaining local relay nodes in a key relay manner to form a relay routing path with the first key relay node;

[0066] S30, when the undirected topology graph is a type II topology, selecting a node with a degree of 3 from the local relay nodes as a second key relay node based on the degree of the node, and selecting some nodes from the remaining local relay nodes in a key relay manner to form a relay routing path with the second key relay node;

[0067] S40: When the undirected topology graph is a type II topology, a key relay method is used to select some nodes from all local relay nodes for executing distributed routing.

[0068] It should be noted that if a node follows the combination problem, the number of key XOR values ​​it can generate is The larger the degree of a node, the higher the correlation between the node and its surroundings. Therefore, the degree of a node can be used to represent the tolerable degree of key loss. The key relay nodes are selected by the degree of each relay node to directly upload the key XOR value, that is, only some local relay nodes are scheduled to upload the key XOR value, thereby avoiding the XOR value strategy of uploading all nodes through the XOR value strategy of the key node selected by the strategy.

[0069] Specifically, in type I and type II network topologies, key nodes upload key XOR values, and the uploaded XOR values ​​are considered to be tolerable by the system, while the key consumption L=0 only occurs in type III network topology. Type III is considered to be a special case in this case where XOR values ​​cannot be uploaded.

[0070] As a further preferred technical solution, in the step S20, selecting some nodes from the remaining local relay nodes in a key relay manner to form a relay routing path with the first key relay node includes:

[0071] According to the shortest node distance as a screening condition, some nodes that can form a minimum path with the first key relay node are searched from the remaining local relay nodes.

[0072] Specifically, the I-type topology uses non-conflicting nodes to upload the XOR value of the key, finds out the relay nodes with a node degree of 2 as key intermediate nodes, and uploads the XOR value of the key on the edge of the two relay nodes associated with each key relay node to the centralized quantum network in real time. The remaining relay nodes, as scheduling nodes, do not upload the key value, but wait for QKDNC to find the minimum path according to the shortest node distance as the screening condition to wait for scheduling.

[0073] As a further preferred technical solution, in the step S30, based on the shortest node distance as a screening condition, some nodes are screened out from the remaining local relay nodes to form a routing path with the second key relay node, including:

[0074] According to the shortest node distance as a screening condition, some nodes that can form a minimum path with the second key relay node are searched from the remaining local relay nodes.

[0075] Specifically, the Type II structure adopts a tolerance mechanism, allowing the uploading of the key XOR values ​​of some nodes, that is, finding such relay nodes with a degree of 3 to define tolerable nodes, and calculating the key XOR values ​​on the edges of the two nodes associated with each tolerable node, and uploading them to the centralized quantum network in real time. The remaining relay nodes, as scheduling nodes, do not upload key values, but wait for QKDNC to find the minimum path according to the shortest node distance as the screening condition and wait for scheduling.

[0076] As a further preferred technical solution, the step S40: when the undirected topology graph is a type III topology, a key relay method is used to select some nodes from all local relay nodes for performing distributed routing, including:

[0077] According to the shortest node distance as the screening condition, some nodes are selected from all local relay nodes for performing distributed routing.

[0078] Specifically, the type III structure adopts the shortest path mechanism to select the key relay route for the system. The type III structure is a star network, and the correlation between each node is too high. In this case, a large amount of keys will be wasted as long as a node key XOR value is uploaded. In this case, all relay nodes wait for QKDNC to find the minimum path according to the shortest node distance as the screening condition to wait for scheduling. The best strategy is for the nodes scheduled in real time to complete the routing calculation in a distributed routing manner.

[0079] Specifically, by Figure 2 and Figure 4 The analysis found that when the centralized quantum network topology is established, the network is unchanged, the node degree is unchanged, and key consumption will occur as long as the node degree is greater than 2. Then the strategy only retains the node with a node degree of 2 in the centralized network to upload the key XOR value, and the others are not uploaded. Node 1 will not generate key upload, d i =2 means that node i has two neighboring nodes and two associations are generated between the three nodes. A node degree of 2 means that no conflict will occur. Nodes with a degree greater than 2 are considered to have a key XOR value conflict, that is, they are defined as conflict nodes. Figure 4 For a type I topology, the node with a node degree of 2 is Figure 4 As shown in the figure, nodes 3, 4, and 5 are generated, and the generated key XOR value is node 3, which is K 23 +K 34 ; Node 4 is K 34 +K 46 , node 5 is K 25 +K 56 For the remaining relay nodes except the key relay nodes in the local relay nodes, the shortest distance is used to form the key route and then they are scheduled, that is, waiting for QKDNC to select some nodes from the remaining relay nodes according to the shortest node distance as the screening condition to participate in the distributed routing calculation key relay route at both ends.

[0080] like Figure 4 As shown, assuming that the user initiator is node 1 and the receiver is node 8, assuming that the route calculated by the controller QKDNC is 1-2-5-6-8, 2-5-6 is the relay routing information calculated by the centralized strategy, and the XOR value uploaded by the key relay node 5 is K 25+K 56 , XOR value K 25 +K 56 is pre-calculated and stored in the controller. After determining the complete key relay routing path information 1-2-5-6-8, K 25 +K 56 The XOR value will be decrypted to get the key K 25 , K 56 , and then the controller schedules the QKD device where node 1 and node 2 are located to generate the key negotiation value K 12 , and the QKD device where nodes 6-8 are located generates the key agreement value K 68 , and K 12 and K 68 Securely transmitted to the controller QKDNC, the controller QKDNC according to the key K 12 ,K 25 ,K 56 ,K 68 Calculate the distributed routing and perform key relay. This embodiment calculates a part of the pre-made key K 25 and K 56 It is pre-stored in the controller, sacrificing a little latency in the user's request for the key system's response to reduce the waste of centralized routing key resources.

[0081] like Figure 5 As shown, it is supplementary Figure 4 The diagram of a centralized quantum network key relay strategy is shown in Figure 1. Assuming that the centralized quantum network only has 3 or more nodes, we define Figure 5 The topology shown is a Type II topology. Figure 5 The minimum degree of the N nodes shown is 1, and the others are all node degrees above 2. In this case, the system's minimum node degree is 3, and for the three nodes 2, 3, and 7, the XOR values ​​can be calculated for these three nodes and uploaded to QKDNC, and it can be considered that the loss caused by uploading the key XOR value of the node with a degree of 3 is tolerable.

[0082] In addition, except for the node with degree 1, the network structure with the minimum node degree of 4, 5, or 6 is defined as a type III structure and will no longer relax the conditions (such as Figure 6 As shown in the figure, this network is more in line with the star structure. Each node is associated with many other nodes. The node degree is too high. If the XOR value of the key of any node is uploaded, it will bring more losses to the cryptographic system. In this case, you can consider not uploading the XOR value but using the key relay method to select the nodes that need to be scheduled each time to participate in the distributed routing calculation.

[0083] Specifically, Figure 7To better illustrate the strategy execution method, the strategy execution method is described as follows:

[0084] (1) An undirected graph is established. According to the network topology, the output is a centralized quantum network undirected graph.

[0085] (2) Calculate the node degree. Calculate the node degree of each node according to the centralized quantum network undirected graph and sort it.

[0086] (3) Confirm the centralized quantum network topology model and determine whether the topology is type I, II, or III;

[0087] (4) Identify the node. If it is type I or type II, type I identifies all nodes with a degree of 2; type II identifies all nodes with a degree of 3. If not, go to step (7);

[0088] (5) Upload the key XOR value, calculate the key XOR value of the associated edge of the identification node and upload it to QKDNC;

[0089] (6) Key calculation: the remaining nodes participate in key routing selection, select relay routes for the remaining nodes according to the minimum path, and provide QKDNC calculation in combination with the above steps;

[0090] (7) Relay routes are selected for the remaining nodes according to the minimum path, and the scheduled nodes are provided to QKDNC calculation.

[0091] It should be noted that this embodiment uses graph theory modeling to analyze the key waste problem of centralized quantum networks, and proposes three types of centralized quantum network topology models around key consumption, namely type I, II, and III topology structures. And propose key relay strategies for the three types of network topologies. Type I structure uses non-conflicting nodes to upload key XOR values, type II structure uses a tolerance mechanism to allow uploading of key XOR values ​​of some nodes, and type III structure uses the shortest path mechanism to select key relay routes for the system. Compared with the traditional centralized quantum network key management method, this embodiment analyzes the problem of key waste in centralized quantum networks, characterizes the key waste problem as a mathematical graph theory problem, and uses a combinatorial problem to characterize the mathematical problem of key XOR value waste. And formulate an optimized modeling of key resource management for centralized quantum networks, taking into account the user experience and the complexity of key management of the system, a compromise is made between users and systems, and three key management strategies for different network topologies are proposed.

[0092] In addition, for Figures 4 to 6 The local relay node in , the process of uploading the key XOR value is:

[0093] Sending quantum network local relay node information to a quantum key distribution network controller so that the quantum key distribution network controller can establish an undirected topological graph of the quantum network, wherein the nodes of the undirected topological graph are local relay nodes, the edges of the undirected topological graph are associations between local relay nodes, and the degree of a node is the number of edges associated with the current node;

[0094] Receive a key relay node identifier issued by the quantum key distribution network controller, and determine whether the local relay node is a local relay node corresponding to the identifier;

[0095] If yes, the XOR value of the key of the associated edge is calculated and uploaded to QKDNC;

[0096] If not, wait for the call of the quantum key distribution network controller.

[0097] In addition, if Figure 8 As shown, another embodiment of the present invention proposes a relay device for centralized quantum network key resource management, the system comprising:

[0098] A topology graph construction module 10 is used to establish an undirected topology graph of the quantum network based on the local relay node information of the quantum network, wherein the nodes of the undirected topology graph are local relay nodes, the edges of the undirected topology graph are associations between local relay nodes, and the degree of the node is the number of edges associated with the current node;

[0099] A first path identification module 20, configured to select a node with a degree of 2 from the local relay nodes as a first key relay node based on the degree of the node when the undirected topology graph is an I-type topology, and select some nodes from the remaining local relay nodes in a key relay manner to form a relay routing path with the first key relay node;

[0100] The second path identification module 30 is used to select a node with a degree of 3 from the local relay nodes as a second key relay node based on the degree of the node when the undirected topology graph is a type II topology, and select some nodes from the remaining local relay nodes in a key relay manner to form a relay routing path with the second key relay node;

[0101] A third path identification module 40 is used to select some nodes from all local relay nodes for performing distributed routing by using a key relay method when the undirected topology graph is a type III topology;

[0102] Among them, in type I topology, except for nodes with degree 1, the minimum degree of nodes is 2; in type II topology, except for nodes with degree 1, the minimum degree of nodes is 3; in type III topology, except for nodes with degree 1, the minimum degree of nodes is greater than 3.

[0103] This embodiment uses graph theory modeling to model the topological structure of a centralized quantum network. The degree of a node is represented by the number of edges associated with the current node. The degree of a node is used to represent the tolerability of key loss. In order to balance the system and user experience, a compromise is made between the user and the system. In each resource management cycle, a key relay node is selected from the local relay nodes based on the degree of the node. The degree of the key relay node represents the tolerability of key loss, that is, only some local relay nodes are scheduled to upload the XOR value of the key, thereby avoiding the XOR value strategy of uploading all nodes through the XOR value strategy of the key node selected by the strategy, sacrificing a little delay in the response of the user requesting the key system to reduce the problem of waste of centralized routing key resources.

[0104] As a further preferred technical solution, the KM device and the QKD device constitute the local relay node, and the value of the edge in the undirected topological graph is the key negotiation value generated between the QKD device and the adjacent QKD device.

[0105] As a further preferred technical solution, the first path identification module 20 is specifically used to search for some nodes that can form a minimum path with the first key relay node from the remaining local relay nodes according to the shortest node distance as a screening condition.

[0106] As a further preferred technical solution, the second path identification module 30 searches for some nodes that can form a minimum path with the second key relay node from the remaining local relay nodes according to the shortest node distance as a screening condition.

[0107] As a further preferred technical solution, the third path identification module 40 is specifically used to select some nodes from all local relay nodes for performing distributed routing according to the shortest node distance as the screening condition.

[0108] As a further preferred technical solution, the degree of the key node is determined according to the following objective function:

[0109]

[0110] Where, d i represents the degree of the i-th local relay node, and N represents the total number of local relay nodes.

[0111] It should be noted that other embodiments of the relay device for centralized quantum network key resource management described in the present invention or implementation methods can refer to the above-mentioned method embodiments, which will not be repeated here.

[0112] In addition, the above-mentioned device can be implemented in the form of a computer program, and the computer program can be used in Fig. 9 Runs on the computer device shown. Fig. 9 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.

[0113] 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.

[0114] 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 relay method for centralized quantum network key resource management.

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

[0116] 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 relay method for centralized quantum network key resource management.

[0117] The network interface is used for network communication, such as sending assigned tasks, etc. Those skilled in the art will understand that Fig. 9 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.

[0118] 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 relay method for centralized quantum network key resource management provided in the above embodiment of the present application.

[0119] 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.

[0120] 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.

[0121] 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.

[0122] 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.

[0123] 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 relay method for centralized quantum network key resource management, characterized in that: The method comprises: An undirected topological graph of the quantum network is established based on the local relay node information of the quantum network, wherein the nodes of the undirected topological graph are local relay nodes, the edges of the undirected topological graph are associations between the local relay nodes, and the degree of the node is the number of edges associated with the current node; When the undirected topology graph is a type I topology, a node with a degree of 2 is selected from the local relay nodes as a first key relay node based on the degree of the node, and some nodes are selected from the remaining local relay nodes in a key relay manner to form a relay routing path with the first key relay node; When the undirected topology graph is a type II topology, a node with a degree of 3 is selected from the local relay nodes as a second key relay node based on the degree of the node, and some nodes are selected from the remaining local relay nodes in a key relay manner to form a relay routing path with the second key relay node; When the undirected topology graph is a type III topology, a key relay method is used to select some nodes from all local relay nodes for performing distributed routing; Among them, in type I topology, except for nodes with degree 1, the minimum degree of nodes is 2; in type II topology, except for nodes with degree 1, the minimum degree of nodes is 3; in type III topology, except for nodes with degree 1, the minimum degree of nodes is greater than 3.

2. The relay method for centralized quantum network key resource management according to claim 1, characterized in that: The KM device and the QKD device constitute the local relay node, the edge between the nodes is the matching relationship between the QKD device and the QKD device to represent a pair of nodes for key distribution, and the edge value is the key negotiation value generated between the QKD device and the adjacent QKD device.

3. The relay method for centralized quantum network key resource management according to claim 1, characterized in that: The step of selecting some nodes from the remaining local relay nodes in a key relay manner and forming a relay routing path with the first key relay node includes: According to the shortest node distance as a screening condition, some nodes that can form a minimum path with the first key relay node are searched from the remaining local relay nodes.

4. The relay method for centralized quantum network key resource management according to claim 1, characterized in that: The step of selecting some nodes from the remaining local relay nodes based on the shortest node distance to form a routing path with the second key relay node includes: According to the shortest node distance as a screening condition, some nodes that can form a minimum path with the second key relay node are searched from the remaining local relay nodes.

5. The relay method for centralized quantum network key resource management as claimed in claim 1, characterized in that: When the undirected topology graph is a type III topology, a key relay method is used to select some nodes from all local relay nodes for performing distributed routing, including: According to the shortest node distance as the screening condition, some nodes are selected from all local relay nodes for performing distributed routing.

6. The relay method for centralized quantum network key resource management as claimed in claim 1, characterized in that: The method further comprises: Receiving the XOR value of the key on the edge where two associated nodes are located uploaded by the first key relay node or receiving the XOR value of the key on the edge where two associated nodes are located uploaded by the second key relay node; Distributed routing is performed on the relay routing path.

7. The relay method for centralized quantum network key resource management as claimed in claim 1, characterized in that: The degree of the key relay node is determined according to the following objective function: Where, d i represents the degree of the i-th local relay node, and N represents the total number of local relay nodes.

8. A relay device for centralized quantum network key resource management, characterized in that: The system comprises: A topology graph construction module is used to establish an undirected topology graph of the quantum network based on the local relay node information of the quantum network, wherein the nodes of the undirected topology graph are local relay nodes, the edges of the undirected topology graph are associations between local relay nodes, and the degree of a node is the number of edges associated with the current node; A first path identification module, configured to select a node with a degree of 2 from the local relay nodes as a first key relay node based on the degree of the node when the undirected topology graph is an I-type topology, and select some nodes from the remaining local relay nodes in a key relay manner to form a relay routing path with the first key relay node; A second path identification module, used for selecting a node with a degree of 3 from the local relay nodes as a second key relay node based on the degree of the node when the undirected topology graph is a type II topology, and screening out some nodes from the remaining local relay nodes in a key relay manner to form a relay routing path with the second key relay node; A third path identification module is used to select some nodes from all local relay nodes for performing distributed routing by using a key relay method when the undirected topology graph is a type III topology; Among them, in type I topology, except for nodes with degree 1, the minimum degree of nodes is 2; in type II topology, except for nodes with degree 1, the minimum degree of nodes is 3; in type III topology, except for nodes with degree 1, the minimum degree of nodes is greater than 3.

9. A quantum key distribution network controller, 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 relay method for centralized quantum network key resource management as described in any one of claims 1 to 7.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the relay method for centralized quantum network key resource management as described in any one of claims 1 to 7 is implemented.

Citation Information

Patent Citations

  • Quantum network virtualization architecture method and device

    CN110677241A

  • Centralized quantum key relay management and control method, system and relay node

    CN116366237A

  • Quantum key relay method and apparatus based on centralized management and control network

    CN108023725A

  • Quantum key relay method

    CN109995515A

  • Communication route constructing method, and communication terminal device

    JP2008278432A

Cited By

  • Quantum key distribution relay method and system based on centralized management and control

    CN121173466A

  • A centralized control-based quantum key distribution relay method and system

    CN121173466B

  • Centralized quantum key relay method, QKD network controller, relay node and system

    CN122316614A