A path selection method for heterogeneous quantum networks

By calculating the evaluation coefficient α and correcting the link length in a heterogeneous quantum network, the path selection is optimized, solving the problem of the link transmission efficiency mismatch between CV-QKD and DV-QKD, and realizing more efficient quantum key transmission.

CN118764195BActive Publication Date: 2024-11-22YIXUNTONG TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411218388.2
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-09-02
Publication Date
2024-11-22
Estimated Expiration
2044-09-02

AI Technical Summary

Technical Problem

In existing technologies, the shortest communication link may have lower efficiency in quantum key transmission, especially in heterogeneous quantum networks, where the mismatch in transmission efficiency between CV-QKD and DV-QKD links leads to overall low efficiency.

Method used

By calculating the total and average lengths of CV-QKD and DV-QKD links in the path, and combining this with the amount of data to be encrypted, an evaluation coefficient α is determined. When selecting a path, the path with the smallest evaluation coefficient is prioritized, and the length of the longest link is adjusted to improve transmission efficiency.

Benefits of technology

This improves the transmission efficiency of quantum keys, ensures that path selection meets data volume requirements and takes into account the transmission characteristics of the link, thereby enhancing overall communication efficiency and security.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118764195B_ABST
    Figure CN118764195B_ABST
Patent Text Reader

Abstract

The present invention relates to the field of quantum communication technology, and more specifically, to a path selection method for a heterogeneous quantum network. The method includes: obtaining the amount of data to be encrypted, the network address of the recipient of the data to be encrypted, and the network address of the discloser of the data to be encrypted; determining the QKD node closest to the discloser's network address as the first node, and determining the QKD node closest to the recipient's network address as the second node; determining the path with the least number of relay points between the first node and the second node as the target path; obtaining the average length of all CV-QKD links in each target path and the total length of all CV-QKD links; obtaining the average length of all DV-QKD links in each target path and the total length of all DV-QKD links; calculating the evaluation coefficient; and transmitting the quantum key through the target path with the smallest evaluation coefficient. The present invention is used to evaluate and select the optimal path in a quantum communication network.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of quantum communication technology. More specifically, the present invention relates to a path selection method for a heterogeneous quantum network. Background Art

[0002] The two mainstream technical routes of quantum key distribution networks are currently discrete variable-based quantum key distribution technology (DV-QKD) and continuous variable-based quantum key distribution technology (CV-QKD).

[0003] Quantum secure communication is a secure communication technology formed by combining QKD with other cryptographic technologies. As a typical application of quantum communication, QKD realizes key generation and distribution by transmitting quantum states. When the communicating parties distribute keys through QKD, any theft behavior will be discovered in time due to the disturbance of quantum states. The basic QKD system usually consists of a pair of QKD modules connected by quantum channels and classical channels, thereby providing contribution keys for the application sender and receiver on the point-to-point link. Through QKD networking technology, the point-to-point QKD system can be expanded to a multi-user QKDN, thereby providing quantum key generation and distribution functions for any two or more users connected to the network. For example: The Chinese patent application document with publication number CN111934867A discloses a secure networking structure and method of a quantum communication network. The method uses VLAN and virtual firewall to ensure the security of the process of mutual authentication and establishment of classical links between the local quantum key distribution (generation) layer and the peer quantum key distribution (generation) layer, thereby achieving the interconnection of classical paths between networks and ensuring security protection and isolation between networks.

[0004] However, with the development of QKD networking technology, the larger the coverage of the QKD network, the more QKD links are included in a QKD network (QKD links include CV-QKD links or DV-QKD links). The existing technology usually selects the communication link with the shortest total distance between two nodes for quantum key transmission, but because DV-QKD has the characteristics of low key coding rate and long transmission distance, and CV-QKD has the characteristics of high key coding rate and short transmission distance, the communication link with the shortest distance may have a lower efficiency in quantum key transmission. Summary of the invention

[0005] The present invention provides a path selection method for a heterogeneous quantum network, aiming to solve the problem in the related art that the communication link with the shortest distance may have low efficiency in quantum key transmission.

