A routing processing method of a quantum cryptography network and a related device

Abstract

The application provides a routing processing method of a quantum cryptography network and related equipment. In the method, a source node sends a routing query request to a primary server at a trigger time of the source node reaching a key relay service. The primary server performs relay routing search upon receiving the routing query request, so that a node in need of relay can search for a routing path, the routing search workload is reduced, and thus the calculation resources and network bandwidth can be saved.

Description

Technical Field

[0001] This application relates to the field of quantum cryptography communication technology, and in particular to a routing processing method and related equipment for quantum cryptography networks. Background Technology

[0002] Quantum cryptography, with its unconditional security and high efficiency, has brought about a revolutionary development in information security and is currently the main research direction for secure data transmission.

[0003] As more and more quantum cryptography networks are built and the networks become larger, two quantum key management nodes that are thousands of kilometers apart need to generate a shared symmetric key through key relay. This involves using quantum keys that have already been generated on multiple quantum channels and protecting the user's communication key with a one-time pad method, and generating a shared key through a hop-by-hop relay.

[0004] Key relaying requires calculating the routing paths between quantum key management nodes in a quantum cryptography network. Currently, quantum cryptography network systems employ full computation, meaning they calculate all routing paths between all quantum key management nodes. For example, assuming there are N nodes in the quantum cryptography network, there are N*(N-1) routing paths. However, this method involves a large amount of routing work, resulting in significant consumption of computational resources and network bandwidth. Summary of the Invention

[0005] To address the aforementioned technical problems, this application provides a routing method and related equipment for quantum cryptography networks, aiming to reduce the workload of route search. The technical solution is as follows:

[0006] A routing processing method for a quantum cryptographic network, comprising:

[0007] The primary server receives a routing query request from the source node, which is sent by the source node when it reaches the triggering time of the key relay service. The source node can be any node in the quantum cryptography network. The routing query request contains information about the destination node. The primary server is a server used to manage the source node.

[0008] The primary server searches for a route from the source node to the destination node based on the quantum key quantity information reported by the nodes it manages.

[0009] If a route is found, the routing information corresponding to the found route path is sent to the source node and the intermediate nodes on the route path, so that the intermediate nodes on the route path can transfer the quantum key to be used determined by the source node to the destination node.

[0010] Optionally, before searching for a route from the source node to the destination node based on the quantum key quantity information reported by the nodes it manages, the method further includes:

[0011] Determine whether the target node is a node it manages;

[0012] If so, then based on the quantum key quantity information reported by the nodes it manages, it searches for a routing path from the source node to the destination node.

[0013] Optionally, the method further includes:

[0014] If the destination node is not a node managed by it, then determine whether it has an upstream server;

[0015] If there is a parent server, the routing query request is sent to its parent server so that the parent server can search for routing information corresponding to the routing path from the source node to the destination node based on the routing information reported by multiple first-level servers, and then distribute the searched routing information to the first-level server that issued the routing query request and other first-level servers related to the routing information.

[0016] Optionally, the method further includes:

[0017] If there is no upstream server, a route search failure message will be returned.

[0018] A routing processing method for a quantum cryptographic network, comprising:

[0019] The upper-level server receives a routing query request from the first-level server. The routing query request is sent by the source node to the first-level server when it reaches the triggering time of the key relay service. The source node can be any node in the quantum cryptography network. The routing query request contains information about the destination node. The first-level server is a server used to manage the source node.

[0020] The upper-level server searches for routing information corresponding to the routing path from the source node to the destination node based on the routing information reported by multiple first-level servers.

[0021] The upper-level server sends the searched routing information to the first-level server that issued the routing query request and other first-level servers related to the routing information, so that the first-level server that issued the routing query request and the other related first-level servers send the received routing information to the source node and intermediate nodes on the routing path, so that the intermediate nodes on the routing path transfer the quantum key to be used determined by the source node to the destination node.

[0022] Optionally, the method further includes:

[0023] If the upstream server fails to find the routing information corresponding to the routing path from the source node to the destination node, it returns a routing search failure message.

[0024] A Tier 1 server includes:

[0025] First memory and first processor;

[0026] The first memory is used to store at least one set of instructions;

[0027] A first processor is configured to invoke and execute the instruction set in the first memory, and perform the following processing by executing the instruction set:

