Routing path generation method and apparatus, and electronic device and storage medium

Abstract

A routing path generation method and apparatus, and an electronic device and a storage medium. The method comprises: determining a key length and a receiving node of a quantum key to be sent; acquiring an adjacency relationship of a QKD node in a QKD network, generation time information of an available QKD key on a link, and a corresponding key length; on the basis of the generation time information and the corresponding key length, selecting an alternative link from among links of the QKD network, wherein a key length of an available QKD key, which is generated on the alternative link after a preset time point, is not less than the key length of the quantum key to be sent; and on the basis of the adjacency relationship and the alternative link, generating a target routing path for sending to the receiving node the quantum key to be sent.

Description

Routing path generation method, apparatus, electronic device and storage medium

[0001] This disclosure is based on and claims priority to Chinese Patent Application No. 202410627236.1, filed on May 20, 2024, entitled "Route Path Generation Method, Apparatus, Electronic Device and Storage Medium", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This disclosure relates to the field of quantum communication technology, and in particular to a routing path generation method, apparatus, electronic device, and storage medium. Background Technology

[0003] In the field of quantum communication technology, quantum key distribution (QKD) follows the principles of "one-time pad" and "key and plaintext of equal length." This means that when two non-adjacent QKD nodes perform QKD, they need to be relayed through other QKD nodes. The relaying QKD node decrypts the quantum key to be forwarded using the QKD key shared with the preceding QKD node, then encrypts the quantum key using the QKD key shared with the following node, and finally sends the encrypted quantum key to the following node. Before quantum key distribution, a routing path for distributing the quantum key needs to be generated in advance.

[0004] In related technologies, the shortest path first (SLT) routing strategy is used to generate QKD routing paths.

[0005] However, QKD using routes generated based on the shortest path first (SLT) routing strategy suffers from a drawback: the QKD key generation time for encryption quantum keys is relatively long, leading to lower security. Summary of the Invention

[0006] This disclosure provides a routing path generation method, apparatus, electronic device, and storage medium, which at least to some extent overcomes the problem of low security in QKD in related technologies.

[0007] Other features and advantages of this disclosure will become apparent from the following detailed description, or may be learned in part from practice of this disclosure.

[0008] According to one aspect of this disclosure, a routing path generation method is provided, comprising: determining the key length of a quantum key to be sent and a receiving node; acquiring the adjacency relationship of QKD nodes in a QKD network, the generation time information of available QKD keys on the links, and the corresponding key lengths; selecting candidate links from the links of the QKD network according to the generation time information and the corresponding key lengths, wherein the key length of available QKD keys generated on the candidate links after a preset time point is not less than the key length of the quantum key to be sent; and generating a target routing path for sending the quantum key to be sent to the receiving node according to the adjacency relationship and the candidate links.

[0009] In one embodiment of this disclosure, the generation time information is a generation time point; the step of selecting candidate links from the links of the QKD network based on the generation time information and the corresponding key length includes: selecting candidate links from the links of the QKD network based on a preset time point, the generation time information, and the corresponding key length; when the candidate links cannot form a routing path to send the quantum key to be sent to the receiving node, updating the preset time point, wherein the updated preset time point is earlier than the original preset time point; and re-selecting candidate links from the links of the QKD network based on the updated preset time point, the generation time information, and the corresponding key length.

[0010] In one embodiment of this disclosure, the generation time information is freshness, where freshness represents the time period in which the generation time of the available QKD key occurs; the lower the freshness, the later the corresponding time period. The step of selecting candidate links from the links of the QKD network based on the generation time information and the corresponding key length includes: determining a freshness threshold; selecting candidate links from the links of the QKD network based on the freshness and the corresponding key length, wherein the key length of available QKD keys on the candidate links with a freshness not greater than the freshness threshold is not less than the key length of the quantum key to be sent; updating the freshness threshold when the candidate links cannot form a routing path to send the quantum key to be sent to the receiving node, wherein the updated freshness threshold is greater than the original freshness threshold; and re-selecting candidate links from the links of the QKD network based on the updated freshness threshold, the generation time information, and the corresponding key length.

[0011] In one embodiment of this disclosure, generating a target routing path for sending the quantum key to be sent to the receiving node based on the adjacency relationship and the alternative links includes: generating multiple routing paths for sending the quantum key to be sent to the receiving node based on the adjacency relationship and the alternative links; and selecting one routing path from the multiple routing paths as the target routing path.

[0012] In one embodiment of this disclosure, selecting a routing path as the target routing path from the plurality of routing paths includes: randomly selecting a routing path from the plurality of routing paths as the target routing path; or, selecting a routing path from the plurality of routing paths as the target routing path according to the shortest path first routing strategy.

[0013] In one embodiment of this disclosure, obtaining the generation time information and corresponding key length of available QKD keys on a link in a QKD network includes: sending an acquisition request to a QKD node in the QKD network; and receiving link status information fed back by the QKD node in the QKD network in response to the acquisition request, wherein the link status information includes the generation time information and key length of available QKD keys on the link between the QKD node and its neighboring QKD nodes.

[0014] According to another aspect of this disclosure, a routing path generation apparatus is provided, comprising: a determining module for determining the key length of a quantum key to be sent and a receiving node; an acquiring module for acquiring the adjacency relationships of QKD nodes in a QKD network, generation time information of available QKD keys on links, and corresponding key lengths; a selecting module for selecting candidate links from the links of the QKD network according to the generation time information and corresponding key lengths, wherein the key length of available QKD keys generated on the candidate links after a preset time point is not less than the key length of the quantum key to be sent; and a generating module for generating a target routing path for sending the quantum key to be sent to the receiving node according to the adjacency relationships and the candidate links.

[0015] In one embodiment of this disclosure, the generation time information is a generation time point; the selection module is used to select candidate links from the links of the QKD network according to a preset time point, the generation time information and the corresponding key length; when the candidate links cannot form a routing path to send the quantum key to be sent to the receiving node, the preset time point is updated, and the updated preset time point is earlier than the original preset time point; and candidate links are selected again from the links of the QKD network according to the updated preset time point, the generation time information and the corresponding key length.

