Key Distribution Method Based on Quantum Key Distribution Network and Asymmetric Cryptography

Abstract

The present invention discloses a key distribution method based on quantum key distribution and asymmetric cryptography. There are several distribution terminals, and there is at least 1 trusted relay between different distribution terminals. The method includes the following steps: S1, the distribution terminal generates a public key based on asymmetric cryptography and sends it to the corresponding trusted relay under the protection of the quantum key; S2, the trusted relay generates a communication key based on the public key and sends the communication key to the corresponding trusted relay or distribution terminal under the protection of the quantum key; S3, after receiving the communication key, the distribution terminal calculates the distribution key respectively; S4, the distribution terminal and the trusted relay generate distribution auxiliary keys based on asymmetric cryptography respectively; S5, the distribution terminal uses the distribution auxiliary key to complete the subsequent distribution of the distribution key confidentially. The method proposed by the present invention saves the quantum keys consumed by each node in the quantum key distribution network during the communication process and stabilizes the key conversion rate at 50%.

Description

Technical Field

[0001] The present invention relates to the field of quantum key distribution, and in particular to a key distribution method based on a quantum key distribution network and asymmetric cryptography. Background Art

[0002] Quantum key distribution (QKD) uses the properties of quantum mechanics to ensure communication security. It enables both parties in communication to generate and share a random, secure key to encrypt and decrypt messages.

[0003] One of the most important and unique properties of quantum key distribution is that if a third party tries to eavesdrop on the password, both parties in the communication will notice it. This property is based on the basic principle of quantum mechanics: any measurement of a quantum system will interfere with the system. If a third party tries to eavesdrop on the password, it must measure it in some way, and these measurements will cause detectable anomalies. By transmitting information through quantum superposition or quantum entanglement, the communication system can detect whether there is eavesdropping. When the eavesdropping is below a certain standard, a secure key can be generated.

[0004] Quantum key distribution is used to generate and distribute keys, which can be used in various encryption algorithms to encrypt information and realize communication between nodes in the quantum key distribution network.

[0005] In the prior art, the use of trusted relays is a practical solution to long-distance quantum key distribution. Assuming that it is necessary to distribute quantum keys between communication nodes A and B that are far apart, a relay node 1 can be set between communication nodes A and B to form a serial link; each adjacent node performs quantum key distribution on each other and obtains relay keys, which are recorded as K A1 and K B1 , the session key K is between node A and K A1 XOR operation to get Then it is transmitted through the network to reach relay node 1. At relay node 1, the key K is first used A1 Decrypt the session key K, and then compare the session key K with the key K B1 XOR operation is performed to obtain It is then transmitted through the network to node B, where node B deciphers the session key K, ultimately enabling the sharing of the session key K between communication nodes A and B.

[0006] The prior art has the following defects:

[0007] The quantum key distribution terminal needs to generate a quantum key K shared by both parties and needs to consume the segmented quantum key related to the relay node.

[0008] When there are n relay nodes between quantum key distribution terminals A and B, (n + 1) pairs of QKD keys are consumed to generate 1 pair of distribution key K. The key conversion rate is The larger n is, the lower the key conversion rate. For example, when n = 19, the key conversion rate is Summary of the Invention

[0009] Aiming at the problems in the prior art, the present invention proposes a key distribution method based on a quantum key distribution network and asymmetric cryptography to overcome the above-mentioned technical problems existing in the related prior art.

[0010] For this purpose, the specific technical solution adopted by the present invention is as follows:

[0011] A key distribution method based on quantum key distribution and asymmetric cryptography, with a number of nodes, the nodes include at least 2 distribution terminals and trusted relays, and there are N trusted relays between different distribution terminals, where N is not less than 1, including the following steps:

[0012] S1. A number of distribution terminals respectively generate random numbers, and generate public keys based on asymmetric cryptography with the random numbers as private keys and send them to the corresponding trusted relays under the protection of quantum keys;

[0013] S2. The trusted relay generates a communication key based on asymmetric cryptography using the key received from the previous node and sends the communication key to the next node under the protection of quantum keys;

[0014] S3. Repeat step S2 until the distribution terminals respectively receive the communication keys, and then the distribution terminals respectively calculate to obtain the initial distribution keys;