[0028] The system receives a routing query request from a source node, which is sent by the source node when it reaches the triggering time of the key relay service. The source node can be any node in the quantum cryptography network. The routing query request contains information about the destination node. The primary server is a server used to manage the source node.

[0029] Based on the quantum key quantity information reported by the nodes managed by the primary server, search for a routing path from the source node to the destination node;

[0030] If a route is found, the routing information corresponding to the found route path is sent to the source node and the intermediate nodes on the route path, so that the intermediate nodes on the route path can transfer the quantum key to be used determined by the source node to the destination node.

[0031] Optionally, the first processor, by executing the instruction set, also performs the following processing:

[0032] Determine whether the destination node is a node managed by the primary server;

[0033] If so, then based on the quantum key quantity information reported by the nodes managed by the primary server, a routing path from the source node to the destination node is searched.

[0034] Optionally, the first processor, by executing the instruction set, also performs the following processing:

[0035] If the destination node is not a node managed by the primary server, then determine whether the primary server has a superior server.

[0036] If there is a parent server, the routing query request is sent to the parent server so that the parent server can search for the routing information corresponding to the routing path from the source node to the destination node based on the routing information reported by multiple first-level servers, and then send the determined routing information to the first-level server that issued the routing query request and other first-level servers related to the routing information.

[0037] Optionally, the first processor, by executing the instruction set, also performs the following processing:

[0038] If there is no upstream server, a route search failure message will be returned.

[0039] An upstream server includes:

[0040] Second memory and second processor;

[0041] The second memory is used to store at least one set of instructions;

[0042] The second processor is configured to invoke and execute the instruction set in the second memory, and perform the following processing by executing the instruction set:

[0043] The system receives a routing query request from a primary server. The routing query request is sent by the source node to the primary server when it reaches the key relay service triggering time. The source node is any node in the quantum cryptography network. The routing query request contains information about the destination node. The primary server is a server used to manage the source node.

[0044] Based on the routing information reported by multiple primary servers, search for the routing information corresponding to the routing path from the source node to the destination node;

[0045] The searched routing information is sent to the primary server that issued the routing query request and other primary servers related to the routing information, so that the primary server that issued the routing query request and the other related primary servers send the received routing information to the source node and intermediate nodes on the routing path, so that the intermediate nodes on the routing path transfer the quantum key to be used determined by the source node to the destination node.

[0046] Optionally, the second processor, by executing the instruction set, also performs the following processing:

[0047] If no routing information is found for the route path from the source node to the destination node, a route search failure message is returned.

[0048] Compared with the prior art, the beneficial effects of this application are as follows:

[0049] In this application, when the source node arrives at the key relay service trigger point, it sends a route query request to the primary server. Upon receiving the route query request, the primary server performs a relay route search, thereby searching for route paths for nodes with relay requirements. This eliminates the need to search for route paths for all nodes, reducing the workload of route search and thus saving computing resources and network bandwidth. Attached Figure Description

[0050] To more clearly illustrate the technical solutions in the embodiments of this application, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0051] Figure 1 This is a flowchart illustrating a routing method for a quantum cryptography network provided in Embodiment 1 of this application;

[0052] Figure 2 This is a schematic diagram of a routing processing scenario provided in this application;

[0053] Figure 3 This is a flowchart illustrating a routing method for a quantum cryptography network provided in Embodiment 2 of this application;

[0054] Figure 4 This is a flowchart illustrating a routing method for a quantum cryptography network provided in Embodiment 3 of this application;

[0055] Figure 5 This is a schematic diagram of another scenario for routing processing provided in this application;

[0056] Figure 6 This is a flowchart illustrating a routing method for a quantum cryptography network provided in Embodiment 4 of this application;

[0057] Figure 7 This is a schematic diagram of the logical structure of a primary server provided in this application;

[0058] Figure 8 This is a schematic diagram of the logical structure of a superior server provided in this application. Detailed Implementation

[0059] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0060] To make the above-mentioned objects, features and advantages of the present invention more apparent and understandable, the present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments.

[0061] Reference Figure 1 This is a flowchart illustrating a routing method for a quantum cryptography network provided in Embodiment 1 of this application. Figure 1 As shown, the method may include, but is not limited to, the following steps:

[0062] Step S11: The primary server receives a routing query request from the source node. The routing query request is sent by the source node when it reaches the triggering time of the key relay service. The source node is any node in the quantum cryptography network.

[0063] The routing query request contains information about the destination node, and the primary server is a server used to manage the source node.

[0064] In this embodiment, the source node can determine whether it has reached the triggering time of the key relay service.

[0065] If the request is received, it indicates that the source node needs to transfer the determined quantum key to be used to the destination node through the relay node, and then sends a routing query request to the primary server.

[0066] In this embodiment, the source node's determination of whether it has reached the triggering time for the key relay service may include, but is not limited to:

[0067] When the source node receives a service request from the first communication object, it determines whether a quantum key has been negotiated with the destination node based on the service request. The destination node is the node in the quantum cryptography network corresponding to the second communication object, and there is a communication relationship between the second communication object and the first communication object.

[0068] If a quantum key has not been negotiated, the triggering time for the key relay service is determined.

[0069] It is understandable that when the source node and the destination node have not negotiated a quantum key, it means that the source node and the destination node cannot directly generate a quantum key. Therefore, the source node and the destination node cannot distribute the negotiated quantum key to the first and second communication objects, and thus, the first and second communication objects cannot perform encrypted transmission based on the quantum key. Therefore, to ensure that the source node and the destination node can distribute the quantum key to the first and second communication objects, the source node, after determining the quantum key to be used, needs to use a relay node to relay the quantum key to be used to the destination node. Therefore, when the source node determines that it has not negotiated a quantum key with the destination node, it can determine the triggering time for the key relay service.

[0070] Step S12: The primary server searches for a routing path from the source node to the destination node based on the quantum key quantity information reported by the nodes it manages.

[0071] In this embodiment, the detailed process of searching for a routing path from the source node to the destination node based on the quantum key quantity information reported by the managed nodes can be found in the prior art, which describes the search for routing paths between different nodes based on the quantum key quantity information reported by the nodes. It will not be repeated here.

[0072] Step S13: If a route is found, the routing information corresponding to the found route path is sent to the source node and the intermediate nodes on the route path, so that the intermediate nodes on the route path can transfer the quantum key to be used determined by the source node to the destination node.

[0073] Now combined Figure 2 The steps S11-S13 are explained as follows: Figure 2 As shown, if node 1 is the source node, when node 1 determines that it has not negotiated a quantum key with node 4, node 1 can send a routing query request to the first-level server. The first-level server searches for a routing path from node 1 to node 4 based on the quantum key quantity information reported by nodes 1, 2, 3 and 4 under its management. The path could be node 1 -> node 2, node 2 -> node 3, node 3 -> node 4, or node 1 -> node 2, node 2 -> node 4. The server then sends the routing information corresponding to the searched routing path to the corresponding nodes among nodes 1, 2 and 3. The corresponding nodes among nodes 1, 2 and 3 then transfer the quantum key to be used determined by node 1 to node 4.

[0074] In this application, when the source node arrives at the triggering time of the key relay service, it sends a route query request to the primary server. When the primary server receives the route query request, it performs a relay route search, thereby searching for route paths for nodes with relay needs. It is not necessary to search for route paths for all nodes, thus saving computing resources and network bandwidth.

[0075] As another optional embodiment of this application, refer to Figure 3 This is a flowchart of Embodiment 2 of a routing processing method for a quantum cryptography network provided in this application. This embodiment is mainly an extension of the routing processing method described in Embodiment 1 above, such as... Figure 3 As shown, the method may include, but is not limited to, the following steps:

[0076] Step S21: The first-level server receives a routing query request from the source node. The routing query request is sent by the source node when it reaches the triggering time of the key relay service. The source node is any node in the quantum cryptography network.

[0077] The routing query request contains information about the destination node, and the primary server is a server used to manage the source node.

[0078] For a detailed description of step S21, please refer to the relevant description of step S11 in Example 1, which will not be repeated here.

[0079] Step S22: The primary server determines whether the destination node is a node it manages.

[0080] If yes, proceed to step S23; otherwise, the search can be terminated or other servers can be used for the search.