[0016] In one embodiment of this disclosure, the generation time information is freshness, which represents the time period in which the generation time of the available QKD key is located; the lower the freshness, the later the corresponding time period. The selection module is used to determine a freshness threshold; select candidate links from the links of the QKD network according to the freshness and the corresponding key length, wherein the key length of the available QKD key on the candidate link with a freshness not greater than the freshness threshold is not less than the key length of the quantum key to be sent; when the candidate link cannot form a routing path to send the quantum key to be sent to the receiving node, update the freshness threshold, and the updated freshness threshold is greater than the original freshness threshold; select candidate links again from the links of the QKD network according to the updated freshness threshold, the generation time information, and the corresponding key length.

[0017] In one embodiment of this disclosure, the generation module is configured to generate multiple routing paths for sending the quantum key to be sent to the receiving node based on the adjacency relationship and the alternative links; and select one routing path from the multiple routing paths as the target routing path.

[0018] In one embodiment of this disclosure, the generation module is configured to randomly select one routing path from the plurality of routing paths as the target routing path; or, select one routing path from the plurality of routing paths as the target routing path according to the shortest path first routing strategy.

[0019] In one embodiment of this disclosure, the acquisition module is configured to send an acquisition request to a QKD node in the QKD network; and receive link status information fed back by the QKD node in the QKD network in response to the acquisition request, wherein the link status information includes the generation time information and key length of available QKD keys on the link between the QKD node and its neighboring QKD nodes.

[0020] According to another aspect of this disclosure, a routing path generation apparatus is provided, comprising: a neighbor management module for maintaining a neighbor table, the neighbor table representing the adjacency relationships between QKD nodes in a QKD network; a link state management module for maintaining link state information of QKD nodes in the QKD network, the link state information including generation time information and key length of available QKD keys on links between a QKD node and its neighboring QKD nodes; and a routing management module for generating a routing table according to the routing path generation method described in any of the above embodiments.

[0021] According to another aspect of this disclosure, an electronic device is provided, comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to perform any of the routing path generation methods described above by executing the executable instructions.

[0022] According to another aspect of this disclosure, a computer-readable storage medium is provided having a computer program stored thereon, which, when executed by a processor, implements any of the routing path generation methods described above.

[0023] According to another aspect of this disclosure, a computer program product is provided, the computer program product comprising a computer program or computer instructions, the computer program or computer instructions being loaded and executed by a processor to enable a computer to implement any of the routing path generation methods described above.

[0024] The technical solutions provided by the embodiments of this disclosure have at least the following beneficial effects:

[0025] The technical solution provided by the embodiments of this disclosure, by setting the key length of the available QKD key generated on the alternative link after a preset time point to be no less than the key length of the quantum key to be sent, and then selecting alternative links from the QKD network, ensures that the available QKD keys on the selected alternative links have a shorter generation time, thereby achieving higher security. Furthermore, by using the alternative links to generate a target route path for sending the quantum key to be sent to the receiving node, the QKD key used by the QKD nodes on that target route path when encrypting the quantum key to be sent has high security. This ensures that QKD performed using this target route path has higher security compared to QKD performed using a route path generated based on the shortest path first routing strategy.

[0026] It should be understood that the above general description and the following detailed description are exemplary and explanatory only, and are not intended to limit this disclosure. Attached Figure Description

[0027] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this disclosure and, together with the description, serve to explain the principles of this disclosure. It is obvious that the drawings described below are merely some embodiments of this disclosure, and those skilled in the art can obtain other drawings based on these drawings without any inventive effort.

[0028] Figure 1 shows a flowchart of quantum key distribution in related technologies.

[0029] Figure 2 shows a schematic diagram of a routing path generation system according to one embodiment of the present disclosure.

[0030] Figure 3 shows a schematic diagram of a routing path generation apparatus according to one embodiment of the present disclosure.

[0031] Figure 4 shows a flowchart of a route path generation method in one embodiment of this disclosure.

[0032] Figure 5 illustrates a flowchart of selecting alternative links in one embodiment of this disclosure.

[0033] Figure 6 illustrates a flowchart of selecting alternative links in another embodiment of this disclosure.

[0034] Figure 7 shows a schematic diagram of a QKD network in one embodiment of this disclosure.

[0035] Figure 8 shows a schematic diagram of a routing path generation apparatus in another embodiment of this disclosure.

[0036] Figure 9 shows a structural block diagram of an electronic device according to one embodiment of the present disclosure. Detailed Implementation

[0037] Exemplary embodiments will now be described more fully with reference to the accompanying drawings. However, these exemplary embodiments can be implemented in many forms and should not be construed as limited to the examples set forth herein; rather, they are provided so that this disclosure will be more comprehensive and complete, and will fully convey the concept of the exemplary embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

[0038] Furthermore, the accompanying drawings are merely illustrative of this disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and therefore repeated descriptions of them will be omitted. Some block diagrams shown in the drawings are functional entities and do not necessarily correspond to physically or logically independent entities. These functional entities may be implemented in software, in one or more hardware modules or integrated circuits, or in different network and / or processor devices and / or microcontroller devices.

[0039] It should be understood that the steps described in the method embodiments of this disclosure may be performed in different orders and / or in parallel. Furthermore, the method embodiments may include additional steps and / or omit the steps shown. The scope of this disclosure is not limited in this respect.

[0040] It should be noted that the terms "one" or "multiple" used in this disclosure are illustrative rather than restrictive, and those skilled in the art should understand that, unless otherwise expressly indicated in the context, they should be understood as "one or more".

[0041] Due to the characteristics of QKD, it can only be implemented between two communicating parties, requiring a direct fiber optic connection. Limited by the optical signal transmission distance, and assuming the key generation rate requirement is met, the transmission distance of QKD is typically between 40km and 80km. To achieve QKD over longer distances, relay nodes need to be added between the sending and receiving nodes. Among the sending, relay, and receiving nodes, adjacent nodes obtain a shared key for the link between them using QKD (i.e., the QKD key obtained by the nodes at both ends of the link segment). After the sending end generates the quantum key to be transmitted, all relay nodes along the path use the QKD key to encrypt and decrypt the key segment by segment for transmission.