[0006] In the first aspect, the present invention provides a path selection method for a heterogeneous quantum network. The method includes: obtaining a quantum network, wherein the quantum network includes a predetermined number of relay nodes, CV-QKD nodes, DV-QKD nodes, CV-QKD links, and CV-QKD links; obtaining the amount of data to be encrypted, the network address of the recipient of the data to be encrypted, and the network address of the discloser of the data to be encrypted; determining the QKD node closest to the discloser network address as the first node, and determining the QKD node closest to the recipient network address as the second node, wherein any of the QKD nodes is a CV-QKD node or a DV-QKD node; determining the path with the least number of relay points between the first node and the second node as the target path, and the number of the target paths is a plural number; obtaining the total length Y1 of all CV-QKD links in each target path; obtaining the total length Y2 of all DV-QKD links in each target path; calculating the evaluation coefficient of each target path according to the total length Y1 of the CV-QKD link and the total length Y2 of the DV-QKD link in each target path. α : α =exp[-( η Y1+Y2)], where η is the weight coefficient, exp is the exponential function with the natural base e as the base, , m is the data volume threshold, M is the amount of data to be encrypted, norm is a normalized function; the quantum key is transmitted through the target path with the smallest evaluation coefficient.

[0007] The beneficial effects of the present invention are:

[0008] The present invention obtains two QKD nodes through the network address of the key receiver and the network address of the discloser (sender), and calculates the evaluation coefficient of the path through the amount of data to be encrypted, the total length and average length of the CV-QKD link in the path with a smaller number of relay nodes, and the total length and average length of the DV-QKD link in the path with a smaller number of relay nodes, and then selects the most suitable path, so that the QKD links in the selected path (which include a certain number of CV-QKD links and a certain number of DV-QKD links) are more suitable for the data to be transmitted, thereby improving the transmission efficiency.

[0009] Preferably, the empirical value of the data volume threshold is 1000 bits.

[0010] Preferably, determining the QKD node closest to the network address of the disclosing party as the first node includes: obtaining the first physical location of the disclosing party through the network address of the disclosing party; obtaining the second physical location of the key distribution device corresponding to each QKD node through the network position of the QKD node; obtaining the first target distance between the first physical location and the second physical location, and determining the QKD node corresponding to the smallest first target distance as the first node.

[0011] Preferably, determining the QKD node closest to the network address of the receiver as the second node includes: obtaining the third physical location of the receiver through the network address of the receiver; obtaining the fourth physical location of the key distribution device corresponding to each QKD node through the network position of the QKD node; obtaining the first target distance between the first physical location and the second physical location, and determining the QKD node corresponding to the smallest first target distance as the first node.

[0012] Preferably, a path selection method for a heterogeneous quantum network further includes correcting the evaluation coefficient by the length of the longest CV-QKD link and the length of the longest DV-QKD link in each target path: ,in is the corrected evaluation coefficient, x 1 is the length of the longest CV-QKD link, x 2 is the length of the longest DV-QKD link, x A1 is the CV-QKD link length threshold, x A2 is the DV-QKD link length threshold.

[0013] Since the transmission efficiency of a single link is too low will affect the transmission efficiency of the entire path, the present invention corrects the evaluation coefficient by the length of the longest CV-QKD link and the length of the longest DV-QKD link in each path, so that the corrected evaluation coefficient can better reflect the key transmission efficiency of the corresponding path.

[0014] Preferably, obtaining the CV-QKD link length threshold comprises: obtaining the key decoding rate of the CV-QKD device corresponding to the CV-QKD node in communication links of different lengths, and constructing a first relationship curve between the key decoding rate of the CV-QKD device and the communication link length; wherein the horizontal axis of the coordinate system corresponding to the first relationship curve is the communication link length, and the vertical axis of the coordinate system is the key decoding rate of the CV-QKD device; obtaining the communication link length corresponding to the point in the first curve where the slope is less than -1, and recording the communication link length as the CV-QKD link length threshold.

[0015] The transmission efficiency of the CV-QKD link will decrease as the communication link increases. The present invention sets a threshold value for the length of the CV-QKD link at the point where the transmission efficiency of the CV-QKD link is about to decrease too much due to the length of the communication link being too long (i.e., the slope of the curve is equal to -1). Based on this, by comparing the actual length of the CV-QKD link with the threshold, the performance of the communication efficiency of quantum communication can be determined.

[0016] Preferably, obtaining the DV-QKD link length threshold comprises: obtaining the key decoding rate of the DV-QKD device corresponding to the DV-QKD node in communication links of different lengths, and constructing a second relationship curve between the key decoding rate of the DV-QKD device and the communication link length; wherein the horizontal axis of the coordinate system corresponding to the second relationship curve is the communication link length, and the vertical axis of the coordinate system is the key decoding rate of the DV-QKD device; obtaining the communication link length corresponding to the point in the second curve where the slope is less than -1, and recording the communication link length as the DV-QKD link length threshold.