[0081] The process by which a primary server determines whether a destination node is one of its managed nodes can be understood as follows: the primary server searches its list of managed nodes for information that matches the destination node's information. If a match is found, the destination node is determined to be one of its managed nodes; otherwise, it is determined that the destination node is not one of its managed nodes.

[0082] Step S23: The primary server searches for a routing path from the source node to the destination node based on the quantum key quantity information reported by the nodes it manages.

[0083] Step S24: If a route is found, the routing information corresponding to the found route path is sent to the source node and the intermediate nodes on the route path, so that the intermediate nodes on the route path can transfer the quantum key to be used determined by the source node to the destination node.

[0084] For a detailed description of steps S23-S24, please refer to the relevant description of steps S12-S13 in Example 1, which will not be repeated here.

[0085] As another optional embodiment of this application, refer to Figure 4 This is a flowchart of Embodiment 3 of a routing processing method for a quantum cryptography network provided in this application. This embodiment is mainly an extension of the routing processing method described in Embodiment 2 above, such as... Figure 4 As shown, the method may include, but is not limited to, the following steps:

[0086] Step S31: The first-level server receives a routing query request from the source node. The routing query request is sent by the source node when it reaches the triggering time of the key relay service. The source node is any node in the quantum cryptography network.

[0087] The routing query request contains information about the destination node, and the primary server is a server used to manage the source node.

[0088] For a detailed description of step S31, please refer to the relevant description of step S21 in Example 2, which will not be repeated here.

[0089] Step S32: The primary server determines whether the destination node is a node it manages.

[0090] If yes, proceed to step S33; otherwise, proceed to step S35.

[0091] Step S33: The primary server searches for a routing path from the source node to the destination node based on the quantum key quantity information reported by the nodes it manages.

[0092] Step S34: If a route is found, the first-level server will send the routing information corresponding to the found route to the source node and the intermediate nodes on the route, so that the intermediate nodes on the route will transfer the quantum key to be used determined by the source node to the destination node.

[0093] Step S35: The first-level server determines whether it has a superior server.

[0094] If yes, proceed to step S36; otherwise, return the route search failure message or re-perform the route path search.

[0095] Step S36: The primary server sends the routing query request to its superior server, so that the superior server searches for routing information corresponding to the routing path from the source node to the destination node based on the routing information reported by multiple primary servers, and sends the determined routing information to the primary server that issued the routing query request and other primary servers related to the routing information, so that the primary server that issued the routing query request and the other related primary servers send the received routing information to the source node and intermediate nodes on the routing path, so that the intermediate nodes on the routing path transfer the quantum key to be used determined by the source node to the destination node.

[0096] In this embodiment, nodes can periodically update their key quantity information to the primary server. The primary server stores the key quantity information of its network nodes. If the primary server has a superior server, it immediately updates the routing information between nodes and updates the changed routes to the superior server, but does not distribute the updated routes to the nodes. If there is no superior server, it does not immediately update the routing information between nodes, nor does it distribute the updated routes to the nodes. The primary server can update the routing information in real time based on the key quantity information of its network nodes and report the updated routing information to the superior server, ensuring that the superior server has timely access to the routing information within each primary server, facilitating cross-primary server routing path search. However, the updated routing information from the primary server is not distributed to the nodes; it is only distributed when a node sends a routing query request to the primary server as needed, thereby reducing the distribution of unnecessary routing information and saving network bandwidth.

[0097] If the upstream server fails to determine the routing information corresponding to the route path from the source node to the destination node, it can return a route search failure message.

[0098] Now combined Figure 5 Steps S31-S36 will be described in detail, such as... Figure 5As shown, if node 1 is the source node, and node 1 determines that it has not negotiated a quantum key with node 4, node 1 can send a routing query request to the first-level server 1. Based on the quantum key information reported by nodes 1 and 2 under its management, the first-level server 1 does not find a route from node 1 to node 4. Therefore, the first-level server 1 sends the routing query request to its superior server, the second-level server. The first-level server 1 finds route path 1 from node 1 to node 2, the first-level server 2 finds route path 2 from node 2 to node 3, and the first-level server 3 finds route path 2 from node 3 to node 4. For node 4, routing path 3, primary servers 1, 2, and 3 report the routing information corresponding to the searched routing path to the secondary server. The secondary server determines the routing path from node 1 to node 4 and sends the routing information corresponding to the routing path from node 1 to node 4 to primary servers 1, 2, and 3. Primary servers 1, 2, and 3 then send the routing information corresponding to the routing path from node 1 to node 4 to the nodes they manage. The nodes managed by primary servers 1, 2, and 3 then transfer the quantum key to be used determined by node 1 to node 4.