[0042] In large-scale mesh-interconnected QKD networks, routing mechanisms must be supported. Routing is usually performed according to static routing or the shortest path first strategy. For security reasons, the quantum key distribution process follows the principles of "one-time pad" and "key and plaintext of equal length". In the quantum key relay process, each relevant QKD node needs to consume a QKD key of the same length for encrypted transmission.

[0043] As shown in Figure 1, the QKD routing path includes, in sequence, a sending node, a first relay node, a second relay node, and a receiving node. The QKD process then includes the following steps S11 to S1.

[0044] S11, the transmitting node generates a quantum key and encrypts the quantum key using the available QKD key on the link between it and the first relay node.

[0045] The available QKD key is the QKD key that can be used on the link between the QKD node and the next QKD node when the QKD node (e.g., the sending node, the first relay node, the second relay node, the receiving node, and other nodes involved in QKD) needs to encrypt and send the quantum key.

[0046] It should be noted that the QKD key used for encrypting quantum keys has the same key length as the quantum key, following the principle of "key and plaintext of equal length".

[0047] S12, the sending node sends the encrypted quantum key to the first relay node.

[0048] S13, the first relay node decrypts the encrypted quantum key and encrypts the quantum key again using the available QKD key on the link between it and the second relay node.

[0049] S14, the first relay node sends the encrypted quantum key to the second relay node.

[0050] S15, the second relay node decrypts the encrypted quantum key and encrypts the quantum key again using the available QKD key on the link between it and the receiving node.

[0051] S16, the second relay node sends the encrypted quantum key to the receiving node.

[0052] S17, the receiving node decrypts the encrypted quantum key to obtain the quantum key.

[0053] During the relay process, the quantum key (i.e., QKD key) shared between two adjacent QKD nodes is generated in advance through QKD and stored in the key management system of each QKD node. The longer the QKD key is stored in each QKD node, the greater the risk it faces, the lower the security of the QKD key, the lower the security of the protected quantum key, and the lower the security of QKD.

[0054] To address this, the technical solution provided by the embodiments of this disclosure involves: determining the key length of the quantum key to be transmitted and the receiving node; obtaining the adjacency relationship of QKD nodes in the QKD network, the generation time information of available QKD keys on the links, and the corresponding key lengths; selecting candidate links from the links of the QKD network based on the generation time information and the corresponding key lengths, wherein the key length of available QKD keys generated on the candidate links after a preset time point is not less than the key length of the quantum key to be transmitted; and generating a target routing path to send the quantum key to be transmitted to the receiving node based on the adjacency relationship and the candidate links.

[0055] Because the key length of the available QKD key generated on the alternative links after a preset time point is no less than the key length of the quantum key to be sent, the available QKD keys on the selected alternative links have a shorter generation time, thus providing higher security. Furthermore, by using the alternative links to generate a target route path for sending the quantum key to be sent to the receiving node, the QKD nodes on that target route path can ensure high security in the QKD keys used to encrypt the quantum key to be sent, thereby guaranteeing higher security for QKD using that target route path.

[0056] Figure 2 shows a schematic diagram of a routing path generation system according to an embodiment of the present disclosure. The system can apply the routing path generation method or routing path generation device in various embodiments of the present disclosure.

[0057] As shown in Figure 2, the routing path generation system may include multiple QKD nodes 21.

[0058] Multiple QKD nodes 21 form a QKD network. Different QKD nodes 21 can be adjacent or non-adjacent. If two QKD nodes 21 are directly connected by a link, they are adjacent. Conversely, if two QKD nodes 21 are not directly connected by a link, they are non-adjacent.

[0059] As shown in Figure 3, each QKD node 21 is configured with a route path generation device, which has a neighbor management module 211, a link state management module 212 and a route management module 213.

[0060] The neighbor management module 211 is used to maintain a neighbor table, which represents the adjacency relationships between QKD nodes 21 in the QKD network. The link state management module 212 is used to maintain the link state information of QKD nodes 21 in the QKD network. This link state information includes the generation time information and key length of available QKD keys on the links between QKD node 21 and adjacent QKD nodes 21 (adjacent QKD nodes are adjacent to each other, meaning there is a direct link between the two nodes). The routing management module 213 is used to generate a routing table according to the routing path generation method in any embodiment of this disclosure.

[0061] Each QKD node 21 communicates with each other via a network, which can be a wired network or a wireless network.

[0062] Optionally, the aforementioned wireless or wired networks use standard communication technologies and / or protocols. The network is typically the Internet, but can also be any network, including but not limited to Local Area Networks (LANs), Metropolitan Area Networks (MANs), Wide Area Networks (WANs), mobile, wired or wireless networks, private networks, or any combination of virtual private networks. In some embodiments, technologies and / or formats including Hyper Text Markup Language (HTML), Extensible Markup Language (XML), etc., are used to represent data exchanged over the network. Furthermore, conventional encryption technologies such as Secure Socket Layer (SSL), Transport Layer Security (TLS), Virtual Private Networks (VPNs), and Internet Protocol Security (IPsec) can be used to encrypt all or some links. In other embodiments, customized and / or dedicated data communication technologies can be used to replace or supplement the aforementioned data communication technologies.

[0063] In one embodiment, the network is a wired network, and the wired network is an optical fiber.

[0064] QKD node 21 can be various electronic devices, including but not limited to smartphones, tablets, laptops, desktop computers, etc.

[0065] QKD node 21 can also be a server. Optionally, the server can be a standalone physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDN (Content Delivery Network), and big data and artificial intelligence platforms.

[0066] Those skilled in the art will understand that the number of QKD nodes 21 in Figure 1 is merely illustrative, and any number of QKD nodes 21 can be used as needed. This disclosure does not limit this.

[0067] The following detailed description of this exemplary implementation method is provided in conjunction with the accompanying drawings and embodiments.