[0017] The transmission efficiency of the DV-QKD link will decrease as the communication link increases. The present invention sets a threshold for the length of the DV-QKD link at the point where the transmission efficiency of the DV-QKD link is about to decrease too much due to the length of the communication link being too long (i.e., the slope of the curve is equal to -1). Based on this, by comparing the actual length of the DV-QKD link with the threshold, the performance of the communication efficiency of quantum communication can be determined.

[0018] In the second aspect, the present invention provides an application layer, which is used to receive and encrypt services; a key layer, which includes a predetermined number of QKD devices and a predetermined number of relay nodes, the QKD devices include CV-QKD devices and DV-QKD devices, and the QKD devices and the relay nodes constitute a QKDN network; a key management layer, including a processor and a memory, the memory stores a computer program, and the processor executes the computer program to implement a path selection method for a heterogeneous quantum network described in the above invention content.

[0019] The beneficial effects of the present invention are:

[0020] The present invention obtains two QKD nodes through the network addresses of the receiver and the sender, and evaluates and selects the optimal path based on the total length and average length of the CV-QKD and DV-QKD links under the conditions of the amount of encrypted data and a small number of relay nodes. Furthermore, considering that the transmission efficiency of a single link may affect the overall transmission efficiency, the present invention also corrects the evaluation coefficient by the length of the longest CV-QKD and DV-QKD links in each path to ensure that the selected path key transmission security and efficiency are higher. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] By reading the following detailed description with reference to the accompanying drawings, the above and other objects, features and advantages of the exemplary embodiments of the present invention will become readily understood. In the accompanying drawings, several embodiments of the present invention are shown in an exemplary and non-limiting manner, and the same or corresponding reference numerals represent the same or corresponding parts, wherein:

[0022] Figure 1 is a flowchart schematically illustrating a method for selecting a path in a heterogeneous quantum network according to this embodiment;

[0023] Figure 2 is a diagram schematically showing a structure of a quantum network according to this embodiment;

[0024] Figure 3 is a schematic diagram including a first relationship curve and a second relationship curve according to the present embodiment;

[0025] Figure 4 Schematically shows a logic diagram of a path selection system of a heterogeneous quantum network according to this embodiment. DETAILED DESCRIPTION

[0026] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0027] The specific embodiments of the present invention are described in detail below with reference to the accompanying drawings.

[0028] Figure 1 Schematically shows a flowchart of the steps of a path selection method for a heterogeneous quantum network according to this embodiment.

[0029] like Figure 1 As shown, a path selection method for a heterogeneous quantum network includes steps S1 to S6.

[0030] Step S1: Obtain a quantum network, wherein the quantum network includes a predetermined number of relay nodes, CV-QKD nodes, DV-QKD nodes, CV-QKD links, and CV-QKD links.

[0031] like Figure 2As shown, in one embodiment, the quantum network includes relay nodes and QKD nodes, and each QKD node corresponds to a QKD distribution device. Among them, T1 node, T2 node, T3 node, T4 node and T5 node are all relay nodes; Q1 node, Q2 node, Q3 node, Q4 node, Q5 node, Q6 node, Q7 node, Q8 node, Q9 node, Q10 node, Q11 node and Q12 node are all QKD nodes. Any QKD node is a CV-QKD node or a DV-QKD node.

[0032] There are multiple paths between any two QKD nodes, and there are one or more communication links between each path. The CV-QKD node is connected to the relay node via a CV-QKD link, and the DV-QKD node is connected to the relay node via a DV-QKD link.

[0033] Step S2: Obtain the amount of data to be encrypted, the network address of the recipient of the data to be encrypted, and the network address of the discloser of the data to be encrypted.

[0034] In one embodiment, business data corresponding to the data to be encrypted is obtained through a database, and then the amount of data to be encrypted, the network address of the recipient of the data to be encrypted, and the network address of the discloser of the data to be encrypted are obtained.

[0035] Step S3: Determine the QKD node closest to the network address of the disclosing party as the first node, and determine the QKD node closest to the network address of the receiving party as the second node.