[0099] In this embodiment, when the destination node is not a node managed by the primary server to which the source node belongs, the primary server sends the routing query request to the upper-level server, which then continues to search for the routing path, thereby improving the reliability of the routing path search.

[0100] It should be noted that the routing method for quantum cryptography networks provided in this application embodiment can be applied to the above-mentioned two-level server network structure, and can also be applied to a three-level or more-level server network structure through a step-by-step search. This application has no limitation in this regard.

[0101] Reference Figure 6 This is a flowchart illustrating a routing method for a quantum cryptography network provided in Embodiment 4 of this application. Figure 6 As shown, the method may include, but is not limited to, the following steps:

[0102] Step S41: The upper-level server receives a routing query request from the first-level server. The routing query request is sent by the source node to the first-level server when it reaches the triggering time of the key relay service. The source node is any node in the quantum cryptography network. The routing query request contains information about the destination node. The first-level server is a server used to manage the source node.

[0103] Step S42: The upper-level server searches for routing information corresponding to the routing path from the source node to the destination node based on the routing information reported by multiple first-level servers.

[0104] In this embodiment, nodes can periodically update key quantity information to a primary server. The primary server stores the key quantity information of the nodes in the network. If the primary server has a superior server, it immediately updates the routing information between nodes and updates the changed routes to the superior server, but does not send the updated routes to the nodes. If there is no superior server, it does not immediately update the routing information between nodes, nor does it send the updated routes to the nodes.

[0105] Step S43: The upper-level server sends the searched routing information to the first-level server that issued the routing query request and other first-level servers related to the routing information, so that the first-level server that issued the routing query request and the other related first-level servers send the received routing information to the source node and intermediate nodes on the routing path, so that the intermediate nodes on the routing path transfer the quantum key to be used determined by the source node to the destination node.

[0106] In this embodiment, if the upper-level server fails to find the routing information corresponding to the routing path from the source node to the destination node, it can return a routing search failure message.

[0107] The first-level server provided in this application will be introduced next. The first-level server described below can be referred to in correspondence with the routing processing method of the quantum cryptography network described above.

[0108] Please see Figure 7 Level 1 servers include:

[0109] First memory 100 and first processor 200;

[0110] The first memory 100 is used to store at least one set of instructions;

[0111] The first processor 200 is configured to invoke and execute the instruction set stored in the first memory 100, and perform the following processing by executing the instruction set:

[0112] The system receives a routing query request from a source node, which is sent by the source node when it reaches the triggering time of the key relay service. The source node can be any node in the quantum cryptography network. The routing query request contains information about the destination node. The primary server is a server used to manage the source node.

[0113] Based on the quantum key quantity information reported by the nodes managed by the primary server, search for a routing path from the source node to the destination node;

[0114] If a route is found, the routing information corresponding to the found route path is sent to the source node and the intermediate nodes on the route path, so that the intermediate nodes on the route path can transfer the quantum key to be used determined by the source node to the destination node.

[0115] In this embodiment, the first processor 200 can also perform the following processing by executing the instruction set:

[0116] Determine whether the destination node is a node managed by the primary server;

[0117] If so, then based on the quantum key quantity information reported by the nodes managed by the primary server, a routing path from the source node to the destination node is searched.

[0118] In this embodiment, the first processor 200 can also perform the following processing by executing the instruction set:

[0119] If the destination node is not a node managed by the primary server, then determine whether the primary server has a superior server.

[0120] If there is a parent server, the routing query request is sent to the parent server so that the parent server can search for the routing information corresponding to the routing path from the source node to the destination node based on the routing information reported by multiple first-level servers, and then send the determined routing information to the first-level server that issued the routing query request and other first-level servers related to the routing information.

[0121] In this embodiment, the first processor 200 can also perform the following processing by executing the instruction set:

[0122] If there is no upstream server, a route search failure message will be returned.

[0123] In another embodiment of this application, a superior server is provided; please refer to [link to relevant documentation]. Figure 8 The upstream servers include:

[0124] Second memory 300 and second processor 400;

[0125] The second memory 300 is used to store at least one set of instructions;

[0126] The second processor 400 is configured to invoke and execute the instruction set in the second memory 300, and perform the following processes by executing the instruction set:

[0127] The system receives a routing query request from a primary server. The routing query request is sent by the source node to the primary server when it reaches the key relay service triggering time. The source node is any node in the quantum cryptography network. The routing query request contains information about the destination node. The primary server is a server used to manage the source node.

[0128] Based on the routing information reported by multiple primary servers, search for the routing information corresponding to the routing path from the source node to the destination node;

[0129] The searched routing information is sent to the primary server that issued the routing query request and other primary servers related to the routing information, so that the primary server that issued the routing query request and the other related primary servers send the received routing information to the source node and intermediate nodes on the routing path, so that the intermediate nodes on the routing path transfer the quantum key to be used determined by the source node to the destination node.

[0130] The second processor 400 can also perform the following processes by executing the instruction set:

[0131] If no routing information is found for the route path from the source node to the destination node, a route search failure message is returned.

[0132] It should be noted that each embodiment focuses on describing the differences from other embodiments, and the same or similar parts between the embodiments can be referred to accordingly. For the device embodiments, since they are basically similar to the method embodiments, the description is relatively simple, and the relevant parts can be referred to the description of the method embodiments.

[0133] Finally, it should be noted that in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0134] For ease of description, the above devices are described separately by function as various units. Of course, in implementing this application, the functions of each unit can be implemented in one or more software and / or hardware.

[0135] As can be seen from the above description of the embodiments, those skilled in the art can clearly understand that this application can be implemented by means of software plus necessary general-purpose hardware platforms. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in various embodiments or some parts of the embodiments of this application.

[0136] The routing processing method and related equipment for a quantum cryptography network provided in this application have been described in detail above. Specific examples have been used to illustrate the principles and implementation methods of this application. The description of the above embodiments is only for the purpose of helping to understand the method and core ideas of this application. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of this application. Therefore, the content of this specification should not be construed as a limitation of this application.

Claims

1. A routing processing method for a quantum cryptographic network, characterized in that, This is applicable to scenarios where the source and destination nodes have not negotiated a quantum key and require key relay, including: The nodes periodically update the quantum key quantity information to the primary server; The primary server stores the quantum key quantity information of the nodes in this network. If the primary server has a superior server, it updates the routing information according to the quantum key quantity information and reports the changed routing information to the superior server. The updated routing information of the primary server is not distributed to the nodes it manages. The primary server receives a routing query request from the source node, which is sent by the source node when it reaches the triggering time of the key relay service. The source node can be any node in the quantum cryptography network. The routing query request contains information about the destination node. The primary server is a server used to manage the source node. The primary server searches for a routing path from the source node to the destination node based on real-time updated routing information. If a route is found, the routing information corresponding to the found route path is sent to the source node and the intermediate nodes on the route path, so that the intermediate nodes on the route path can transfer the quantum key to be used determined by the source node to the destination node.

2. The method according to claim 1, characterized in that, Before searching for a route path from the source node to the destination node based on real-time updated routing information, the method further includes: Determine whether the target node is a node it manages; If so, then based on the real-time updated routing information, search for a routing path from the source node to the destination node.

3. The method according to claim 2, characterized in that, The method further includes: If the destination node is not a node managed by it, then determine whether it has an upstream server; If there is a parent server, the routing query request is sent to its parent server so that the parent server can search for routing information corresponding to the routing path from the source node to the destination node based on the routing information reported by multiple first-level servers, and then distribute the searched routing information to the first-level server that issued the routing query request and other first-level servers related to the routing information.

4. The method according to claim 3, characterized in that, The method further includes: If there is no upstream server, a route search failure message will be returned.