[0068] This disclosure provides a routing path generation method, which can be executed by any electronic device with computing capabilities. For example, the electronic device is a QKD node.

[0069] Figure 4 shows a flowchart of a route path generation method in one embodiment of the present disclosure. As shown in Figure 4, the route path generation method provided in this embodiment may include the following steps S401 to S404.

[0070] S401, determine the key length and receiving node of the quantum key to be sent.

[0071] Key length measures the number of bytes in a quantum key. The specific key length is determined based on the quantum key to be transmitted. For example, a key length of 40KB (KiloByte) is possible.

[0072] In one embodiment, when a QKD node acts as a transmitting node, the key length of the quantum key can be determined directly during quantum key generation. When a QKD node acts as a transmitting node, the receiving node can be determined directly based on the destination address of the quantum key to be transmitted.

[0073] S402, obtain the adjacency relationship of QKD nodes in the QKD network, the generation time information of available QKD keys on the link, and the corresponding key length.

[0074] Two QKD nodes are adjacent if they are directly connected by a link, and not adjacent if they are not directly connected by a link.

[0075] A link in a QKD network is a direct connection between two adjacent QKD nodes. In one embodiment, this link can be implemented based on optical fiber.

[0076] The generation time information of the available QKD key is used to indicate the generation time of the available QKD, specifically indicating the point in time when the available QKD key was generated or the time period in which the point in time is located. The embodiments of this disclosure do not limit the specific information regarding the generation time. In one embodiment, the generation time information can be a specific point in time; that is, the generation time information is the point in time of generation. In another embodiment, the generation time information can be freshness, which can indicate the time period in which the point in time of generation of the available QKD key is located. The lower the freshness, the later the corresponding time period. For example, a freshness of 1 corresponds to the time period t1-current, and a freshness of 2 corresponds to the time period t2-t1, where t2 is earlier than t1. For example, t2 is 8:00 AM on April 1, 2024, and t1 is 8:00 AM on April 2, 2024.

[0077] In one embodiment, QKD nodes establish adjacency relationships by sending multicast probe messages to other QKD nodes in the QKD network. These adjacency relationships are then recorded and stored in a neighbor table, which can be updated periodically or non-periodically to ensure the accuracy and comprehensiveness of the recorded adjacency relationships. In one embodiment, obtaining the adjacency relationships of QKD nodes in the QKD network may include retrieving the adjacency relationships of each QKD node from its maintained neighbor table.

[0078] In one embodiment, a neighbor management module is configured in the QKD node, which maintains the neighbor table based on the messages returned by other QKD nodes in response to multicast probe messages.

[0079] In another embodiment, obtaining the adjacency relationship of QKD nodes in the QKD network may include: directly sending multicast probe messages to other QKD nodes in the QKD network, and determining the adjacency relationship between QKD nodes in the QKD network based on the messages fed back by other QKD nodes.

[0080] In one embodiment, a QKD node can send multicast probe messages to other QKD nodes in the QKD network. Upon receiving the multicast probe message, other QKD nodes can return their locally stored link-state information descriptions. The QKD node receiving these descriptions can compare them with its local link-state information to identify any missing link-state information. Then, the QKD node sends a request to other QKD nodes to request the missing link-state information. Upon receiving the request, other QKD nodes return the corresponding link-state information. Furthermore, the QKD node can periodically or non-periodically update its stored link-state information using multicast probe messages to ensure the accuracy of the stored information.

[0081] For example, a first QKD node sends a multicast probe message to a second QKD node. Upon receiving this message, the second QKD node can return a locally stored link-state information description to the first QKD node. The first QKD node, upon receiving this description, can compare it with its local link-state information to identify any missing link-state information. Then, the first QKD node sends a request to the second QKD node to request this missing link-state information. Upon receiving the request, the second QKD node returns the corresponding link-state information to the first QKD node.

[0082] In one embodiment, the link state information includes the generation time information of available QKD keys on the link and the corresponding key length. Taking the generation time information as the generation time point as an example, the generation time information of available QKD keys can be time point 1, ..., time point n, where n is an integer not less than 1, and the key length corresponding to time point 1 is key length 1, ..., and the key length corresponding to time point n is key length n. Here, time point 1 and the corresponding key length 1 indicate that a portion of the available QKD keys on the link are generated at time point 1, and the key length of this portion of available QKD keys is key length 1.

[0083] In one embodiment, a link state management module is configured in the QKD node, which can maintain local link state information based on the link state information fed back by other QKD nodes.

[0084] In one embodiment, obtaining the generation time information and corresponding key length of available QKD keys on a link in a QKD network may include: directly obtaining the generation time information and corresponding key length from the link state information maintained by the QKD node.

[0085] In another embodiment, obtaining the generation time information and corresponding key length of available QKD keys on a link in the QKD network may include: sending an acquisition request to a QKD node in the QKD network; receiving link status information from the QKD node in response to the acquisition request, the link status information including the generation time information and key length of available QKD keys on the link between the QKD node and its neighboring QKD nodes.

[0086] By ensuring the freshness of the generated time information, the amount of link status information data can be reduced, the frequency of link status information updates can be lessened, and the applicability can be improved.

[0087] S403, Based on the generation time information and the corresponding key length, select a candidate link from the links of the QKD network. The key length of the usable QKD key generated on the candidate link after the preset time point is not less than the key length of the quantum key to be sent.

[0088] Once the key length of the available QKD key generated after a preset time point on the candidate link is not less than the key length of the quantum key to be sent, the candidate links can be directly selected by using the generation time information and corresponding key length of the available QKD key on the link.

[0089] The embodiments of this disclosure do not limit the specific time point to be preset. In one embodiment, when the generated time information is the generation time point, the preset time point is any arbitrarily determined time point; when the generated time information is freshness, the preset time point can be the boundary time point of the time period corresponding to freshness. For example, if the time period corresponding to freshness 1 is t1-current, and the time point corresponding to freshness 2 is t2-t1, then the boundary time point between the time period corresponding to freshness 1 and the time period corresponding to freshness 2 is t1.