[0015] S4. The distribution terminals and the N trusted relays respectively generate N types of distribution auxiliary key pairs based on asymmetric cryptography; the distribution auxiliary keys are used for the distribution terminals to complete the key distribution with another distribution terminal through the corresponding trusted relays;

[0016] S5. The distribution terminals use the distribution auxiliary keys to keep secrets and complete the subsequent distribution of the distribution keys.

[0017] Preferably, there are two distribution terminals, and S1 includes the following steps: The first distribution terminal generates a first true random number, generates a first public key based on asymmetric cryptography with the first true random number as the first private key and sends it to the corresponding trusted relay under the protection of quantum keys; the second distribution terminal generates a second true random number, generates a second public key based on asymmetric cryptography with the second true random number as the second private key and sends it to the corresponding trusted relay under the protection of quantum keys;

[0018] Optionally, when there is 1 trusted relay, the corresponding trusted relay is the first trusted relay;

[0019] S2 includes the following steps: The first trusted relay generates a first communication key based on the first public key, generates a second communication key based on the second public key, and sends the first communication key to the second distribution terminal under the protection of the quantum key, and sends the second communication key to the first distribution terminal under the protection of the quantum key;

[0020] S3 includes the following steps: The first distribution terminal calculates a first distribution key based on the second communication key using asymmetric cryptography, and the second distribution terminal calculates a first distribution key based on the first communication key using asymmetric cryptography;

[0021] S4 includes the following steps: The first distribution terminal generates a first type of distribution auxiliary key one based on the first private key and the second communication key, and the first trusted relay calculates the first type of distribution auxiliary key one using the first public key and the second public key; The second distribution terminal generates a first type of distribution auxiliary key two based on the second private key and the first communication key, and the first trusted relay calculates the first type of distribution auxiliary key two using the second public key and the first public key;

[0022] S5 includes the following steps: The first distribution terminal generates a second distribution key, encrypts the second distribution key using the first type of distribution auxiliary key one and sends it to the first trusted relay. After the first trusted relay decrypts it using the first type of distribution auxiliary key one, it encrypts it using the first type of distribution auxiliary key two and then sends it to the second distribution terminal.

[0023] Preferably, when there are 2 trusted relays, the corresponding trusted relay of the first distribution terminal is the first trusted relay, and the corresponding trusted relay of the second distribution terminal is the second trusted relay;

[0024] S2 includes the following steps: The first trusted relay generates a first communication key based on the first public key and sends the first communication key to the second trusted relay under the protection of the quantum key. The second trusted relay generates a third communication key based on the first communication key and sends it to the second distribution terminal; The second trusted relay generates a second communication key based on the second public key and sends the second communication key to the first trusted relay under the protection of the quantum key. The first trusted relay generates a fourth communication key based on the second communication key and sends it to the first distribution terminal;

[0025] S3 includes the following steps: The first distribution terminal calculates the first communication key, and calculates a first distribution key based on the first communication key and the fourth communication key using asymmetric cryptography. The second distribution terminal calculates the second communication key, and calculates a first distribution key based on the third communication key and the second communication key using asymmetric cryptography;

[0026] S4 includes the following steps. The first distribution terminal generates a first type of distribution auxiliary key based on the first private key and the fourth communication key, and the first trusted relay calculates the first type of distribution auxiliary key one using the first public key and the second communication key. The second distribution terminal generates a second type of distribution auxiliary key two based on the second private key and the third communication key, and the second trusted relay calculates the second type of distribution auxiliary key two using the second public key and the first communication key. The first type of distribution terminal generates a second type of distribution auxiliary key one based on the first public key and the fourth auxiliary key, and the first trusted relay calculates the second type of distribution auxiliary key one using the first communication key and the second communication key. The second type of distribution terminal generates a second type of distribution auxiliary key two based on the third communication key and the second public key, and the second trusted relay calculates the second type of distribution auxiliary key two using the second communication key and the first communication key.

[0027] S5 includes the following steps. The first distribution terminal generates a second distribution key, encrypts the second distribution key using the first type of distribution auxiliary key one and sends it to the first trusted relay. After the first trusted relay decrypts it using the first type of distribution auxiliary key one, it encrypts it using the first type of distribution auxiliary key two and then sends it to the second distribution terminal. The first distribution terminal generates a third distribution key, encrypts the third distribution key using the second type of distribution auxiliary key one and sends it to the second trusted relay. After the second trusted relay decrypts it using the second type of distribution auxiliary key one, it encrypts it using the second type of distribution auxiliary key two and then sends it to the second distribution terminal.