5. A routing processing method for a quantum cryptographic network, characterized in that, This is applicable to scenarios where the source and destination nodes have not negotiated a quantum key and require key relay, including: The upper-level server receives a routing query request from the first-level server. This request is sent by the source node to the first-level server when it reaches the key relay service trigger point. The source node can be any node in the quantum cryptography network. The routing query request includes information about the destination node. The first-level server is a server used to manage the source node. Nodes periodically update their quantum key quantity information to the first-level server. The first-level server stores the quantum key quantity information of its network nodes. If the first-level server has an upper-level server, it updates the routing information based on the quantum key quantity information and reports the changed routing information to the upper-level server. The updated routing information from the first-level server is not distributed to the nodes it manages. The upper-level server searches for routing information corresponding to the routing path from the source node to the destination node based on the routing information reported by multiple first-level servers. The upper-level server sends the searched routing information to the first-level server that issued the routing query request and other first-level servers related to the routing information, so that the first-level server that issued the routing query request and the other related first-level servers send the received routing information to the source node and intermediate nodes on the routing path, so that the intermediate nodes on the routing path transfer the quantum key to be used determined by the source node to the destination node.

6. The method according to claim 5, characterized in that, The method further includes: If the upstream server fails to find the routing information corresponding to the routing path from the source node to the destination node, it returns a routing search failure message.

7. A primary server, characterized in that, This is applicable to scenarios where the source and destination nodes have not negotiated a quantum key and require key relay, including: First memory and first processor; The first memory is used to store at least one set of instructions; A first processor is configured to invoke and execute the instruction set in the first memory, and perform the following processing by executing the instruction set: The receiving node periodically updates the quantum key quantity information; The system stores the quantum key quantity information of the nodes in this network. If the primary server has a superior server, it updates the routing information based on the quantum key quantity information and reports the changed routing information to the superior server. The updated routing information of the primary server is not distributed to the nodes it manages. The system receives a routing query request from a source node, which is sent by the source node when it reaches the triggering time of the key relay service. The source node can be any node in the quantum cryptography network. The routing query request contains information about the destination node. The primary server is a server used to manage the source node. Based on the real-time updated routing information, search for a routing path from the source node to the destination node; If a route is found, the routing information corresponding to the found route path is sent to the source node and the intermediate nodes on the route path, so that the intermediate nodes on the route path can transfer the quantum key to be used determined by the source node to the destination node.

8. The primary server according to claim 7, characterized in that, The first processor, by executing the instruction set, also performs the following processing: Determine whether the destination node is a node managed by the primary server; If so, then based on the real-time updated routing information, search for a routing path from the source node to the destination node.

9. The primary server according to claim 8, characterized in that, The first processor, by executing the instruction set, also performs the following processing: If the destination node is not a node managed by the primary server, then determine whether the primary server has a superior server. If there is a parent server, the routing query request is sent to the parent server so that the parent server can search for the routing information corresponding to the routing path from the source node to the destination node based on the routing information reported by multiple first-level servers, and then send the determined routing information to the first-level server that issued the routing query request and other first-level servers related to the routing information.

10. The primary server according to claim 9, characterized in that, The first processor, by executing the instruction set, also performs the following processing: If there is no upstream server, a route search failure message will be returned.

11. A superior server, characterized in that, This is applicable to scenarios where the source and destination nodes have not negotiated a quantum key and require key relay, including: Second memory and second processor; The second memory is used to store at least one set of instructions; The second processor is configured to invoke and execute the instruction set in the second memory, and perform the following processing by executing the instruction set: The system receives routing query requests from a primary server. These requests are sent by the source node when it reaches the key relay service. The source node can be any node in the quantum cryptography network. The routing query request includes information about the destination node. The primary server is a server that manages the source node. Nodes periodically update their quantum key quantity information to the primary server. The primary server stores the quantum key quantity information of its network nodes. If the primary server has a superior server, it updates the routing information based on the quantum key quantity information and reports the changed routing information to the superior server. The updated routing information from the primary server is not distributed to the nodes it manages. Based on the routing information reported by multiple primary servers, search for the routing information corresponding to the routing path from the source node to the destination node; The searched routing information is sent to the primary server that issued the routing query request and other primary servers related to the routing information, so that the primary server that issued the routing query request and the other related primary servers send the received routing information to the source node and intermediate nodes on the routing path, so that the intermediate nodes on the routing path transfer the quantum key to be used determined by the source node to the destination node.

12. The upper-level server according to claim 11, characterized in that, The second processor, by executing the instruction set, also performs the following processing: If no routing information is found for the route path from the source node to the destination node, a route search failure message is returned.

Images