[0090] S404: Based on the adjacency relationship and alternative links, generate the target routing path for sending the quantum key to be sent to the receiving node.

[0091] By leveraging the adjacency relationships between QKD nodes in the QKD network and selecting alternative links, a target route for sending the quantum key to be sent to the receiving node can be generated using any route generation method.

[0092] For example, multiple routing paths can be obtained by combining alternative links, and the routing path that connects the sending node and the receiving node can be selected as the target routing path. Alternatively, the sending node and the receiving node can be used as the two ends of the routing path, and alternative links can be combined to obtain the target routing path.

[0093] In one embodiment, the alternative links can be combined to form one or more routing paths connecting the sending node and the receiving node. In this case, generating a target routing path for sending the quantum key to be sent to the receiving node based on adjacency relationships and alternative links may include: generating multiple routing paths for sending the quantum key to be sent to the receiving node based on adjacency relationships and alternative links; and selecting one routing path from the multiple routing paths as the target routing path.

[0094] The embodiments of this disclosure do not limit how a routing path is selected from multiple routing paths. In one embodiment, selecting a routing path as the target routing path from multiple routing paths may include: randomly selecting a routing path from multiple routing paths as the target routing path; or selecting a routing path as the target routing path from multiple routing paths according to the shortest path first routing policy.

[0095] By selecting the target route from multiple routes for sending the quantum key to the receiving node using the shortest path first routing strategy, the efficiency of QKD can be improved by minimizing the distance of the route while ensuring sufficient security.

[0096] The technical solution provided by the embodiments of this disclosure, by setting the key length of the available QKD key generated on the alternative link after a preset time point to be no less than the key length of the quantum key to be sent, and then selecting alternative links from the QKD network, ensures that the available QKD keys on the selected alternative links have a shorter generation time, thereby achieving higher security. Furthermore, by using the alternative links to generate a target route path for sending the quantum key to be sent to the receiving node, the QKD key used by the QKD nodes on that target route path when encrypting the quantum key to be sent has high security. This ensures that QKD performed using this target route path has higher security compared to QKD performed using a route path generated based on the shortest path first routing strategy.

[0097] In one embodiment, the generation time information is the generation time point, and the process of selecting candidate links may include the following S501 to S503, that is, selecting candidate links from the links of the QKD network according to the generation time information and the corresponding key length may include S501 to S503.

[0098] S501 selects candidate links from the links of the QKD network based on the preset time point, generation time information and corresponding key length.

[0099] Among them, the key length of the available QKD key generated on the alternative link after a preset time point is not less than the key length of the quantum key to be sent.

[0100] S502, when the alternative links cannot form a route path to send the quantum key to be sent to the receiving node, the preset time point is updated, and the updated preset time point is earlier than the original preset time point.

[0101] Based on the selected candidate links, multiple routing paths are formed. If the multiple routing paths do not include a routing path for sending the quantum key to be sent to the receiving node, it means that the candidate links cannot form a routing path for sending the quantum key to be sent to the receiving node.

[0102] At this point, it is necessary to update the preset time point. By limiting the updated preset time point to be earlier than the original preset time point, more alternative links can be selected, so that a route path that can be combined from the alternative links can be obtained to send the quantum key to be sent to the receiving node.

[0103] The embodiments of this disclosure do not limit how the preset time point is updated. In one embodiment, updating the preset time point may involve moving a preset time period forward from the original preset time point. For example, the preset time period may be 5 hours, 6 hours, 24 hours, etc., and the embodiments of this disclosure do not limit this.

[0104] The embodiments of this disclosure do not impose restrictions on how the first preset time point for selecting alternative links is determined. For example, the first preset time point for selecting alternative links can be configured to be a time period shifted forward from the current time point. The specific duration of this time period is not limited in the embodiments of this disclosure; for example, the time period may be one day.

[0105] In another embodiment, multiple preset time points can be generated directly before selecting alternative links. Each preset time point corresponds to a round of selecting alternative links, and the larger the round of application, the greater the time difference between the preset time point and the current time point.

[0106] S503, based on the updated preset time point, generation time information and corresponding key length, reselects alternative links from the links of the QKD network.

[0107] Among them, the newly selected alternative links still meet the following requirement: the key length of the usable QKD key generated after the preset time point is not less than the key length of the quantum key to be sent.

[0108] If the newly selected candidate links can form a route path to send the quantum key to the receiving node, then the route path capable of sending the quantum key to the receiving node will be used as the target route path. Otherwise, the preset time point will continue to be updated to select more candidate links.

[0109] In one embodiment, the generation time information is freshness, and the lower the freshness, the later the corresponding time period. The process of selecting candidate links can then include the following steps S601 to S604: that is, selecting candidate links from the links of the QKD network based on the generation time information and the corresponding key length can include steps S601 to S604.

[0110] S601, determine the freshness threshold.

[0111] In one embodiment, a QKD node can be configured with multiple different freshness thresholds, and these multiple different freshness thresholds are in an increasing relationship. When selecting alternative links, it can start from the first freshness threshold and use freshness thresholds with larger values ​​one by one until the selected alternative links can form a routing path to send the quantum key to be sent to the receiving node.

[0112] In another embodiment, a freshness threshold is configured in the QKD node. During the selection of candidate links, this freshness threshold is used as the first freshness threshold for selection. Each time the freshness threshold is updated, a set value is added to the previous freshness threshold (the set value can be determined based on the interval between two adjacent freshness levels; for example, if there is a freshness level between freshness 1 and freshness 2, and there is no intermediate freshness level between freshness 1 and freshness 2, then the interval between two adjacent freshness levels is 1). The set value added each time can be the same or different; the embodiments of this disclosure do not impose any restrictions on this. For example, the freshness threshold configured in the QKD node is 1, and the set value is 1.

[0113] Determining the freshness threshold may include: determining the freshness threshold to be used in the current round of selecting alternative links.

[0114] S602, based on freshness and the corresponding key length, select candidate links from the links of the QKD network. On the candidate links, the key length of available QKD keys with a freshness not greater than the freshness threshold is not less than the key length of the quantum key to be sent.