[0028] Optionally, the asymmetric cryptography can be elliptic curve cryptography.

[0029] Preferably, the asymmetric cryptography can also be the cryptography based on the Diffie-Hellman key exchange protocol and elliptic curve parameters.

[0030] Beneficial effects:

[0031] Save the quantum keys consumed by each node in the quantum key distribution network during the communication process, and stabilize the key conversion rate at 50% when the number of communication nodes is increased. Description of the drawings

[0032] Figure 1 It is a schematic diagram of Case 1 of Embodiment 1 of the present invention;

[0033] Figure 2 It is a schematic diagram of Case 2 of Embodiment 1 of the present invention;

[0034] Figure 3 It is a schematic diagram of Case 3 of Embodiment 1 of the present invention. Detailed implementation manners

[0035] The present invention will be further described below in conjunction with the accompanying drawings and specific embodiments. It should be understood, however, that the present invention can be implemented in various forms, and some exemplary and non-limiting embodiments presented in the accompanying drawings and described below are not intended to limit the present invention to the specific embodiments illustrated.

[0036] It should be understood that, where technically feasible, the technical features listed for different embodiments above can be combined with each other to form additional embodiments within the scope of the present invention. In addition, the specific examples and embodiments described in the present invention are non-limiting, and corresponding modifications can be made to the structures, steps, and sequences set forth above without departing from the scope of protection of the present invention.

[0037] Embodiment 1: DH Key Exchange Protocol

[0038] According to the Diffie-Hellman protocol, a large prime number p and a number g are defined, where g is a primitive root modulo p, and both g and p are parameters of the Diffie-Hellman protocol.

[0039] Case 1: There is 1 relay node between A and B

[0040] First-round key distribution: Generate distribution keys and auxiliary keys.

[0041] As Figure 1 shown, A and B are nodes in a quantum key distribution network, and there is 1 relay node R1 between A and B.

[0042] A generates a random number a, and B generates a random number b.

[0043] According to the elliptic curve parameters g, p, A generates a public key a1 = g a mod p using a as the private key and sends a1 to the relay node R1 under the protection of the QKD key in the quantum distribution network. B generates a public key b1 = g b mod p using b as the private key and sends b1 to the relay node R1 under the protection of the QKD key in the quantum distribution network. The relay node R1 generates a2 = g a1 mod p and sends a2 to B under the protection of the QKD key in the quantum distribution network. The relay node R1 generates b2 = g b1 mod p and sends b2 to A under the protection of the QKD key in the quantum distribution network. A total of 2 * 2 pairs of quantum keys are used in the whole process.

[0044] After A receives b2, it calculates the distribution key K A-B = b2 a1 mod p. After B receives a2, it calculates the distribution key K B-A = a2 b1mod p. Since K A-B = b2 a1 mod p = (g b1 mod p) a1 mod p = g a1*b1 mod p = (g a1 mod p) b1 mod p = a2 b1 mod p = K B-A , that is, K A-B = K B-A .

[0045] The first - type distribution auxiliary key is a key that can replace a pair of QKD keys.

[0046] The first - type distribution auxiliary key generated by A is K A-R1 = b2 a mod p; the first - type distribution auxiliary key generated by R1 is K R1-A = a1 b1 mod p; as known from the above, K A-R1 = b2 a mod p = (g b1 mod p) a mod p = g a*b1 mod p = (g a mod p) b1 mod p = a1 b1 mod p = K R1-A , that is, K A-R1 = K R1-A .

[0047] The first - type distribution auxiliary key generated by B is K B-R1 = a2 b mod p; the first - type distribution auxiliary key generated by R1 is K R1-B = b1 a1 mod p; as known from the above, K B-R1 = a2 b mod p = (g a1 mod p) b mod p = g a1*b mod p = (g b mod p) a1 mod p = b1 a1 mod p = K R1-B , that is, K B-R1 = K R1-B .

[0048] For the second - round key distribution, the distribution auxiliary key is used.

[0049] Party A generates the distribution key K1 and uses K A-R1 to send it confidentially to R1. R1 uses K R1-A After decryption, use K B-R1 to send it confidentially to B. B uses K R1-B After decryption, obtain the distribution key K1.