[0036] Among them, any QKD node is a CV-QKD node or a DV-QKD node. In one embodiment, the first physical location of the disclosing party is obtained through the network address of the disclosing party; the second physical location of the key distribution device corresponding to each QKD node is obtained through the network location of the QKD node; the first target distance between the first physical location and the second physical location is obtained, and the QKD node corresponding to the minimum first target distance is determined to be the first node. The third physical location of the receiving party is obtained through the network address of the receiving party; the fourth physical location of the key distribution device corresponding to each QKD node is obtained through the network location of the QKD node; the first target distance between the first physical location and the second physical location is obtained, and the QKD node corresponding to the minimum first target distance is determined to be the first node.

[0037] Step S4: Determine the path with the least number of relay points between the first node and the second node as the target path; obtain the total length Y1 of all CV-QKD links in each target path; obtain the total length Y2 of all DV-QKD links in each target path.

[0038] It should be noted that in a quantum communication network, the relay node must be a trusted node, so each relay node is a potential attack target and may be used by malicious attackers to steal or tamper with the transmitted quantum information. Furthermore, each relay node will introduce additional transmission delays, especially in quantum communication, it is very important to maintain the speed and time accuracy of transmission. Therefore, by reducing the number of relay nodes, the transmission delay of the signal can be minimized, and the efficiency and real-time performance of communication can be improved. Based on this, the present invention takes the path with the least relay nodes as the target path. Since the number of target paths may be plural, an optimal path is selected from the target path to transmit the quantum key in the subsequent process.

[0039] Step S5: Calculate the evaluation coefficient of each target path according to the total length Y1 of the CV-QKD link and the total length Y2 of the DV-QKD link in each target path α .

[0040] Among them, the formula for calculating the evaluation coefficient is: α =exp[-( η Y1+Y2)], η is the weight coefficient, exp is the exponential function with the natural base e as the base, , m is the data volume threshold, M is the amount of data to be encrypted, norm is the normalization function. Data volume threshold m The empirical value is 1000 bits.

[0041] Furthermore, since the key encoding rate of the DV-QKD device is low but its transmission distance is long, and the key encoding rate of the CV-QKD device is high but its transmission distance is short, when the amount of data to be encrypted is large, the quantum key distribution device corresponding to the QKD node needs to generate a large amount of keys (usually the number of bytes of the amount of data to be encrypted is equal to the number of bytes of the key), and when the amount of data to be encrypted is small, the key distribution device corresponding to the QKD node needs to generate a small amount of keys. Therefore, when the amount of data to be encrypted is large (that is, it is greater than the data volume threshold m ), it is more suitable for CV-QKD devices with high coding rates to transmit keys through CV-QKD links; when the amount of data to be encrypted is small (that is, it is less than the data volume threshold m ), it is more suitable for DV-QKD devices with low coding rates to transmit keys through DV-QKD links.

[0042] Based on this, the present invention α =exp[-( ηY1+Y1)], so that when the amount of data to be encrypted is small, the weight coefficient is greater than 1. At this time, compared with the total length of the DV-QKD link, the total length of the CV-QKD link of the same size causes the evaluation coefficient to drop more. Since the target path with the smallest evaluation coefficient will be selected to transmit the quantum key later, the path selected later will be more inclined to the path with a longer total length of the CV-QKD link and a longer total length of the DV-QKD link. Similarly, when the amount of data to be encrypted is large, the weight coefficient η Less than 1, at this time, compared with the total length of the CV-QKD link, the total length of the DV-QKD link of the same size causes a greater decrease in the evaluation coefficient. Since the target path with the smallest evaluation coefficient will be selected to transmit the quantum key later, the path selected later will be more inclined to the path with a longer total length of the DV-QKD link and a longer total length of the CV-QKD link.

[0043] Step S6: Deliver the quantum key via the target path with the smallest evaluation coefficient.

[0044] Among them, the evaluation coefficient α The larger the evaluation coefficient is, the greater the efficiency and performance of key transmission in the path corresponding to the evaluation coefficient is. Therefore, the quantum key is transmitted through the target path with the smallest evaluation coefficient.

[0045] Furthermore, the present invention also includes correcting the evaluation coefficient by the length of the longest CV-QKD link and the length of the longest DV-QKD link in each target path:

[0046] ,in is the corrected evaluation coefficient, x 1 is the length of the longest CV-QKD link, x 2 is the length of the longest DV-QKD link, x A1 is the CV-QKD link length threshold, x A2 is the DV-QKD link length threshold. The quantum key is transmitted via the target path with the smallest modified evaluation coefficient.