[0115] S603: When the alternative links cannot form a route path to send the quantum key to be sent to the receiving node, the freshness threshold is updated, and the updated freshness threshold is greater than the original freshness threshold.

[0116] The embodiments disclosed herein do not limit how the freshness threshold is updated. In one embodiment, updating the freshness threshold may include increasing the value of two adjacent freshness intervals each time based on the original freshness threshold. In another embodiment, if the QKD node is configured with freshness thresholds for selecting candidate links in different rounds, then updating the freshness threshold can directly replace the freshness threshold used in the previous round with the freshness threshold required for the current round.

[0117] By updating the freshness threshold and limiting the updated freshness threshold to be greater than the original freshness threshold, more alternative links can be selected based on the updated freshness threshold, so that the newly selected alternative links can form a routing path to send the quantum key to be sent to the receiving node.

[0118] S604. Based on the updated freshness threshold, generation time information, and corresponding key length, select alternative links from the links in the QKD network.

[0119] Among them, the newly selected alternative links still meet the following requirements: the key length of the available QKD key with a freshness not greater than the freshness threshold is not less than the key length of the quantum key to be sent.

[0120] If the newly selected alternative links still cannot form a route path to send the quantum key to the receiving node, the freshness threshold needs to be updated until the selected alternative links can form a route path to send the quantum key to the receiving node.

[0121] To facilitate understanding of the routing path generation method in this embodiment, the following explanation will use generation time information as the freshness metric and will be conducted in conjunction with Figure 7. It should be noted that a smaller freshness value corresponds to a later time period, i.e., closer to the current time.

[0122] Figure 7 shows a QKD network with four QKD nodes and four links. The four QKD nodes are: QKD node 1, QKD node 2, QKD node 3, and QKD node 4. The four links are: the link between QKD node 1 and QKD node 2, the link between QKD node 1 and QKD node 3, the link between QKD node 2 and QKD node 4, and the link between QKD node 3 and QKD node 4.

[0123] The link between QKD node 1 and QKD node 2 has three available QKD keys with different freshness levels: a freshness level of 1 with a key length of 30KB, a freshness level of 2 with a key length of 30KB, and a freshness level of 3 with a key length of 10KB, for a total of 70KB of available QKD keys.

[0124] There are three available QKD keys with freshness levels on the link between QKD node 1 and QKD node 3. The available QKD keys with freshness level 1 have a key length of 20KB, the available QKD keys with freshness level 2 have a key length of 20KB, and the available QKD keys with freshness level 3 have a key length of 660KB, for a total of 700KB of available QKD keys.

[0125] There are three available QKD keys with freshness levels on the link between QKD node 2 and QKD node 4. The available QKD keys with freshness level 1 have a key length of 10KB, the available QKD keys with freshness level 2 have a key length of 30KB, and the available QKD keys with freshness level 3 have a key length of 30KB, for a total of 70KB of available QKD keys.

[0126] There are three available QKD keys with freshness levels on the link between QKD node 3 and QKD node 4. The available QKD key with freshness level 1 has a key length of 10KB, the available QKD key with freshness level 2 has a key length of 20KB, and the available QKD key with freshness level 3 has a key length of 870KB, for a total of 900KB of available QKD keys.

[0127] When QKD node 1 needs to send a 40KB quantum key to QKD node 4, QKD node 1 can obtain the freshness and corresponding key length of the available QKD keys on the four links shown in Figure 7 based on the link state information stored in its own node. Then, it selects candidate links with a freshness threshold of 1. The key lengths of each QKD node with a freshness threshold of 1 are compared with the required 40KB key length. The key lengths of the four links are 30KB, 10KB, 20KB, and 10KB, respectively, all less than 40KB, so no candidate links can be selected.

[0128] Next, the freshness threshold is updated to 2 for selecting candidate links. As shown in Figure 7, among the four links, those with a freshness of 1 and 2 are not greater than 2. The sum of the key lengths with freshness of 1 and 2 on each link is compared with the required 40KB key length. The key lengths of the four links are 60KB, 40KB, 40KB, and 30KB, respectively. The two links in route path 1 are 60KB and 40KB, which is greater than or equal to 40KB, so the remaining key length is sufficient. However, the two links in route path 2 are 40KB and 30KB, indicating that there are links with a key length less than 40KB, so the remaining key length is insufficient. Route path 1 is then used as the target route for QKD node 1 to send the quantum key to QKD node 4, and QKD is performed.

[0129] Based on the same inventive concept, this disclosure also provides a routing path generation device, as described in the following embodiments. Since the principle by which this device solves the problem is similar to that of the method embodiments described above, the implementation of this device embodiment can refer to the implementation of the method embodiments described above, and repeated details will not be repeated.

[0130] Figure 8 shows a schematic diagram of a routing path generation device according to an embodiment of the present disclosure. As shown in Figure 8, the device includes: a determining module 81, used to determine the key length of the quantum key to be sent and the receiving node; an acquiring module 82, used to acquire the adjacency relationship of QKD nodes in the QKD network, the generation time information of available QKD keys on the links, and the corresponding key lengths; a selecting module 83, used to select candidate links from the links of the QKD network according to the generation time information and the corresponding key lengths, wherein the key length of available QKD keys generated on the candidate links after a preset time point is not less than the key length of the quantum key to be sent; and a generating module 84, used to generate a target routing path for sending the quantum key to be sent to the receiving node according to the adjacency relationship and the candidate links.

[0131] In one embodiment of this disclosure, the generation time information is the generation time point; the selection module 83 is used to select candidate links from the links of the QKD network according to the preset time point, the generation time information and the corresponding key length; when the candidate links cannot form a route path to send the quantum key to be sent to the receiving node, the preset time point is updated, and the updated preset time point is earlier than the original preset time point; and candidate links are selected again from the links of the QKD network according to the updated preset time point, the generation time information and the corresponding key length.