[0050] In summary, as shown in the following table, in this case, in the first round, 2 * 2 pairs of QKD keys are consumed, and in the second round, no QKD keys are consumed; in the first round, 1 pair of distribution keys, namely K A-B / K B-A is generated, and in the second round, 1 pair of distribution keys, namely K1, is generated.

[0051] The first round The second round Total Consume QKD key pairs 2*2 0 4 Generate and distribute key pairs 1 1 2

[0052] That is, the key conversion rate is

[0053] Case 2: There are 2 relay nodes between A and B

[0054] First-round key distribution: Generate the distribution key and the distribution auxiliary key.

[0055] As Figure 2 shown, A and B are nodes in the quantum key distribution network, and there are 2 relay nodes R1 and R2 between A and B.

[0056] A generates a random number a, and B generates a random number b.

[0057] Similar to the above, 3 * 2 pairs of quantum keys are used, and through the nodes R1 and R2 in the quantum key distribution network, A receives b3 and B receives a3.

[0058] After A receives b3, calculate a2 = g a1 mod p, and calculate the distribution key K A-B = b3 a2 mod p; after B receives a3, calculate b2 = g b1 mod p, and calculate the distribution key K B-A = a3 b2 mod p. Since K A-B = b3 a2 mod p = (g b2 mod p) a2 mod p = g a2*b2 mod p = (g a2 mod p) b2 mod p = a3 b2 mod p = K B-A , that is, KA-B = K B-A 。

[0059] The first - type distribution auxiliary key is a key that can replace a pair of QKD keys.

[0060] The first - type distribution auxiliary key generated by A is K A-R1 = b3 a mod p; The first - type distribution auxiliary key generated by R1 is K R1-A = a1 b2 mod p; As can be seen from the above, K A-R1 = K R1-A 。

[0061] The first - type distribution auxiliary key generated by B is K B-R2 = a3 b mod p; The first - type distribution auxiliary key generated by R2 is K R2-B = b1 a2 mod p; As can be seen from the above, K B-R2 = K R2-B 。

[0062] The second - type distribution auxiliary key is a key that can replace a pair of QKD keys. That is, since there is one node R1 between A and R2, A and R2 need to consume 2 pairs of QKD keys to implement a pair of distribution key books. Now, using the second - type distribution auxiliary key between A and R2, namely K A-R2 / K R2-A can enable A and R2 to implement a pair of distribution keys.

[0063] The second - type distribution auxiliary key generated by A is K A-R2 = b3 a1 mod p; The second - type distribution auxiliary key generated by R1 is K R2-A = a2 b2 mod p; As can be seen from the above, K A-R2 = K R2-A 。

[0064] The second - type distribution auxiliary key generated by B is K B-R1 = a3 b1 mod p; The second - type distribution auxiliary key generated by R2 is K R1-B = b2 a2 mod p; As can be seen from the above, K B-R1 = K R1-B 。

[0065] For the second - round key distribution, use the distribution auxiliary key.

[0066] A generates the distribution key K1, using K A-R1Confidentially send to R1, and R1 uses K R1-A After decryption, use K B-R1 Confidentially send to B, and B uses K R1-B After decryption, obtain the distribution key K1;

[0067] A generates the distribution key K2 and uses K A-R2 Confidently send to R2, and R2 uses K R2-A After decryption, use K B-R2 Confidently send to B, and B uses K R2-B After decryption, obtain the distribution key K2.

[0068] In summary, as shown in the following table, in this embodiment, in the first round, 3*2 pairs of QKD key pairs are consumed, and in the second round, no QKD key pairs are consumed; in the first round, 1 pair of distribution key pairs is generated, namely K A-B / K B-A ; in the second round, 2 pairs of distribution key pairs are generated, namely K1 and K2.

[0069] The first round The second round Total Consume QKD key pairs 3*2 0 6 Generate and distribute key pairs 1 2 3

[0070] That is, the key conversion rate is

[0071] Case n: There are n relay nodes between A and B

[0072] The first-round key distribution: Generate the distribution key and the distribution auxiliary key.

[0073] As Figure 3 shown, A and B are nodes in the quantum key distribution network, and there are n relay nodes R1, R2,..., Rn between A and B.

[0074] A generates a random number a, and B generates a random number b.