[0047] Wherein, obtaining the CV-QKD link length threshold comprises: obtaining the key decoding rate of the CV-QKD device corresponding to the CV-QKD node in the communication link of different lengths, and constructing a first relationship curve between the key decoding rate of the CV-QKD device and the communication link length; wherein the horizontal axis of the coordinate system corresponding to the first relationship curve is the communication link length, and the vertical axis of the coordinate system is the key decoding rate of the CV-QKD device; obtaining the communication link length corresponding to the point with a slope less than -1 in the first curve, and recording the communication link length as the CV-QKD link length threshold.

[0048] Furthermore, obtaining the DV-QKD link length threshold includes: obtaining the key decoding rate of the DV-QKD device corresponding to the DV-QKD node in communication links of different lengths, and constructing a second relationship curve between the key decoding rate of the DV-QKD device and the communication link length; wherein the horizontal axis of the coordinate system corresponding to the second relationship curve is the communication link length, and the vertical axis of the coordinate system is the key decoding rate of the DV-QKD device; obtaining the communication link length corresponding to the point in the second curve where the slope is less than -1, and recording the communication link length as the DV-QKD link length threshold.

[0049] In one embodiment, the first relationship curve and the second relationship curve are as follows: Figure 3 shown. l 1 is the first relationship curve, l 2 is the second relationship curve. The first relationship curve l 1 and the second relationship curve l 2 are located in the same coordinate system, the horizontal axis of which is the length of the communication link, that is, the transmission distance of the quantum key, and the vertical axis of which is the key decoding rate, that is, the amount of keys generated per unit time by the quantum key distribution device corresponding to the QKD node. The first relationship curve l The horizontal coordinate of the point where the slope of 1 is -1 is the CV-QKD link length threshold; the second relationship curve l The abscissa of the point where the slope of 2 is -1 is the DV-QKD link length threshold.

[0050] It should be noted that when the length of the longest CV-QKD link is greater than the CV-QKD link length threshold, the key decoding rate of the CV-QKD device corresponding to the CV-QKD link is low; similarly, when the length of the longest DV-QKD link is greater than the DV-QKD link length threshold, the key decoding rate of the DV-QKD device corresponding to the DV-QKD link is low. In a path of a quantum communication network, if the key encoding rate of the QKD device (the QKD device is a CV-QKD device or a DV-QKD device) in one of the quantum communication links is low, that is, the efficiency of key generation is low, the key transmission efficiency of the entire path will be reduced. Based on this, the length of the longest CV-QKD link will be x 1 and the length of the longest DV-QKD link x 2. Correction of the evaluation coefficient: the length of the longest CV-QKD link x 1 is less than the CV-QKD link length threshold, which increases the evaluation coefficient and the length of the longest CV-QKD link x 1 is greater than the CV-QKD link length threshold, which reduces the evaluation coefficient; similarly, the length of the longest DV-QKD link x2 is less than the DV-QKD link length threshold, which increases the evaluation coefficient and the length of the longest DV-QKD link x 2 is greater than the DV-QKD link length threshold, which reduces the evaluation coefficient.

[0051] Figure 4 Schematically illustrates a logic diagram of a path selection system for a heterogeneous quantum network according to an embodiment of the present invention.

[0052] like Figure 4 As shown, a path selection system for a heterogeneous quantum network includes: an application layer, a key management layer, and a key layer. The application layer is used to receive and encrypt services; the key layer includes a predetermined number of QKD devices and a predetermined number of relay nodes, the QKD devices include CV-QKD devices and DV-QKD devices, and the QKD devices and the relay nodes form a QKDN network; the key management layer processor and memory, the memory stores a computer program.

[0053] In the description of this specification, "plurality" or "several" means at least two, such as two, three or more, etc., unless otherwise clearly and specifically defined.

[0054] The technical features of the above-described embodiments may be arbitrarily combined. To make the description concise, not all possible combinations of the technical features in the above-described embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0055] The above-mentioned embodiments only express several implementation methods of the present invention, and the description is relatively specific and detailed, but it cannot be understood as limiting the scope of the patent application. It should be pointed out that for ordinary technicians in this field, several modifications and improvements can be made without departing from the concept of the present invention, which all belong to the protection scope of the present invention.

Claims