[0132] In one embodiment of this disclosure, the generation time information is freshness, which represents the time period in which the generation time of the available QKD key is located. The lower the freshness, the later the corresponding time period. The selection module 83 is used to determine the freshness threshold. Based on the freshness and the corresponding key length, candidate links are selected from the links of the QKD network. On the candidate links, the key length of the available QKD key with a freshness not greater than the freshness threshold is not less than the key length of the quantum key to be sent. When the candidate links cannot form a routing path to send the quantum key to be sent to the receiving node, the freshness threshold is updated. The updated freshness threshold is greater than the original freshness threshold. Based on the updated freshness threshold, the generation time information, and the corresponding key length, candidate links are selected again from the links of the QKD network.

[0133] In one embodiment of this disclosure, the generation module 84 is used to generate multiple routing paths for sending the quantum key to be sent to the receiving node based on adjacency relationships and alternative links; and to select one routing path from the multiple routing paths as the target routing path.

[0134] In one embodiment of this disclosure, the generation module 84 is used to randomly select a routing path from multiple routing paths as the target routing path; or, according to the shortest path first routing strategy, select a routing path from multiple routing paths as the target routing path.

[0135] In one embodiment of this disclosure, the acquisition module 82 is used to send an acquisition request to a QKD node in the QKD network; and to receive link status information fed back by the QKD node in the QKD network in response to the acquisition request. The link status information includes the generation time information and key length of the available QKD keys on the link between the QKD node and its neighboring QKD nodes.

[0136] The technical solution provided by the embodiments of this disclosure, by setting the key length of the available QKD key generated on the alternative link after a preset time point to be no less than the key length of the quantum key to be sent, and then selecting alternative links from the QKD network, ensures that the available QKD keys on the selected alternative links have a shorter generation time, thereby achieving higher security. Furthermore, by using the alternative links to generate a target route path for sending the quantum key to be sent to the receiving node, the QKD key used by the QKD nodes on that target route path when encrypting the quantum key to be sent has high security. This ensures that QKD performed using this target route path has higher security compared to QKD performed using a route path generated based on the shortest path first routing strategy.

[0137] Those skilled in the art will understand that various aspects of this disclosure can be implemented as a system, method, or program product. Therefore, various aspects of this disclosure can be specifically implemented in the following forms: a completely hardware implementation, a completely software implementation (including firmware, microcode, etc.), or a combination of hardware and software aspects, collectively referred to herein as a "circuit," "module," or "system."

[0138] The electronic device 900 according to this embodiment of the present disclosure will now be described with reference to FIG9. The electronic device 900 shown in FIG9 is merely an example and should not be construed as limiting the functionality and scope of the embodiments of the present disclosure.

[0139] As shown in Figure 9, the electronic device 900 is presented in the form of a general-purpose computing device. The components of the electronic device 900 may include, but are not limited to: at least one processing unit 910, at least one storage unit 920, and a bus 930 connecting different system components (including the storage unit 920 and the processing unit 910).

[0140] The storage unit stores program code that can be executed by the processing unit 910, causing the processing unit 910 to perform the steps described in the "Detailed Description" section of this specification according to various exemplary embodiments of this disclosure.

[0141] Storage unit 920 may include readable media in the form of volatile storage units, such as random access memory (RAM) 9201 and / or cache memory 9202, and may further include read-only memory (ROM) 9203.

[0142] Storage unit 920 may also include a program / utility 9204 having a set (at least one) program module 9205, such program module 9205 including but not limited to: operating system, one or more application programs, other program modules and program data, each or some combination of these examples may include an implementation of a network environment.

[0143] Bus 930 can represent one or more of several types of bus structures, including a memory cell bus or memory cell controller, a peripheral bus, a graphics acceleration port, a processing unit, or a local bus using any of the various bus structures.

[0144] Electronic device 900 can also communicate with one or more external devices 940 (e.g., keyboard, pointing device, Bluetooth device, etc.), and with one or more devices that enable a user to interact with electronic device 900, and / or with any device that enables electronic device 900 to communicate with one or more other computing devices (e.g., router, modem, etc.). This communication can be performed via input / output (I / O) interface 950. Furthermore, electronic device 900 can also communicate with one or more networks (e.g., local area network (LAN), wide area network (WAN), and / or public networks, such as the Internet) via network adapter 960. As shown in Figure 9, network adapter 960 communicates with other modules of electronic device 900 via bus 930. It should be understood that, although not shown in the figures, other hardware and / or software modules can be used in conjunction with electronic device 900, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0145] From the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein can be implemented by software or by combining software with necessary hardware. Therefore, the technical solutions according to the embodiments of this disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (such as a CD-ROM, USB flash drive, external hard drive, etc.) or on a network, including several instructions to cause a computing device (such as a personal computer, server, terminal device, or network device, etc.) to execute the methods according to the embodiments of this disclosure.

[0146] In exemplary embodiments of this disclosure, a computer-readable storage medium is also provided, which may be a readable signal medium or a readable storage medium. A program product capable of implementing the methods described above is stored thereon. In some possible implementations, various aspects of this disclosure may also be implemented as a program product including program code, which, when run on a terminal device, causes the terminal device to perform the steps of the various exemplary embodiments of this disclosure described in the "Detailed Description" section above.

[0147] More specific examples of computer-readable storage media in this disclosure may include, but are not limited to: electrical connections having one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0148] In this disclosure, a computer-readable storage medium may include a data signal propagated in baseband or as part of a carrier wave, carrying readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A readable signal medium may also be any readable medium other than a readable storage medium, capable of transmitting, propagating, or transmitting a program for use by or in connection with an instruction execution system, apparatus, or device.

[0149] Optionally, the program code contained on the computer-readable storage medium may be transmitted using any suitable medium, including but not limited to wireless, wired, optical fiber, RF, etc., or any suitable combination thereof.

[0150] In practical implementation, program code for performing the operations of this disclosure can be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java and C++, and conventional procedural programming languages ​​such as C or similar languages. The program code can execute entirely on the user's computing device, partially on the user's device, as a standalone software package, partially on the user's computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving remote computing devices, the remote computing device can be connected to the user's computing device via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computing device (e.g., via the Internet using an Internet service provider).