[0075] Similar to the above, using (n + 1)*2 pairs of quantum keys, the following keys are generated:

[0076] The distribution key K is generated between A and B A-B = K B-A ;

[0077] The first type of distribution auxiliary key K is generated between A and R1 A-R1 = K R1-A ;

[0078] The second type of distribution auxiliary key K is generated between A and R2 A-R2 = K R2-A ;

[0079] ...;

[0080] The nth type of distribution auxiliary key K is generated between A and RnA-Rn = K Rn-A 。

[0081] Similarly, B and R1 to Rn generate the first to nth types of distribution auxiliary keys.

[0082] In the second round of key distribution, the distribution auxiliary keys are used.

[0083] A generates the distribution key K1, using K A-R1 Confidentially send it to R1, and R1 uses K R1-A After decryption, use K B-R1 Confidentially send it to B, and B uses K R1-B After decryption, obtain the distribution key K1;

[0084] A generates the distribution key K2, using K A-R2 Confidentially send it to R2, and R2 uses K R2-A After decryption, use K B-R2 Confidentially send it to B, and B uses K R2-B After decryption, obtain the distribution key K2;

[0085] ……;

[0086] A generates the distribution key Kn, using K A-Rn Confidently send it to Rn, and Rn uses K Rn-A After decryption, use K B-Rn Confidently send it to B, and B uses K Rn-B After decryption, obtain the distribution key Kn.

[0087] In summary, as shown in the following table, in this embodiment, in the first round, (n + 1) * 2 pairs of QKD key pairs are consumed, and in the second round, no QKD key pairs are consumed; in the first round, 1 pair of distribution key pairs is generated, that is, K A-B / K B-A , and in the second round, n pairs of distribution key pairs are generated, that is, K1 to Kn.

[0088] The first round The second round Total Consume QKD key pairs (n+1)*2 0 2(n+1) Generate and distribute key pairs 1 n n+1

[0089] That is, the key conversion rate is

[0090] Embodiment 2: ECC Cryptography

[0091] The process of this patent can be implemented using ECC cryptography.

[0092] Taking Case 1 as an example, A and B are nodes in a quantum key distribution network, and there is 1 relay node R1 between A and B. Select an elliptic curve E, and select the domain parameters of the elliptic curve including q, a, b, P, and n. q represents the size of the finite field Fq; the variables a and b are for the elliptic curve E: y 2 = x3 The coefficients of +ax + b, where 4a 3 + 27b 2 ≠ 0; P is the base point generator. After generating the elliptic curve, select the base point generator P such that its order is an integer n. Using a random number SK as the private key, multiplying it by the base point generator P gives another point on the curve, which is the corresponding public key PK, PK = SK * P.

[0093] The first round of key distribution: Generate the distribution key and the distribution auxiliary key.

[0094] A generates a random number a, and B generates a random number b. Using a as the private key and multiplying it by P gives a point on the elliptic curve, which is the public key (a1, a1y), i.e., (a1, a1y) = a * P. Similarly, (b1, b1y) = b * P, (a2, a2y) = a1 * P, etc.

[0095] Similar to the above, using a 2 * 2 quantum key, through node R1 in the quantum key distribution network, A receives b2||b2y, and B receives a2||a2y.

[0096] After A receives b2||b2y, calculate (a1, a1y) = a * P, recover the elliptic curve point, which is (b2, b2y), and calculate K A-B = a1 * (b2, b2y).

[0097] After B receives a2||a2y, calculate (b1, b1y) = b * P, recover the elliptic curve point, which is (a2, a2y), and calculate K B-A = b1 * (a2, a2y).

[0098] Since (b2, b2y) = b1 * P, K A-B = a1 * (b2, b2y) = a1 * b1 * P = b1 * a1 * P = b1 * (a2, a2y) = K B-A , that is, K A-B = K B-A .

[0099] A generates the first type of distribution auxiliary key as K A-R1 = a * (b2, b2y); R1 generates the first type of distribution auxiliary key as K R1-A = b1 * (a1, a1y); As known from the above, K A-R1 = a * (b2, b2y) = a * b1 * P = b1 * a * P = b1 * (a1, a1y) = K R1-A , that is, K A-R1 = K R1-A .