1. A path selection method for a heterogeneous quantum network, characterized in that: include: Obtaining a quantum network, wherein the quantum network includes a predetermined number of relay nodes, CV-QKD nodes, DV-QKD nodes, CV-QKD links, and CV-QKD links; Obtaining the amount of data to be encrypted, the network address of a recipient of the data to be encrypted, and the network address of a discloser of the data to be encrypted; determining the QKD node closest to the discloser's network address as a first node, and determining the QKD node closest to the recipient's network address as a second node, wherein any of the QKD nodes is a CV-QKD node or a DV-QKD node; Determine a path between the first node and the second node having the least number of relay points as a target path, where the number of the target paths is plural; Obtain the total length Y1 of all CV-QKD links in each target path; obtain the total length Y2 of all DV-QKD links in each target path; The evaluation coefficient of each target path is calculated based on the total length Y1 of the CV-QKD link and the total length Y2 of the DV-QKD link in each target path. α : α =exp[-( η Y1+Y2)], where η is the weight coefficient, exp is the exponential function with the natural base e as the base, , m is the data volume threshold, M is the amount of data to be encrypted, norm is a normalized function; the quantum key is transmitted through the target path with the smallest evaluation coefficient.

2. The path selection method for a heterogeneous quantum network according to claim 1, characterized in that: The empirical value of the data volume threshold is 1000 bits.

3. The path selection method for a heterogeneous quantum network according to claim 1, characterized in that: Determining the QKD node closest to the network address of the disclosing party as the first node includes: Obtaining a first physical location of the disclosing party through the network address of the disclosing party; Obtaining a second physical location of a key distribution device corresponding to each QKD node through the network location of the QKD node; A first target distance between the first physical location and the second physical location is obtained, and a QKD node corresponding to the minimum first target distance is determined as the first node.

4. The path selection method for a heterogeneous quantum network according to claim 1, characterized in that: Determining the QKD node closest to the recipient's network address as the second node includes: Obtaining a third physical location of the recipient through the recipient's network address; Obtaining a fourth physical location of a key distribution device corresponding to each QKD node through the network location of the QKD node; A first target distance between the first physical location and the second physical location is obtained, and a QKD node corresponding to the minimum first target distance is determined as the first node.

5. The path selection method for a heterogeneous quantum network according to claim 1, characterized in that: It also includes correcting the evaluation coefficient by the length of the longest CV-QKD link and the length of the longest DV-QKD link in each target path: ,in is the modified evaluation coefficient, x 1 is the length of the longest CV-QKD link, x 2 is the length of the longest DV-QKD link, x A1 is the CV-QKD link length threshold, x A2 is the DV-QKD link length threshold.

6. The path selection method for a heterogeneous quantum network according to claim 5, characterized in that: Obtaining the CV-QKD link length threshold includes: Obtaining key decoding rates of a CV-QKD device corresponding to the CV-QKD node over communication links of different lengths, and constructing a first relationship curve between the key decoding rate of the CV-QKD device and the communication link length; wherein the horizontal axis of a coordinate system corresponding to the first relationship curve represents the communication link length, and the vertical axis of the coordinate system represents the key decoding rate of the CV-QKD device; Obtain the communication link length corresponding to the point in the first curve where the slope is less than -1, and record the communication link length as the CV-QKD link length threshold.

7. The path selection method for a heterogeneous quantum network according to claim 5, characterized in that: Obtaining the DV-QKD link length threshold includes: Obtaining a key decoding rate of a DV-QKD device corresponding to the DV-QKD node in communication links of different lengths, and constructing a second relationship curve between the key decoding rate of the DV-QKD device and the communication link length; wherein the horizontal axis of the coordinate system corresponding to the second relationship curve is the communication link length, and the vertical axis of the coordinate system is the key decoding rate of the DV-QKD device; Obtain the communication link length corresponding to the point where the slope of the second curve is less than -1, and record the communication link length as the DV-QKD link length threshold.

8. A heterogeneous quantum network path selection system, characterized in that: include: The application layer is used to receive and encrypt services; A key layer comprising a predetermined number of QKD devices and a predetermined number of relay nodes, wherein the QKD devices include CV-QKD devices and DV-QKD devices, and the QKD devices and the relay nodes constitute a QKDN network; A key management layer, comprising a processor and a memory, wherein the memory stores a computer program, and the processor executes the computer program to implement a path selection method for a heterogeneous quantum network as described in any one of claims 1 to 7.