[0151] In exemplary embodiments of this disclosure, a computer program product is also provided, comprising a computer program or computer instructions, which are loaded and executed by a processor to enable a computer to perform the steps of the various exemplary embodiments of this disclosure described in the foregoing “Detailed Description” section of this specification.

[0152] It should be noted that although several modules or units for the device used to perform actions have been mentioned in the detailed description above, this division is not mandatory. In fact, according to embodiments of this disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. Conversely, the features and functions of one module or unit described above can be further divided and embodied by multiple modules or units.

[0153] Furthermore, although the steps of the method in this disclosure are described in a specific order in the accompanying drawings, this does not require or imply that the steps must be performed in that specific order, or that all the steps shown must be performed to achieve the desired result. Additional or alternative steps may be omitted, multiple steps may be combined into one step, and / or a step may be broken down into multiple steps.

[0154] From the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein can be implemented by software or by combining software with necessary hardware. Therefore, the technical solutions according to the embodiments of this disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (such as a CD-ROM, USB flash drive, external hard drive, etc.) or on a network, including several instructions to cause a computing device (such as a personal computer, server, mobile terminal, or network device, etc.) to execute the methods according to the embodiments of this disclosure.

[0155] Other embodiments of this disclosure will readily occur to those skilled in the art upon consideration of the specification and practice of the invention disclosed herein. This disclosure is intended to cover any variations, uses, or adaptations of this disclosure that follow the general principles of this disclosure and include common knowledge or customary techniques in the art not disclosed herein. The specification and examples are to be considered exemplary only, and the true scope of this disclosure is indicated by the appended claims.

Claims

1. A method for generating routing paths, characterized in that, include: Determine the key length and receiving node of the quantum key to be sent; Obtain the adjacency relationship of QKD nodes in the quantum key distribution (QKD) network, the generation time information of available QKD keys on the link, and the corresponding key length; Based on the generation time information and the corresponding key length, a candidate link is selected from the links of the QKD network. The key length of the available QKD key generated on the candidate link after a preset time point is not less than the key length of the quantum key to be sent. Based on the adjacency relationship and the alternative links, a target routing path is generated to send the quantum key to be sent to the receiving node.

2. The method according to claim 1, characterized in that, The generation time information refers to the generation time point; the step of selecting candidate links from the links of the QKD network based on the generation time information and the corresponding key length includes: Based on the preset time point, the generation time information, and the corresponding key length, candidate links are selected from the links of the QKD network; If the alternative links cannot form a route path to send the quantum key to be sent to the receiving node, the preset time point is updated, and the updated preset time point is earlier than the original preset time point. Based on the updated preset time point, the generation time information, and the corresponding key length, alternative links are reselected from the links of the QKD network.

3. The method according to claim 1, characterized in that, The generation time information is freshness, which represents the time period in which the available QKD key is generated. The lower the freshness, the later the corresponding time period. The step of selecting candidate links from the links of the QKD network based on the generation time information and the corresponding key length includes: Determine the freshness threshold; Based on the freshness and the corresponding key length, candidate links are selected from the links of the QKD network. The key length of the available QKD keys on the candidate links with a freshness not greater than the freshness threshold is not less than the key length of the quantum key to be sent. When the alternative links cannot form a route path to send the quantum key to be sent to the receiving node, the freshness threshold is updated, and the updated freshness threshold is greater than the original freshness threshold. Based on the updated freshness threshold, the generation time information, and the corresponding key length, alternative links are reselected from the links of the QKD network.

4. The method according to claim 1, characterized in that, The step of generating a target routing path for sending the quantum key to be sent to the receiving node based on the adjacency relationship and the alternative links includes: Based on the adjacency relationship and the alternative links, multiple routing paths are generated to send the quantum key to be sent to the receiving node; Select one of the multiple routing paths as the target routing path.

5. The method according to claim 4, characterized in that, Selecting one routing path from the plurality of routing paths as the target routing path includes: Randomly select one routing path from the multiple routing paths as the target routing path; Alternatively, based on the shortest path first routing strategy, one routing path can be selected from the multiple routing paths as the target routing path.

6. The method according to claim 1, characterized in that, Obtain the generation time information and corresponding key length of available QKD keys on links in the QKD network, including: Send an acquisition request to the QKD node in the QKD network; The system receives link status information from QKD nodes in the QKD network in response to the acquisition request. The link status information includes the generation time information and key length of available QKD keys on the links between the QKD node and its neighboring QKD nodes.

7. A routing path generation device, characterized in that, include: The determination module is used to determine the key length of the quantum key to be sent and the receiving node; The acquisition module is used to acquire the adjacency relationship of QKD nodes in the quantum key distribution (QKD) network, the generation time information of available QKD keys on the link, and the corresponding key length. The selection module is used to select candidate links from the links of the QKD network according to the generation time information and the corresponding key length, wherein the key length of the available QKD key generated on the candidate link after a preset time point is not less than the key length of the quantum key to be sent. The generation module is used to generate a target routing path for sending the quantum key to be sent to the receiving node based on the adjacency relationship and the alternative links.

8. A routing path generation device, characterized in that, include: The neighbor management module is used to maintain a neighbor table, which represents the adjacency relationships between QKD nodes in the quantum key distribution (QKD) network. The link state management module is used to maintain the link state information of QKD nodes in the QKD network. The link state information includes the generation time information and key length of available QKD keys on the links between QKD nodes and adjacent QKD nodes. A routing management module is used to generate a routing table according to a routing path generation method as described in any one of claims 1-6.

9. An electronic device, characterized in that, include: processor; as well as Memory for storing the executable instructions of the processor; The processor is configured to execute the routing path generation method according to any one of claims 1 to 6 by executing the executable instructions.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the routing path generation method according to any one of claims 1 to 6.

11. A computer program product, characterized in that, The computer program product includes a computer program or computer instructions, which are loaded and executed by a processor to enable the computer to implement the routing path generation method according to any one of claims 1 to 6.

Images