[0100] B generates the first type of distribution auxiliary key as K B-R1= b*(a2, a2y); R1 generates the first type of distribution auxiliary key as K R1-B = a1*(b1, b1y); As can be seen from the above, K B-R1 = b*(a2, a2y) = b*a1*P = a1*b*P = a1*(b1, b1y) = K R1-B , that is, K B-R1 = K R1-B .

[0101] In the second round of key distribution, the distribution auxiliary key is used.

[0102] A generates the distribution key K1, using K A-R1 Confidentially send it to R1, and R1 uses K R1-A After decryption, use K B-R1 Confidentially send it to B, and B uses K R1-B After decryption, obtain the distribution key K1.

[0103] In summary, as shown in the following table, in this embodiment, in the first round, 2 * 2 pairs of QKD key pairs are consumed, and in the second round, no QKD key pairs are consumed; in the first round, 1 pair of distribution key pairs is generated, that is, K A-B / K B-A , and in the second round, 1 pair of distribution key pairs is generated, that is, K1.

[0104] The first round The second round Total Consume QKD key pairs 2*2 0 4 Generate and distribute key pairs 1 1 2

[0105] That is, the key conversion rate is

[0106] The situation where there are n relay nodes between A and B is the same as that in Embodiment 1, and the key conversion rate is 50% in both cases.

[0107] The technical features of the above-described embodiments can be combined arbitrarily. For the sake of brevity of description, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, it should be considered as within the scope described in this specification.

[0108] The above-described embodiments only represent several implementation manners of the present invention. Their descriptions are relatively specific and detailed, but they should not be construed as limiting the scope of the invention patent. It should be noted that for those of ordinary skill in the art, without departing from the concept of the present invention, several modifications and improvements can still be made, and these all belong to the protection scope of the present invention. Therefore, the protection scope of the present invention patent should be subject to the appended claims.

Claims

1. A key distribution method based on quantum key distribution and asymmetric cryptography, characterized in that, There are several nodes, and the nodes include no less than 2 distribution terminals and trusted relays. There are N trusted relays between different distribution terminals, where N is no less than 1. The method includes the following steps: S1. Several distribution terminals respectively generate random numbers, use the random numbers as private keys to generate public keys based on asymmetric cryptography, and send them to the corresponding trusted relays under the protection of quantum keys; S2. The trusted relays use the keys received from the previous node to generate communication keys based on asymmetric cryptography, and send the communication keys to the next node under the protection of quantum keys; S3. Repeat step S2 until the distribution terminals respectively receive the communication keys, and then the distribution terminals respectively calculate the initial distribution keys; S4. Between the distribution terminals and the N trusted relays, N types of distribution auxiliary key pairs are respectively generated based on asymmetric cryptography; the distribution auxiliary keys are used for the distribution terminals to complete the key distribution with another distribution terminal through the corresponding trusted relays; S5. The distribution terminals use the distribution auxiliary keys to confidentially complete the distribution of the subsequent distribution keys; When there are two distribution terminals, S1 includes the following steps: The first distribution terminal generates a first true random number, uses the first true random number as the first private key to generate a first public key based on asymmetric cryptography, and sends it to the corresponding trusted relay under the protection of quantum keys; The second distribution terminal generates a second true random number, uses the second true random number as the second private key to generate a second public key based on asymmetric cryptography, and sends it to the corresponding trusted relay under the protection of quantum keys; When there are 2 trusted relays, the corresponding trusted relay of the first distribution terminal is the first trusted relay, and the corresponding trusted relay of the second distribution terminal is the second trusted relay; S2 includes the following steps: The first trusted relay generates a first communication key based on the first public key, and sends the first communication key to the second trusted relay under the protection of quantum keys. The second trusted relay generates a third communication key based on the first communication key and sends it to the second distribution terminal; The second trusted relay generates a second communication key based on the second public key, and sends the second communication key to the first trusted relay under the protection of quantum keys. The first trusted relay generates a fourth communication key based on the second communication key and sends it to the first distribution terminal; S3 includes the following steps: The first distribution terminal calculates the first communication key, and calculates the first distribution key based on the first communication key and the fourth communication key using asymmetric cryptography. The second distribution terminal calculates the second communication key, and calculates the first distribution key using the third communication key and the second communication key based on asymmetric cryptography; S4 includes the following steps: The first distribution terminal generates a first type of distribution auxiliary key based on the first private key and the fourth communication key, and the first trusted relay calculates the first type of distribution auxiliary key one by using the first public key and the second communication key; The second distribution terminal generates a first type of distribution auxiliary key two based on the second private key and the third communication key, and the second trusted relay calculates the first type of distribution auxiliary key two by using the second public key and the first communication key; The first type of distribution terminal generates a second type of distribution auxiliary key one based on the first public key and the fourth auxiliary key, and the first trusted relay calculates the second type of distribution auxiliary key one by using the first communication key and the second communication key; The second type of distribution terminal generates a second type of distribution auxiliary key two based on the third communication key and the second public key, and the second trusted relay calculates the second type of distribution auxiliary key two by using the second communication key and the first communication key; S5 includes the following steps: The first distribution terminal generates a second distribution key, encrypts the second distribution key with the first type of distribution auxiliary key one and sends it to the first trusted relay. After decrypting with the first type of distribution auxiliary key one, the first trusted relay encrypts it with the first type of distribution auxiliary key two and then sends it to the second distribution terminal; The first distribution terminal generates a third distribution key, encrypts the third distribution key with the second type of distribution auxiliary key one and sends it to the second trusted relay. After decrypting with the second type of distribution auxiliary key one, the second trusted relay encrypts it with the second type of distribution auxiliary key two and then sends it to the second distribution terminal; The generation process of the N types of distribution auxiliary key pairs includes: A and B are nodes in the quantum key distribution network, and there are n relay nodes R1, R2,..., Rn between A and B; A generates a random number a, and B generates a random number b; Based on the elliptic curve parameters g and p, A generates a public key with a as the private key and sends a1 to the relay node R1 under the protection of the QKD key in the quantum distribution network. B generates a public key with b as the private key and sends b1 to the relay node R1 under the protection of the QKD key in the quantum distribution network. The relay node R1 generates and sends a2 to B under the protection of the QKD key in the quantum distribution network. The relay node R1 generates and sends b2 to A under the protection of the QKD key in the quantum distribution network; Using For the quantum key, the following keys are generated: A distribution key is generated between A and B , after A receives b2, calculate the distribution key , after B receives a2, calculate the distribution key ; Since , that is ; The first type of distribution auxiliary key is generated between A and R1 The first type of distribution auxiliary key generated by A is ; The first type of distribution auxiliary key generated by R1 is ; As can be seen from the above, , that is ; From the above, A second type of distribution auxiliary key is generated between A and R2 ; ……； The nth type of distribution auxiliary key is generated between A and Rn ; Similarly, the first to nth types of distribution auxiliary keys are generated between B and R1~Rn.

2. The key distribution method based on quantum key distribution and asymmetric cryptography according to claim 1, characterized in that, When there is 1 trusted relay, the corresponding trusted relay is the first trusted relay; S2 includes the following steps: The first trusted relay generates a first communication key based on the first public key, and the first trusted relay generates a second communication key based on the second public key, and sends the first communication key to the second distribution terminal under the protection of the quantum key, and sends the second communication key to the first distribution terminal under the protection of the quantum key; S3 includes the following steps: The first distribution terminal calculates the first distribution key based on the second communication key using asymmetric cryptography, and the second distribution terminal calculates the first distribution key based on the first communication key using asymmetric cryptography; S4 includes the following steps: The first distribution terminal generates a first type of distribution auxiliary key one based on the first private key and the second communication key, and the first trusted relay calculates the first type of distribution auxiliary key one by using the first public key and the second public key; The second distribution terminal generates a first type of distribution auxiliary key two based on the second private key and the first communication key, and the first trusted relay calculates the first type of distribution auxiliary key two by using the second public key and the first public key; S5 includes the following steps. The first distribution terminal generates a second distribution key, encrypts the second distribution key using the first type of distribution auxiliary key one, and sends it to the first trusted relay. After the first trusted relay decrypts it using the first type of distribution auxiliary key one, it encrypts it using the first type of distribution auxiliary key two and then sends it to the second distribution terminal.

3. A key distribution method based on quantum key distribution and asymmetric cryptography according to any one of claims 1 or 2, characterized in that, The asymmetric cryptography is elliptic curve cryptography.

4. A key distribution method based on quantum key distribution and asymmetric cryptography according to any one of claims 1 or 2, characterized in that The asymmetric cryptography is based on the Diffie-Hellman key exchange protocol and the cryptography of elliptic curve parameters.

Images