Google Patentsopen access

Quantum key distribution method and device, and storage medium — Huawei Technologies Co., Ltd. (US11595196B2)

ABSTRACT

Abstract

This application provide quantum key distribution methods, devices, and storage media. In an implementation, a method comprises: determining, based on a first mapping, a first quantum key of N first quantum keys corresponding to an i th node on a target routing path; determining, based on a second mapping, a second quantum key of N second quantum keys corresponding to the i th node; and generating, by the i th node based on the first quantum key corresponding to the i th node and the second quantum key corresponding to the i th node, a third quantum key corresponding to the i th node on the target routing path.

Description

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of International Application No. PCT/CN2019/082405, filed on Apr. 12, 2019, which claims priority to Chinese Patent Application No. 201810332715.5, filed on Apr. 13, 2018. The disclosures of the aforementioned applications are hereby incorporated by reference in their entireties.

TECHNICAL FIELD

This application relates to the quantum communication field, and in particular, to a quantum key distribution method and device, and a storage medium.

BACKGROUND

With development of science and technology, acceleration of informatization, and more frequent communication, an increasingly high requirement is posed on communication security. Secure quantum communication is a combination of a quantum feature and conventional cryptography, and uses a basic principle and feature of quantum mechanics to ensure communication security. After more than 30 years of development, secure quantum communication is practical in the market currently.

Currently, the most practical secure quantum communication technology is a quantum key distribution (QKD) technology, and the quantum key distribution technology is used to implement unconditionally secure distribution of a symmetric key on the premise that some security keys have been shared. FIG. 1 is a schematic diagram of a quantum key distribution method in the prior art. As shown in FIG. 1 , a routing path includes a source node A 1 , a relay node A 2 , a relay node A 3 , and a destination node A 4 , and K 1 is a to-be-shared quantum key between the source node A 1 and the destination node A 4 and needs to be transmitted from the source node A 1 to the destination node A 4 . In the prior art, the source node A 1 encrypts K 1 by using K A1A2 , to obtain K 2 , and transmits obtained K 2 to the relay node A 2 , where K A1A2 is a private key shared or to be shared between the source node A 1 and the relay node A 2 . The relay node A 2 decrypts K 2 by using K A1A2 , then encrypts K 1 by using K A2A3 , to obtain K 3 , and transmits obtained K 3 to the relay node A 3 , where K A2A3 is a private key shared or to be shared between the relay node A 2 and the relay node A 3 . The relay node A 3 decrypts K 3 by using K A2A3 , then encrypts K by using K A3A4 , to obtain K 4 , and transmits obtained K 4 to the destination node A 4 , where K A3A4 is a private key shared or to be shared between the relay node A 3 and the destination node A 4 . The destination node A 4 decrypts K 4 by using K A3A4 , to obtain K 1 .

In the solution shown in FIG. 1 , the to-be-shared quantum key K 1 between the source node A 1 and the destination node A 4 is decrypted by each relay node, and consequently security is relatively low.

SUMMARY

Embodiments of this application provide a quantum key distribution method and device, and a storage medium, to resolve a prior-art problem of low security when a quantum key is distributed between nodes.

According to a first aspect, an embodiment of this application provides a quantum key distribution method, where the method includes:

determining, by an i th node based on a first correspondence, a first quantum key corresponding to the i th node on a target routing path, where the i th node is the i th node on the target routing path, the first quantum key corresponding to the i th node on the target routing path is a quantum key that is obtained by the i th node and that is shared or to be shared between the i th node and an (i−1) th node on the target routing path, the first correspondence includes a correspondence between each of N routing paths passing through the i th node and each of N first quantum keys corresponding to the i th node, the N routing paths are in a one-to-one correspondence with the N first quantum keys corresponding to the i th node, the target routing path is one of the N routing paths, N is a positive integer, and i is a positive integer;

determining, by the i th node based on a second correspondence, a second quantum key corresponding to the i th node on the target routing path, where the second quantum key corresponding to the i th node on the target routing path is a quantum key that is obtained by the i th node and that is shared or to be shared between the i th node and an (i+1) th node on the target routing path, the second correspondence includes a correspondence between each of the N routing paths passing through the i th node and each of N second quantum keys corresponding to the i th node, and the N routing paths are in a one-to-one correspondence with the N second quantum keys corresponding to the i th node;

generating, by the i th node based on the first quantum key corresponding to the i th node on the target routing path and the second quantum key corresponding to the i th node on the target routing path, a third quantum key corresponding to the i th node on the target routing path; and

sending, by the i th node, the third quantum key corresponding to the i th node on the target routing path to a destination node on the target routing path; or encrypting, by the i th node by using the third quantum key corresponding to the i th node on the target routing path, a first ciphertext received from the (i−1) node on the target routing path, and sending an obtained second ciphertext corresponding to the i th node to the (i+1) th node on the target routing path, where the first ciphertext received by the i th node from the (i−1) th node on the target routing path is a second ciphertext that is sent by the (i−1) th node and that corresponds to the (i−1) th node, and when i is 1, a 0 th node is a source node on the target routing path, and a second ciphertext corresponding to the source node on the target routing path is obtained by encrypting a to-be-shared quantum key between the source node on the target routing path and the destination node on the target routing path by using a second quantum key corresponding to the source node on the target routing path, wherein

a second quantum key corresponding to the (i−1) th node on the target routing path is the same as the first quantum key corresponding to the i th node on the target routing path, and the second quantum key corresponding to the i th node on the target routing path is the same as a first quantum key corresponding to the (i+1) th node on the target routing path.

According to a second aspect, an embodiment of this application provides a quantum key distribution device. The quantum key distribution device includes a memory, a transceiver, and a processor. The memory is configured to store an instruction. The processor is configured to: execute the instruction stored in the memory, and control the transceiver to receive a signal and send a signal. When the processor executes the instruction stored in the memory, the quantum key distribution device is configured to perform the method in any one of the first aspect or the possible implementations of the first aspect.

According to a third aspect, an embodiment of this application provides a quantum key distribution device, configured to implement the method in any one of the first aspect or the possible implementations of the first aspect. The quantum key distribution device includes corresponding functions separately configured to implement steps in the foregoing method. The functions may be implemented by hardware, or may be implemented by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the foregoing functions.

According to a fourth aspect, an embodiment of this application provides a computer storage medium. The computer storage medium stores an instruction. When the instruction is run on a computer, the computer is enabled to perform the method in any one of the first aspect or the possible implementations of the first aspect.

According to a fifth aspect, an embodiment of this application provides a computer program product including an instruction. When the computer program product is run on a computer, the computer is enabled to perform the method in any one of the first aspect or the possible implementations of the first aspect.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a schematic diagram of a quantum key distribution method in the prior art;

FIG. 2 is a schematic architectural diagram of a quantum communication system according to an embodiment of this application:

FIG. 3 is a schematic flowchart of a quantum key distribution method according to an embodiment of this application;

FIG. 4 is a schematic diagram of a quantum key distribution method performed for a routing path L 2 in FIG. 2 according to an embodiment of this application:

FIG. 5 is a schematic diagram of another quantum key distribution method performed for a routing path L 2 in FIG. 2 according to an embodiment of this application;

FIG. 6 is a schematic diagram in which a node D in FIG. 2 generates, in an implementation a3-1, a first correspondence corresponding to the node D according to an embodiment of this application:

FIG. 7 is a schematic diagram in which a node D in FIG. 2 generates, in an implementation a3-2, a first quantum key corresponding to the node D on a routing path L 2 according to an embodiment of this application:

FIG. 8 is a schematic diagram in which a node D in FIG. 2 generates, in an implementation a3-3, a first quantum key corresponding to the node D on a routing path L 2 according to an embodiment of this application;

FIG. 9 is a schematic diagram in which a node D in FIG. 2 generates, in an implementation b3-1, a second correspondence corresponding to the node D according to an embodiment of this application:

FIG. 10 is a schematic diagram in which a node E in FIG. 2 generates, in an implementation a3-1, a first correspondence corresponding to the node E according to an embodiment of this application;

FIG. 11 is a schematic diagram in which a node D in FIG. 2 generates, in an implementation b3-2, a second quantum key corresponding to the node D on a routing path L 2 according to an embodiment of this application:

FIG. 12 is a schematic structural diagram of a local area network obtained by dividing a quantum communication system according to an embodiment of this application;

FIG. 13 is a schematic structural diagram of a quantum key distribution device according to an embodiment of this application; and

FIG. 14 is a schematic structural diagram of another quantum key distribution device according to an embodiment of this application.

DESCRIPTION OF EMBODIMENTS

FIG. 2 is an example of a schematic architectural diagram of a quantum communication system according to an embodiment of this application. As shown in FIG. 2 , the quantum communication system includes a plurality of nodes, for example, a node B, a node C, a node D, a node E, a node F, a node G a node H a node P, a node Q. and a node R. There may be a plurality of routing paths between the plurality of nodes, and a node other than a source node and a destination node on one routing path may be referred to as a relay node. One node may be used as a source node on one routing path and used as a relay node or a destination node on another routing path. FIG. 2 shows several routing paths as an example, which are respectively:

a routing path L 1 : “source node B→relay node D→relay node E→relay node G→destination node P”:

a routing path L 2 : “source node B→relay node D→relay node E→relay node G→destination node Q”;

a routing path L 3 : “source node B→relay node D→relay node E→destination node H”;

a routing path L 4 : “source node C→relay node D→destination node F”:

a routing path L 5 : “source node B→relay node D→destination node F”; and

a routing path L 6 : “source node R→relay node E→destination node H”.

Based on the schematic architectural diagram of the quantum communication system shown in FIG. 2 , an embodiment of this application provides a quantum key distribution method. FIG. 3 is an example of a schematic flowchart of a quantum key distribution method according to an embodiment of this application. As shown in FIG. 3 , the method provided in this embodiment of this application includes the following steps.

Step 301 : An i th node determines, based on a first correspondence, a first quantum key corresponding to the i th node on a target routing path. In an optional implementation, the i th node is an i th relay node on the target routing path.

The i th node is the i th node on the target routing path. The first quantum key corresponding to the i th node on the target routing path is a quantum key that is obtained by the i th node and that is shared or to be shared between the i th node and an (i−1) th node on the target routing path. The first correspondence includes a correspondence between each of N routing paths passing through the i th node and each of N first quantum keys corresponding to the i th node, and the N routing paths are in a one-to-one correspondence with the N first quantum keys corresponding to the i th node, where N is a positive integer, and i is a positive integer. The target routing path is any one of the N routing paths. In this embodiment of this application, the target routing path is merely a name for ease of description, and does not constitute a limitation.

<div id="p-0042" num="0041" clas

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of International Application No. PCT/CN2019/082405, filed on Apr. 12, 2019, which claims priority to Chinese Patent Application No. 201810332715.5, filed on Apr. 13, 2018. The disclosures of the aforementioned applications are hereby incorporated by reference in their entireties.

TECHNICAL FIELD

This application relates to the quantum communication field, and in particular, to a quantum key distribution method and device, and a storage medium.

BACKGROUND

With development of science and technology, acceleration of informatization, and more frequent communication, an increasingly high requirement is posed on communication security. Secure quantum communication is a combination of a quantum feature and conventional cryptography, and uses a basic principle and feature of quantum mechanics to ensure communication security. After more than 30 years of development, secure quantum communication is practical in the market currently.

Currently, the most practical secure quantum communication technology is a quantum key distribution (QKD) technology, and the quantum key distribution technology is used to implement unconditionally secure distribution of a symmetric key on the premise that some security keys have been shared. FIG. 1 is a schematic diagram of a quantum key distribution method in the prior art. As shown in FIG. 1 , a routing path includes a source node A 1 , a relay node A 2 , a relay node A 3 , and a destination node A 4 , and K 1 is a to-be-shared quantum key between the source node A 1 and the destination node A 4 and needs to be transmitted from the source node A 1 to the destination node A 4 . In the prior art, the source node A 1 encrypts K 1 by using K A1A2 , to obtain K 2 , and transmits obtained K 2 to the relay node A 2 , where K A1A2 is a private key shared or to be shared between the source node A 1 and the relay node A 2 . The relay node A 2 decrypts K 2 by using K A1A2 , then encrypts K 1 by using K A2A3 , to obtain K 3 , and transmits obtained K 3 to the relay node A 3 , where K A2A3 is a private key shared or to be shared between the relay node A 2 and the relay node A 3 . The relay node A 3 decrypts K 3 by using K A2A3 , then encrypts K by using K A3A4 , to obtain K 4 , and transmits obtained K 4 to the destination node A 4 , where K A3A4 is a private key shared or to be shared between the relay node A 3 and the destination node A 4 . The destination node A 4 decrypts K 4 by using K A3A4 , to obtain K 1 .

In the solution shown in FIG. 1 , the to-be-shared quantum key K 1 between the source node A 1 and the destination node A 4 is decrypted by each relay node, and consequently security is relatively low.

SUMMARY

Embodiments of this application provide a quantum key distribution method and device, and a storage medium, to resolve a prior-art problem of low security when a quantum key is distributed between nodes.

According to a first aspect, an embodiment of this application provides a quantum key distribution method, where the method includes:

determining, by an i th node based on a first correspondence, a first quantum key corresponding to the i th node on a target routing path, where the i th node is the i th node on the target routing path, the first quantum key corresponding to the i th node on the target routing path is a quantum key that is obtained by the i th node and that is shared or to be shared between the i th node and an (i−1) th node on the target routing path, the first correspondence includes a correspondence between each of N routing paths passing through the i th node and each of N first quantum keys corresponding to the i th node, the N routing paths are in a one-to-one correspondence with the N first quantum keys corresponding to the i th node, the target routing path is one of the N routing paths, N is a positive integer, and i is a positive integer;

determining, by the i th node based on a second correspondence, a second quantum key corresponding to the i th node on the target routing path, where the second quantum key corresponding to the i th node on the target routing path is a quantum key that is obtained by the i th node and that is shared or to be shared between the i th node and an (i+1) th node on the target routing path, the second correspondence includes a correspondence between each of the N routing paths passing through the i th node and each of N second quantum keys corresponding to the i th node, and the N routing paths are in a one-to-one correspondence with the N second quantum keys corresponding to the i th node;

generating, by the i th node based on the first quantum key corresponding to the i th node on the target routing path and the second quantum key corresponding to the i th node on the target routing path, a third quantum key corresponding to the i th node on the target routing path; and

sending, by the i th node, the third quantum key corresponding to the i th node on the target routing path to a destination node on the target routing path; or encrypting, by the i th node by using the third quantum key corresponding to the i th node on the target routing path, a first ciphertext received from the (i−1) node on the target routing path, and sending an obtained second ciphertext corresponding to the i th node to the (i+1) th node on the target routing path, where the first ciphertext received by the i th node from the (i−1) th node on the target routing path is a second ciphertext that is sent by the (i−1) th node and that corresponds to the (i−1) th node, and when i is 1, a 0 th node is a source node on the target routing path, and a second ciphertext corresponding to the source node on the target routing path is obtained by encrypting a to-be-shared quantum key between the source node on the target routing path and the destination node on the target routing path by using a second quantum key corresponding to the source node on the target routing path, wherein

a second quantum key corresponding to the (i−1) th node on the target routing path is the same as the first quantum key corresponding to the i th node on the target routing path, and the second quantum key corresponding to the i th node on the target routing path is the same as a first quantum key corresponding to the (i+1) th node on the target routing path.

According to a second aspect, an embodiment of this application provides a quantum key distribution device. The quantum key distribution device includes a memory, a transceiver, and a processor. The memory is configured to store an instruction. The processor is configured to: execute the instruction stored in the memory, and control the transceiver to receive a signal and send a signal. When the processor executes the instruction stored in the memory, the quantum key distribution device is configured to perform the method in any one of the first aspect or the possible implementations of the first aspect.

According to a third aspect, an embodiment of this application provides a quantum key distribution device, configured to implement the method in any one of the first aspect or the possible implementations of the first aspect. The quantum key distribution device includes corresponding functions separately configured to implement steps in the foregoing method. The functions may be implemented by hardware, or may be implemented by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the foregoing functions.

According to a fourth aspect, an embodiment of this application provides a computer storage medium. The computer storage medium stores an instruction. When the instruction is run on a computer, the computer is enabled to perform the method in any one of the first aspect or the possible implementations of the first aspect.

According to a fifth aspect, an embodiment of this application provides a computer program product including an instruction. When the computer program product is run on a computer, the computer is enabled to perform the method in any one of the first aspect or the possible implementations of the first aspect.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a schematic diagram of a quantum key distribution method in the prior art;

FIG. 2 is a schematic architectural diagram of a quantum communication system according to an embodiment of this application:

FIG. 3 is a schematic flowchart of a quantum key distribution method according to an embodiment of this application;

FIG. 4 is a schematic diagram of a quantum key distribution method performed for a routing path L 2 in FIG. 2 according to an embodiment of this application:

FIG. 5 is a schematic diagram of another quantum key distribution method performed for a routing path L 2 in FIG. 2 according to an embodiment of this application;

FIG. 6 is a schematic diagram in which a node D in FIG. 2 generates, in an implementation a3-1, a first correspondence corresponding to the node D according to an embodiment of this application:

FIG. 7 is a schematic diagram in which a node D in FIG. 2 generates, in an implementation a3-2, a first quantum key corresponding to the node D on a routing path L 2 according to an embodiment of this application:

FIG. 8 is a schematic diagram in which a node D in FIG. 2 generates, in an implementation a3-3, a first quantum key corresponding to the node D on a routing path L 2 according to an embodiment of this application;

FIG. 9 is a schematic diagram in which a node D in FIG. 2 generates, in an implementation b3-1, a second correspondence corresponding to the node D according to an embodiment of this application:

FIG. 10 is a schematic diagram in which a node E in FIG. 2 generates, in an implementation a3-1, a first correspondence corresponding to the node E according to an embodiment of this application;

FIG. 11 is a schematic diagram in which a node D in FIG. 2 generates, in an implementation b3-2, a second quantum key corresponding to the node D on a routing path L 2 according to an embodiment of this application:

FIG. 12 is a schematic structural diagram of a local area network obtained by dividing a quantum communication system according to an embodiment of this application;

FIG. 13 is a schematic structural diagram of a quantum key distribution device according to an embodiment of this application; and

FIG. 14 is a schematic structural diagram of another quantum key distribution device according to an embodiment of this application.

DESCRIPTION OF EMBODIMENTS

FIG. 2 is an example of a schematic architectural diagram of a quantum communication system according to an embodiment of this application. As shown in FIG. 2 , the quantum communication system includes a plurality of nodes, for example, a node B, a node C, a node D, a node E, a node F, a node G a node H a node P, a node Q. and a node R. There may be a plurality of routing paths between the plurality of nodes, and a node other than a source node and a destination node on one routing path may be referred to as a relay node. One node may be used as a source node on one routing path and used as a relay node or a destination node on another routing path. FIG. 2 shows several routing paths as an example, which are respectively:

a routing path L 1 : “source node B→relay node D→relay node E→relay node G→destination node P”:

a routing path L 2 : “source node B→relay node D→relay node E→relay node G→destination node Q”;

a routing path L 3 : “source node B→relay node D→relay node E→destination node H”;

a routing path L 4 : “source node C→relay node D→destination node F”:

a routing path L 5 : “source node B→relay node D→destination node F”; and

a routing path L 6 : “source node R→relay node E→destination node H”.

Based on the schematic architectural diagram of the quantum communication system shown in FIG. 2 , an embodiment of this application provides a quantum key distribution method. FIG. 3 is an example of a schematic flowchart of a quantum key distribution method according to an embodiment of this application. As shown in FIG. 3 , the method provided in this embodiment of this application includes the following steps.

Step 301 : An i th node determines, based on a first correspondence, a first quantum key corresponding to the i th node on a target routing path. In an optional implementation, the i th node is an i th relay node on the target routing path.

The i th node is the i th node on the target routing path. The first quantum key corresponding to the i th node on the target routing path is a quantum key that is obtained by the i th node and that is shared or to be shared between the i th node and an (i−1) th node on the target routing path. The first correspondence includes a correspondence between each of N routing paths passing through the i th node and each of N first quantum keys corresponding to the i th node, and the N routing paths are in a one-to-one correspondence with the N first quantum keys corresponding to the i th node, where N is a positive integer, and i is a positive integer. The target routing path is any one of the N routing paths. In this embodiment of this application, the target routing path is merely a name for ease of description, and does not constitute a limitation.

Step 302 : The i th node determines, based on a second correspondence, a second quantum key corresponding to the i th node on the target routing path.

The second quantum key corresponding to the i th node on the target routing path is a quantum key that is obtained by the i th node and that is shared or to be shared between the i th node and an (i+1) th node on the target routing path. The second correspondence includes a correspondence between each of the N routing paths passing through the i th node and each of N second quantum keys corresponding to the i th node, and the N routing paths are in a one-to-one correspondence with the N second quantum keys corresponding to the i th node.

Step 303 : The i th node generates, based on the first quantum key corresponding to the i th node on the target routing path and the second quantum key corresponding to the i th node on the target routing path, a third quantum key corresponding to the i th node on the target routing path. After step 303 , this embodiment of this application provides two optional implementations. In one optional implementations, step 304 is performed after step 303 . In the other optional implementations, step 305 is performed after step 303 . Whether step 304 or step 305 is performed after step 303 may be flexibly selected by a person skilled in the art based on an actual application scenario.

Step 304 : The i th node sends the third quantum key corresponding to the i th node on the target routing path to a destination node on the target routing path.

Step 305 : The i th node encrypts, by using the third quantum key corresponding to the i th node on the target routing path, a first ciphertext received from the (i−1) th node on the target routing path, and sends an obtained second ciphertext corresponding to the i th node to the (i+1) th node on the target routing path.

The first ciphertext received by the i th node from the (i−1) th node on the target routing path is a second ciphertext that is sent by the (i−1) th node and that corresponds to the (i−1) th node. When i is 1, a 0 th node is a source node on the target routing path, and a second ciphertext corresponding to the source node on the target routing path is obtained by encrypting a to-be-shared quantum key between the source node on the target routing path and the destination node on the target routing path by using a second quantum key corresponding to the source node on the target routing path.

A second quantum key corresponding to the (i−1) th node on the target routing path is the same as the first quantum key corresponding to the i th node on the target routing path, and the second quantum key corresponding to the i th node on the target routing path is the same as a first quantum key corresponding to the (i+1) th node on the target routing path.

In this embodiment of this application, an algorithm used when the i th node encrypts, by using the third quantum key corresponding to the i th node on the target routing path, the first ciphertext received from the (i−1) th node on the target routing path may be referred to as a first algorithm. In this embodiment of this application, an algorithm used when the third quantum key corresponding to the i th node on the target routing path is generated based on the first quantum key corresponding to the i th node on the target routing path and the second quantum key corresponding to the i th node on the target routing path may be referred to as a second algorithm.

The quantum key distribution method shown in FIG. 3 is described in detail below by using an example in which the target routing path is the routing path L 2 in FIG. 2 . FIG. 4 is an example of a schematic diagram of a quantum key distribution method performed for a routing path L 2 in FIG. 2 . A solution shown in FIG. 4 is used to perform a solution corresponding to step 305 . As shown in FIG. 4 , a to-be-shared quantum key between the source node B and the destination node Q is K BQ (L 2 ), and the source node B needs to transmit the to-be-shared quantum key K BQ (L 2 ) to the destination node Q. A specific procedure is as follows:

As shown in FIG. 4 , the source node B obtains the to-be-shared quantum key K BQ (L 2 ). A second quantum key corresponding to the source node B is a quantum key that corresponds to the source node B on the routing path L 2 and that is shared or to be shared between the source node B and the relay node D, where the quantum key is determined by the source node B. In FIG. 4 , K BD (L 2 ) represents the second quantum key corresponding to the source node B on the routing path L 2 .

The source node B encrypts, by using the second quantum key K BD (L 2 ) corresponding to the source node B, the to-be-shared quantum key K BQ (L 2 ) between the source node on the target routing path and the destination node on the target routing path, to obtain a second ciphertext K B (L 2 ) corresponding to the source node B. The source node B sends the second ciphertext K B (L 2 ) corresponding to the source node to the relay node D. An algorithm used to encrypt K BQ (L 2 ) by using K BD (L 2 ) may be referred to as a third algorithm. The third algorithm may be the same as the first algorithm, or may be another algorithm.

Correspondingly, the relay node D receives a first ciphertext K B (L 2 ) from the source node B. In other words, the second ciphertext that is sent by the source node B and that corresponds to the source node B is the same as the first ciphertext received by the relay node D. In this embodiment of this application, a first ciphertext received by a relay node may also be referred to as the first ciphertext corresponding to the relay node. For example, the first ciphertext K B (L 2 ) received by the relay node D may also be referred to as the first ciphertext K B (L 2 ) corresponding to the relay node D. If the target routing path is the routing path L 2 , and the node D is an i th node on the target routing path, the node B is an (i−1) th node on the target routing path, the node E is an (i+1) th node on the target routing path, and the node G is an (i+ 2 ) th node on the target routing path. This is the same for subsequent descriptions, and is not described below. The relay node D generates, based on a first quantum key K DB (L 2 ) corresponding to the relay node D on the target routing path and a second quantum key K DE (L 2 ) corresponding to the relay node D on the target routing path, a third quantum key K BE (L 2 ) corresponding to the relay node D on the target routing path.

Further, the relay node D encrypts, by using the third quantum key K BE (L 2 ), the received first ciphertext K B (L 2 ) corresponding to the relay node D, to obtain a second ciphertext K D (L 2 ) corresponding to the relay node D. The relay node D sends the second ciphertext K D (L 2 ) corresponding to the relay node D to the relay node E. An algorithm used to encrypt the first ciphertext K B (L 2 ) by using the third quantum key K BE (L 2 ) to generate the second ciphertext K D (L 2 ) may be the first algorithm.

Correspondingly, the relay node E receives a first ciphertext K D (L 2 ) from the relay node D. In other words, the second ciphertext that is sent by the relay node D and that corresponds to the relay node D is the same as the first ciphertext received by the relay node E. The relay node E generates, based on a first quantum key K ED (L 2 ) corresponding to the relay node E on the routing path L 2 and a second quantum key K EG (L 2 ) corresponding to the relay node E on the routing path L 2 , a third quantum key K DG (L 2 ) corresponding to the relay node E on the routing path L 2 . Further, the relay node E encrypts the first ciphertext K D (L 2 ) by using the third quantum key K DG (L 2 ), to obtain a second ciphertext K E (L 2 ) corresponding to the relay node E. The relay node E sends the second ciphertext K E (L 2 ) corresponding to the relay node E to the relay node G.

Correspondingly, the relay node G receives a first ciphertext K E (L 2 ) from the relay node E. In other words, the second ciphertext that is sent by the relay node E and that corresponds to the relay node E is the same as the first ciphertext received by the relay node G. The relay node G generates, based on a first quantum key K GE (L 2 ) corresponding to the relay node G on the routing path L 2 and a second quantum key K GQ (L 2 ) corresponding to the relay node G on the routing path L 2 , a third quantum key K EQ (L 2 ) corresponding to the relay node G on the routing path L 2 . Further, the relay node G encrypts the first ciphertext K E (L 2 ) by using the third quantum key K EQ (L 2 ), to obtain a second ciphertext K G (L 2 ) corresponding to the relay node G. The relay node G sends the second ciphertext K G (L 2 ) corresponding to the relay node G to the destination node Q.

Further, the destination node Q receives a first ciphertext K G (L 2 ) from the relay node G. and K G (L 2 ) may be referred to as the first ciphertext corresponding to the destination node Q. The destination node Q decrypts the first ciphertext K G (L 2 ) by using a first quantum key K QG (L 2 ) corresponding to the destination node Q on the routing path L 2 , to obtain the to-be-shared quantum key K BQ (L 2 ). An algorithm used for decryption processing may be referred to as a fourth algorithm. The fourth algorithm may be the same as the first algorithm, or may be another algorithm.

For a process in which the destination node decrypts, by using the first quantum key corresponding to the destination node on the target routing path, the first ciphertext corresponding to the destination node, to obtain the to-be-shared quantum key, refer to related descriptions of a formula (1) in the following content.

FIG. 5 is an example of a schematic diagram of another quantum key distribution method performed for a routing path L 2 in FIG. 2 . The solution shown in FIG. 4 is used to perform a solution corresponding to step 304 . As shown in FIG. 5 , the source node may send generated K B (L 2 ) to the destination node Q by using a typical signal or through a quantum channel. Each relay node also sends a third quantum key correspondingly generated by each relay node to the destination node Q. For example, in FIG. 5 , the relay node D sends a generated third quantum key K BE (L 2 ) corresponding to the relay node D on the routing path L 2 to the destination node Q, the relay node E sends a generated third quantum key K DG (L 2 ) corresponding to the relay node E on the routing path L 2 to the destination node Q, and the relay node G sends a generated third quantum key K EQ (L 2 ) corresponding to the relay node G on the routing path L 2 to the destination node Q. The destination node Q encrypts K B (L 2 ) by using K BE (L 2 ), encrypts an obtained result by using K DG (L 2 ), encrypts an obtained result by using K EQ (L 2 ), and decrypts an obtained result by using K QG (L 2 ), to obtain a to-be-shared quantum key K BQ (L 2 ). It can be learned that, in this solution, each relay node sends the third quantum key to the destination node after obtaining the third quantum key through calculation, so that operation duration of each relay node can be shortened, and quantum key distribution efficiency can be further improved.

The following content can be learned from the examples shown in FIG. 4 and FIG. 5 . First, in this embodiment of this application, a relay node does not decrypt information sent by a previous node of the relay node, so that a to-be-shared quantum key between a source node and a destination node is not obtained by a relay node through decryption. This can improve security of the to-be-shared quantum key between the source node and the destination node.

Second, a relay node does not encrypt and decrypt information sent by a previous node of the relay node, so that a time and a resource occupied for performing optical-to-electrical conversion on a to-be-shared quantum key on a routing path can be saved.

Third, in this embodiment of this application, after generating a third quantum key, a relay node may delete a first quantum key and a second quantum key that correspond to the relay node. It can be learned that the relay node may not leave a time window within which an attack is made, so that a capability of an eavesdropper for decrypting a to-be-shared quantum key is deteriorated. This can further improve information transmission security in a quantum key distribution process.

Fourth, related information of a third quantum key corresponding to a relay node may be publicized, so that an information storage security requirement can be lowered. This provides a basis for further publicizing all related attribute information of the relay node. A node may publicize a log including a corresponding operation and a corresponding access status that are generated when the node is used as a relay node on a routing path, and a resource utilization status of the node. In this process, an intermediate step of obtaining a third quantum key corresponding to the relay node through calculation and a related information result used in the intermediate step cannot be publicized. In this embodiment of this application, the relay node may publicize related information of the relay node, for example, a log including an operation and an access status of the relay node. This can help analyze a network running status, and further improves transparency to a customer.

In this embodiment of this application, the second quantum key corresponding to the (i−1) th node on the target routing path is the same as the first quantum key corresponding to the i th node on the target routing path, and the second quantum key corresponding to the i th node on the target routing path is the same as the first quantum key corresponding to the (i+1) th node on the target routing path. For example, in FIG. 4 , K BD (L 2 ) is the same as K DB (L 2 ). K DE (L 2 ) is the same as K ED (L 2 ), K EG (L 2 ) is the same as K GE (L 2 ), and K GQ (L 2 ) is the same as K QG (L 2 ). Therefore, the destination node can obtain the to-be-shared quantum key through decryption.

In FIG. 4 and FIG. 5 , an example in which both the first algorithm and the second algorithm are exclusive OR algorithms is used for description. A person skilled in the art may learn that the first algorithm and the second algorithm may alternatively be other algorithms. In step 303 , an algorithm used when the third quantum key corresponding to the i th node on the target routing path is generated based on the first quantum key corresponding to the i th node on the target routing path and the second quantum key corresponding to the i th node on the target routing path is the second algorithm, and an algorithm used when the i th node encrypts, by using the third quantum key corresponding to the i th node on the target routing path, the first ciphertext received from the (i−1) th node on the target routing path is the first algorithm.

In an optional implementation, the first algorithm meets the formula (1):

g (ƒ E ( K i−1,i−2 ( L j ), K i−1,i ( L j )),ƒ E ( K i,i−1 ( L j ), K i,i+1 ( L j )))=ƒ E ( K i−1,i−2 ( L j ), K i,j+1 ( L j ))

In the formula (1), L j is an identifier of the target routing path;

K i−1,i−2 (L j ) is a first quantum key corresponding to the (i−1) th node on the target routing path L j ;

K i−1,i (L j ) is the second quantum key corresponding to the (i−1) th node on the target routing path L j ;

K i,i−1 (L j ) is the first quantum key corresponding to the i th node on the target routing path L j ;

K i,j+1 (L j ) is the second quantum key corresponding to the i th node on the target routing path;

ƒ E (•) is a function corresponding to the second algorithm, where the second algorithm is an algorithm used when the third quantum key corresponding to the i th node on the target routing path is generated based on the first quantum key corresponding to the i th node on the target routing path and the second quantum key corresponding to the i th node on the target routing path; and

g(•) is a function corresponding to the first algorithm.

With reference to FIG. 4 , for example, when the i th node is the relay node E, the foregoing formula (1) may be correspondingly expressed as follows:

g (ƒ E ( K DB ( L 2 ), K DE ( L 2 )),ƒ E ( k ED ( L 2 ), K EG ( L 2 )))=ƒ E ( K EG ( L 2 ), K EG ( L 2 )).

Herein, ƒ E (K D (L 2 ),K E (L 2 )) means that an operation corresponding to the second algorithm is performed on the first quantum key K DB (L 2 ) corresponding to the relay node D on the routing path L 2 and the second quantum key K DE (L 2 ) corresponding to the relay node D on the routing path L 2 , and a calculation result of ƒ E (K DB (L 2 ),K DE (L 2 )) is the third quantum key K BE (L 2 ), shown in FIG. 4 , corresponding to the relay node D on the routing path L 2 .

ƒ E (K ED (L 2 ),K EG (L 2 )) means that an operation corresponding to the second algorithm is performed on the first quantum key K ED (L 2 ) corresponding to the relay node E on the routing path L 2 and the second quantum key K EG (L 2 ) corresponding to the relay node E on the routing path L 2 , and a calculation result of ƒ E (K ED (L 2 ),K EG (L 2 )) is the third quantum key K DG (L 2 ), shown in FIG. 4 , corresponding to the relay node E on the routing path L 2 .

g(ƒ D (K DB (L 2 ),K DE (L 2 )),ƒ E (K EG (L 2 ),K EG (L 2 ))) means that an operation corresponding to the first algorithm is performed on the third quantum key K BE (L 2 ) corresponding to the relay node D on the routing path L 2 and the third quantum key K DG (L 2 ) corresponding to the relay node E on the routing path L 2 , and when K DE (L 2 ) is the same as K ED (L 2 ), a result of g(ƒ E (K DB (L 2 ),K DE (L 2 )),ƒ E (K ED (L 2 ),K EG (L 2 ))) is ƒ E (K DB (L 2 ),K EG (L 2 )).

When the foregoing formula (1) is used, with reference to a calculation manner of a third quantum key corresponding to each node in FIG. 4 and a calculation manner of a second ciphertext corresponding to each node in FIG. 4 , descriptions are provided as an example with reference to FIG. 4 . An operation performed by the destination node Q may be expressed by using the following formula (2):

K

G

⁡

(

L

2

)

⊕

K

QG

⁡

(

L

2

)

⁢

=

⁢

[

K

E

⁡

(

L

2

)

⊕

K

EQ

⁡

(

L

2

)

]

⊕

K

QG

⁡

(

L

2

)

=

⁢

[

K

D

⁡

(

L

2

)

⊕

K

DG

⁡

(

L

2

)

]

⊕

K

EQ

⁡

(

L

2

)

⊕

K

QG

⁡

(

L

2

)

=

⁢

[

K

B

⁡

(

L

2

)

⊕

K

BE

⁡

(

L

2

)

]

⊕

⁢

K

DG

⁡

(

L

2

)

⊕

K

EQ

⁡

(

L

2

)

⊕

K

QG

⁡

(

L

2

)

=

⁢

[

K

BQ

⁡

(

L

2

)

⊕

K

BD

⁡

(

L

2

)

]

⊕

K

BE

⁡

(

L

2

)

⊕

⁢

K

DG

⁡

(

L

2

)

⊕

K

EQ

⁡

(

L

2

)

⊕

K

QG

⁡

(

L

2

)

=

⁢

[

K

BQ

⁡

(

L

2

)

⊕

K

BD

CLAIMS

Claims ( 18 )

What is claimed is:

1. A method for quantum key distribution, comprising:

determining, by an i th node on a target routing path and based on a first mapping, a first quantum key of N first quantum keys corresponding to the i th node, wherein the first quantum key is obtained by the i th node for sharing between the i th node and an (i−1) th node on the target routing path, the first mapping comprises N one-to-one correspondences between N routing paths passing through the i th node and the N first quantum keys, the target routing path is comprised in the N routing paths;

determining, by the i th node based on a second mapping, a second quantum key of N second quantum keys corresponding to the i th node, wherein the second quantum key corresponding to the i th node on the target routing path is obtained by the i th node for sharing between the i th node and an (i+1) th node on the target routing path, the second mapping comprises N one-to-one correspondences between the N routing paths passing through the i th node and the N second quantum keys;

generating, by the i th node based on the first quantum key corresponding to the i th node and the second quantum key corresponding to the i th node, a third quantum key corresponding to the i th node on the target routing path;

encrypting, by the i th node by using the third quantum key, a first ciphertext received from the (i−1) th node to obtain a second ciphertext; and

sending, by the i th node, the second ciphertext corresponding to the i th node to the (i+1) th node, wherein the first ciphertext is the second ciphertext sent by and corresponding to the (i−1) th node, and when i=1, a 0th node is a source node on the target routing path, and the second ciphertext corresponding to the 0 th node is obtained by encrypting a quantum key to be shared between the source node and a destination node on the target routing path by using a second quantum key of the N second quantum keys corresponding to the source node, wherein

a second quantum key of the N second quantum keys corresponding to the (i−1) th node is same as the first quantum key corresponding to the i th node, and the second quantum key corresponding to the i th node is same as a first quantum key corresponding to the (i+1) th node.

2. The method according to claim 1 , further comprises sending, by the i th node, the third quantum key to a destination node on the target routing path.

3. The method according to claim 1 , wherein the first quantum key is further determined based on a ranking of the N routing paths, and wherein the ranking of the N routing paths is determined by the i th node based on one or more of (1) a ranking relationship between N index numbers of the (i−1) th node on the N routing paths passing through the i th node, (2) a ranking relationship between the N index numbers of the (i+1) th node on the N routing paths passing through the i th node, and (3) a ranking relationship between N index numbers of the N routing paths passing through the i th node.

4. The method according to claim 1 , wherein the first ciphertext is encrypted by using the third quantum key based on a first algorithm that satisfies:

g (ƒ E ( K i−1,i−2 ( L j ), K i−1,i ( L j )),ƒ E ( K i,j−1 ( L j ), K i,j+1 ( L j )))=ƒ E ( K i−1,i−2 ( L j ), K i,j+1 ( L j )), wherein L j is an identifier of the target routing path;

K i−1,i−2 (L j ) is a first quantum key corresponding to the (i−1) th node on the target routing path L j ;

K i−1,j (L j ) is the second quantum key corresponding to the (i−1) th node on the target routing path L j ;

K i,j−1 (L j ) is the first quantum key corresponding to the i th node on the target routing path L j ;

K i,j+1 (L j ) is the second quantum key corresponding to the i th node on the target routing path L j ;

ƒ E (•) is a function corresponding to the second algorithm used when the third quantum key is generated; and

g(•) is a function corresponding to the first algorithm.

5. The method according to claim 1 , wherein if N is greater than 1, for a first routing path and a second routing path in the N routing paths passing through the i th node,

a first quantum key corresponding to the i th node on the first routing path is different from a first quantum key corresponding to the i th node on the second routing path; and

a second quantum key corresponding to the i th node on the first routing path is different from a second quantum key corresponding to the i th node on the second routing path.

6. The method according to claim 1 , wherein the first quantum key corresponding to the i th node is determined based on: (1) indication information received by the i th node from a centralized controller or the (i−1) th node, or (2) network topology information of a quantum communication system and a first preset rule.

7. The method according to claim 1 , wherein the second quantum key corresponding to the i th node is determined based on: (1) indication information received by the i th node from a centralized controller or the (i+1) th node, or (2) network topology information of a quantum communication system and a second preset rule.

8. The method according to claim 1 , wherein the first quantum key is further determined based on a ranking of W routing paths, and wherein the ranking of the W routing paths is determined by the i th node based on one or more of (1) a ranking relationship between W index numbers of W routing paths passing through the i th node and the (i+1) th node, (2) a ranking of the W routing paths passing through the i th node and the (i+1) th node, and (3) a ranking relationship between W index numbers of an (i+2) th node on W routing paths passing through the i th node and the (i+1) th node.

9. A device for quantum key distribution, comprising:

at least one processor; and

a non-transitory computer-readable storage medium coupled to the at least one processor and storing programming instructions for execution by the at least one processor, the programming instructions instruct the device to perform operations comprising:

determining, and based on a first mapping, a first quantum key of N first quantum keys corresponding to an i th node on a target routing path, wherein the first quantum key is obtained by the i th node for sharing between the i th node and an (i−1) th node on the target routing path, the first mapping comprises N one-to-one correspondences between N routing paths passing through the i th node and the N first quantum keys, the target routing path is comprised in the N routing paths;

determining, based on a second mapping, a second quantum key of N second quantum keys corresponding to the i th node, wherein the second quantum key corresponding to the i th node on the target routing path is obtained by the i th node for sharing between the i th node and an (i+1) th node on the target routing path, the second mapping comprises N one-to-one correspondences between the N routing paths passing through the i th node and the N second quantum keys;

generating, based on the first quantum key corresponding to the i th node and the second quantum key corresponding to the i th node, a third quantum key corresponding to the i th node on the target routing path;

encrypting, by the i th node by using the third quantum key, a first ciphertext received from the (i−1) th node to obtain a second ciphertext; and

sending, by the i th node, the second ciphertext corresponding to the i th node to the (i+1) th node, wherein the first ciphertext is the second ciphertext sent by and corresponding to the (i−1) th node, and when i=1, a 0 th node is a source node on the target routing path, and the second ciphertext corresponding to the 0 th node is obtained by encrypting a quantum key to be shared between the source node and a destination node on the target routing path by using a second quantum key of the N second quantum keys corresponding to the source node, wherein

a second quantum key of the N second quantum keys corresponding to the (i−1) th node is same as the first quantum key corresponding to the i th node, and the second quantum key corresponding to the i th node is same as a first quantum key corresponding to the (i+1) th node.

10. The device according to claim 9 , the operations further comprising:

sending the third quantum key to a destination node on the target routing path.

11. The device according to claim 9 , wherein the first quantum key is further determined based on a ranking of the N routing paths, and wherein the ranking of the N routing paths is determined by the i th node based on one or more of (1) a ranking relationship between N index numbers of the (i−1) th node on the N routing paths passing through the i th node, (2) a ranking relationship between the N index numbers of the (i+1) th node on the N routing paths passing through the i th node, and (3) a ranking relationship between N index numbers of the N routing paths passing through the i th node.

12. The device according to claim 9 , wherein the first ciphertext is encrypted by using the third quantum key based on a first algorithm that satisfies:

g (ƒ E ( K i−1,i−2 ( L j ), K i−1,i ( L j )),ƒ E ( K i,j−1 ( L j ), K i,j+1 ( L j )))=ƒ E ( K i−1,i−2 ( L j ), K i,j+1 ( L j )), wherein L j is an identifier of the target routing path;

K i−1,i−2 (L j ) is a first quantum key corresponding to the (i−1) th node on the target routing path L j ;

K i−1,j (L j ) is the second quantum key corresponding to the (i−1) th node on the target routing path L j ;

K i,j−1 (L j ) is the first quantum key corresponding to the i th node on the target routing path L j ;

K i,j+1 (L j ) is the second quantum key corresponding to the i th node on the target routing path L j ;

ƒ E (•) is a function corresponding to the second algorithm used when the third quantum key is generated; and

g(•) is a function corresponding to the first algorithm.

13. The device according to claim 9 , wherein if N is greater than 1, for a first routing path and a second routing path in the N routing paths passing through the i th node,

a first quantum key corresponding to the i th node on the first routing path is different from a first quantum key corresponding to the i th node on the second routing path; and

a second quantum key corresponding to the i th node on the first routing path is different from a second quantum key corresponding to the i th node on the second routing path.

14. The device according to claim 9 , wherein the first quantum key corresponding to the i th node is determined based on: (1) indication information received by the i th node from a centralized controller or the (i−1) th node, or (2) network topology information of a quantum communication system and a first preset rule.

15. The device according to claim 9 , wherein the second quantum key corresponding to the i th node is determined based on: (1) indication information received by the i th node from a centralized controller or the (i+1) th node, or (2) network topology information of a quantum communication system and a second preset rule.

16. The device according to claim 9 , wherein the first quantum key is further determined based on a ranking of W routing paths, and wherein the ranking of the W routing paths is determined by the i th node based on one or more of (1) a ranking relationship between W index numbers of W routing paths passing through the i th node and the (i+1) th node, (2) a ranking of the W routing paths passing through the i th node and the (i+1) th node, and (3) a ranking relationship between W index numbers of an (i+2) th node on W routing paths passing through the i th node and the (i+1) th node.

17. A non-transitory, computer-readable medium storing one or more instructions executable by at least one processor to perform operations comprising:

determining, based on a first mapping, a first quantum key of N first quantum keys corresponding to an i th node on a target routing path, wherein the first quantum key is obtained by the i th node for sharing between the i th node and an (i−1) th node on the target routing path, the first mapping comprises N one-to-one correspondences between N routing paths passing through the i th node and the N first quantum keys, the target routing path is comprised in the N routing paths;

determining, based on a second mapping, a second quantum key of N second quantum keys corresponding to the i th node, wherein the second quantum key corresponding to the i th node on the target routing path is obtained by the i th node for sharing between the i th node and an (i+1) th node on the target routing path, the second mapping comprises N one-to-one correspondences between the N routing paths passing through the i th node and the N second quantum keys;

generating, by the i th node based on the first quantum key corresponding to the i th node and the second quantum key corresponding to the i th node, a third quantum key corresponding to the i th node on the target routing path;

encrypting, by the i th node by using the third quantum key, a first ciphertext received from the (i−1) th node to obtain a second ciphertext; and

sending, by the i th node, the second ciphertext corresponding to the i th node to the (i+1) th node, wherein the first ciphertext is the second ciphertext sent by and corresponding to the (i−1) th node, and when i=1, a 0 th node is a source node on the target routing path, and the second ciphertext corresponding to the 0 th node is obtained by encrypting a quantum key to be shared between the source node and a destination node on the target routing path by using a second quantum key of the N second quantum keys corresponding to the source node, wherein

a second quantum key of the N second quantum keys corresponding to the (i−1) th node is same as the first quantum key corresponding to the i th node, and the second quantum key corresponding to the i th node is same as a first quantum key corresponding to the (i+1) th node.

18. The non-transitory, computer-readable medium according to claim 17 , the operations further comprising:

sending the third quantum key to a destination node on the target routing path.

US17/069,317

2018-04-13

2020-10-13

Quantum key distribution method and device, and storage medium

Active

2039-10-18

US11595196B2

( en )

Priority Applications (1)

Application Number

Priority Date

Filing Date

Title

US18/166,336

US20230188334A1

( en )

2018-04-13

2023-02-08

Quantum key distribution method and device, and storage medium

Applications Claiming Priority (3)

Application Number

Priority Date

Filing Date

Title

CN201810332715.5

2018-04-13

CN201810332715.5A

CN110380844B

( en )

2018-04-13

2018-04-13

A quantum key distribution method, device and storage medium

PCT/CN2019/082405

WO2019196921A1

( en )

2018-04-13

2019-04-12

Quantum key distribution method, device and storage medium

Related Parent Applications (1)

Application Number

Title

Priority Date

Filing Date

PCT/CN2019/082405

Continuation

WO2019196921A1

( en )

2018-04-13

2019-04-12

Quantum key distribution method, device and storage medium

Related Child Applications (1)

Application Number

Title

Priority Date

Filing Date

US18/166,336

Continuation

US20230188334A1

( en )

2018-04-13

2023-02-08

Quantum key distribution method and device, and storage medium

Publications (2)

Publication Number

Publication Date

US20210044432A1

US20210044432A1 ( en )

2021-02-11

US11595196B2

true

US11595196B2 ( en )

2023-02-28

Family

ID=68164057

Family Applications (2)

Application Number

Title

Priority Date

Filing Date

US17/069,317

Active

2039-10-18

US11595196B2

( en )

2018-04-13

2020-10-13

Quantum key distribution method and device, and storage medium

US18/166,336

Abandoned

US20230188334A1

( en )

2018-04-13

2023-02-08

Quantum key distribution method and device, and storage medium

Family Applications After (1)

Application Number

Title

Priority Date

Filing Date

US18/166,336

Abandoned

US20230188334A1

( en )

2018-04-13

2023-02-08

Quantum key distribution method and device, and storage medium

Country Status (4)

Country

Link

US

( 2 )

US11595196B2

( en )

EP

( 1 )

EP3780482A4

( en )

CN

( 2 )

CN110380844B

( en )

WO

( 1 )

WO2019196921A1

( en )

Cited By (1)

* Cited by examiner, † Cited by third party

Publication number

Priority date

Publication date

Assignee

Title

US20240097892A1

( en )

*

2020-12-10

2024-03-21

Abn Amro Bank N.V.

Orchestrated quantum key distribution

Families Citing this family (25)

* Cited by examiner, † Cited by third party

Publication number

Priority date

Publication date

Assignee

Title

CN109842449B

( en )

*

2017-11-24

2020-11-10

华为技术有限公司

Apparatus and method for generating keys

US20220294618A1

( en )

*

2019-08-12

2022-09-15

British Telecommunications Public Limited Company

Improvements to qkd methods

CN110808835B

( en )

*

2019-11-19

2021-06-29

北京邮电大学

Quantum key distribution network and quantum key distribution method and device

CN110995362B

( en )

*

2019-12-06

2021-06-08

西安电子科技大学

MDI-QKD coding system and method using soft core processor

CN114679257B

( en )

*

2020-12-24

2023-08-22

科大国盾量子技术股份有限公司

Multipath key relay method, transmitting device, receiving device and related equipment

US11652619B2

( en )

*

2021-03-15

2023-05-16

Evolutionq Inc.

System and method for optimizing the routing of quantum key distribution (QKD) key material in a network

CN115189864B

( en )

*

2021-04-07

2025-02-25

南京如般量子科技有限公司

A public quantum key service device, system and method

CN113033828B

( en )

*

2021-04-29

2022-03-22

江苏超流信息技术有限公司

Model training method, using method, system, credible node and equipment

CN113315630B

( en )

*

2021-05-11

2022-09-27

中国联合网络通信集团有限公司

Blockchain, quantum key distribution method and apparatus

CN113328853B

( en )

*

2021-05-25

2023-09-08

成都量安区块链科技有限公司

A consortium chain system that uses quantum keys to improve security

CN113255923B

( en )

*

2021-05-31

2021-09-14

湖北大学

Quantum realization circuit of SM4 algorithm

EP4123957B1

( en )

2021-07-19

2025-05-14

Adva Network Security GmbH

A method and system for performing a secure key relay of an encryption key

KR102778317B1

( en )

*

2021-11-08

2025-03-10

한국과학기술정보연구원

Management apparatus for quantum key, and control method thereof

CN113765665B

( en )

*

2021-11-10

2022-02-08

济南量子技术研究院

Block chain network based on quantum key and data secure transmission method

CN116366238A

( en )

*

2021-12-28

2023-06-30

科大国盾量子技术股份有限公司

A routing processing method and related equipment for a quantum cryptography network

CN114124388B

( en )

*

2022-01-27

2022-05-10

济南量子技术研究院

Gossip protocol synchronization method based on quantum key

KR102814559B1

( en )

*

2022-05-30

2025-05-29

한국과학기술정보연구원

Network apparatus for quantum key distribution, and operation method for quantum key distribution network

CN115021915B

( en )

*

2022-06-20

2024-01-05

中国电信股份有限公司

Key generation method, device, medium and equipment based on intelligent reflective surface

US12316617B2

( en )

*

2022-12-02

2025-05-27

Bank Of America Corporation

System for cloud computing security using a quantum encryption algorithm

FR3143933B1

( en )

*

2022-12-20

2025-09-19

Airbus Defence &amp; Space Sas

METHOD FOR TRANSMITTING CONTENT USING A QUANTUM KEY DISTRIBUTION NETWORK.

FR3145664B1

( en )

*

2023-02-02

2025-09-26

Airbus Defence &amp; Space Sas

IMPROVED METHOD FOR TRANSMITTING CONTENT USING A QUANTUM KEY DISTRIBUTION NETWORK.

CN116155492B

( en )

*

2023-02-22

2026-03-31

中国科学技术大学

A segmented key distribution method and system for hybrid relay QKD networks

CN115913553B

( en )

*

2023-03-08

2023-06-20

广东广宇科技发展有限公司

Data encryption method based on nonlinear mapping

JP2025138206A

( en )

*

2024-03-11

2025-09-25

株式会社東芝

Information processing device, quantum cryptography communication system, information processing method and program

CN119848952B

( en )

*

2025-03-18

2025-10-10

北京捷科智诚科技有限公司

Data security protection method and platform of integrated test service platform

Citations (13)

* Cited by examiner, † Cited by third party

Publication number

Priority date

Publication date

Assignee

Title

US20040184603A1

( en )

2003-03-21

2004-09-23

Pearson David Spencer

Systems and methods for quantum cryptographic key transport

US20050286723A1

( en )

2004-06-28

2005-12-29

Magiq Technologies, Inc.

QKD system network

US20100299526A1

( en )

*

2008-01-25

2010-11-25

Qinetiq Limited

Network having quantum key distribution

US8340298B2

( en )

*

2006-04-18

2012-12-25

Magiq Technologies, Inc.

Key management and user authentication for quantum cryptography networks

US20130208894A1

( en )

2011-08-05

2013-08-15

Fabio Antonio Bovino

Cryptographic key distribution system

CN105471576A

( en )

2015-12-28

2016-04-06

科大国盾量子技术股份有限公司

Quantum key relaying method, quantum terminal nodes and quantum key relaying system

CN105827397A

( en )

2015-01-08

2016-08-03

阿里巴巴集团控股有限公司

Quantum key distribution system, method and device based on trusted relay

CN106330434A

( en )

2015-06-23

2017-01-11

中兴通讯股份有限公司

First quantum node, second quantum node, secure communication architecture system and methods

CN107248913A

( en )

2017-07-28

2017-10-13

浙江九州量子信息技术股份有限公司

A kind of quantum key synchronization system and method based on dynamic group net fault detect

CN107508671A

( en )

2017-08-18

2017-12-22

北京邮电大学

Service communication method and device based on quantum key distribution

US20190074961A1

( en )

*

2017-09-07

2019-03-07

Kabushiki Kaisha Toshiba

Communication apparatus, communication method, and computer program product

US20190260581A1

( en )

*

2016-11-04

2019-08-22

Huawei Technologies Co., Ltd.

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

US11196550B2

( en )

*

2019-02-22

2021-12-07

Kabushiki Kaisha Toshiba

Secure communication network

2018

2018-04-13

CN

CN201810332715.5A

patent/CN110380844B/en

active

Active

2018-04-13

CN

CN202110057600.1A

patent/CN112865964B/en

active

Active

2019

2019-04-12

EP

EP19786235.2A

patent/EP3780482A4/en

active

Pending

2019-04-12

WO

PCT/CN2019/082405

patent/WO2019196921A1/en

not_active

Ceased

2020

2020-10-13

US

US17/069,317

patent/US11595196B2/en

active

Active

2023

2023-02-08

US

US18/166,336

patent/US20230188334A1/en

not_active

Abandoned

Patent Citations (15)

* Cited by examiner, † Cited by third party

Publication number

Priority date

Publication date

Assignee

Title

WO2004086666A2

( en )

2003-03-21

2004-10-07

Bbnt Solutions Llc

Systems and methods for quantum cryptographic key transport

US20040184603A1

( en )

2003-03-21

2004-09-23

Pearson David Spencer

Systems and methods for quantum cryptographic key transport

US20050286723A1

( en )

2004-06-28

2005-12-29

Magiq Technologies, Inc.

QKD system network

US8340298B2

( en )

*

2006-04-18

2012-12-25

Magiq Technologies, Inc.

Key management and user authentication for quantum cryptography networks

US20100299526A1

( en )

*

2008-01-25

2010-11-25

Qinetiq Limited

Network having quantum key distribution

US20130208894A1

( en )

2011-08-05

2013-08-15

Fabio Antonio Bovino

Cryptographic key distribution system

US20160248581A1

( en )

*

2015-01-08

2016-08-25

Alibaba Group Holding Limited

Quantum key distribution system, method and apparatus based on trusted relay

CN105827397A

( en )

2015-01-08

2016-08-03

阿里巴巴集团控股有限公司

Quantum key distribution system, method and device based on trusted relay

CN106330434A

( en )

2015-06-23

2017-01-11

中兴通讯股份有限公司

First quantum node, second quantum node, secure communication architecture system and methods

CN105471576A

( en )

2015-12-28

2016-04-06

科大国盾量子技术股份有限公司

Quantum key relaying method, quantum terminal nodes and quantum key relaying system

US20190260581A1

( en )

*

2016-11-04

2019-08-22

Huawei Technologies Co., Ltd.

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

CN107248913A

( en )

2017-07-28

2017-10-13

浙江九州量子信息技术股份有限公司

A kind of quantum key synchronization system and method based on dynamic group net fault detect

CN107508671A

( en )

2017-08-18

2017-12-22

北京邮电大学

Service communication method and device based on quantum key distribution

US20190074961A1

( en )

*

2017-09-07

2019-03-07

Kabushiki Kaisha Toshiba

Communication apparatus, communication method, and computer program product

US11196550B2

( en )

*

2019-02-22

2021-12-07

Kabushiki Kaisha Toshiba

Secure communication network

Non-Patent Citations (13)

* Cited by examiner, † Cited by third party

Title

Chen et al., " Metropolitan all-pass and inter-city quantum communication network, " Optics Express, vol. 18, No. 26, Dec. 20, 2010, 9 pages.

Elliott, " Building the quantum network, " New Journal of Physics, vol. 4, No. 1, Jul. 12, 2002, 13 pages.

Extended European Search Report issued in European Application No. 197886235.2 dated May 4, 2021, 10 pages.

Han Wei et al., " QKD Network Routing Research Based on Trust Relay, " Journal of Military Communications Technology, vol. 34 No. 4, Dec. 2013, 7 pages (with English abstract).

Office Action issued in Chinese Application No. 201810332715.5 dated May 8, 2020, 12 pages (with English translation).

PCT International Search Report and Written Opinion issued in International Application No. PCT/CN2019/082405 dated Jun. 27, 2019, 14 pages (with English translation).

Peev et al., " The SECOQC quantum key distribution network in Vienna, " New Journal of Physics vol. 11, No. 7, Jul. 2009, 38 pages.

Quoc et al., " A New Proposal for QKD Relaying Models, " 2008 Proceedings of 17th International Conference on Computer Communications and Networks, Nov. 17, 2008, 6 pages.

Sasaki et al., " Field test of quantum key distribution in the Tokyo QKD Network, " Optics Express, vol. 19, No. 11, May 23, 2011, 23 pages.

Schartner et al., " How to overcome the Trusted Node Model in Quantum Cryptography, " 2009 International Conference on Computational Science and Engineering, Aug. 2009, 4 pages.

Wang et al., " 25 MHz clock continuous-variable quantum key distribution system over 50km fiber channel, " Scientific Reports, Sep. 30, 2015, 8 pages.

Y. Tanizawa, R. Takahashi and A. R. Dixon, " A routing method designed for a Quantum Key Distribution network, " 2016 Eighth International Conference on Ubiquitous and Future Networks (ICUFN), 2016, pp. 208-214, doi: 10.1109/ICUFN.2016.7537018. (Year: 2016).

*

Zhao Hong-tao et al., " Multi-path Quantum Key-negotiation Technique Based on Bit-negotiation, " Journal of Zhongyuan University of Technology, vol. 25 No. 6, Dec. 2014, 4 pages (with English abstract).

Cited By (2)

* Cited by examiner, † Cited by third party

Publication number

Priority date

Publication date

Assignee

Title

US20240097892A1

( en )

*

2020-12-10

2024-03-21

Abn Amro Bank N.V.

Orchestrated quantum key distribution

US12348623B2

( en )

*

2020-12-10

2025-07-01

Abn Amro Bank N.V.

Orchestrated quantum key distribution

Also Published As

Publication number

Publication date

US20230188334A1

( en )

2023-06-15

EP3780482A1

( en )

2021-02-17

CN110380844A

( en )

2019-10-25

CN110380844B

( en )

2021-01-29

US20210044432A1

( en )

2021-02-11

EP3780482A4

( en )

2021-06-02

WO2019196921A1

( en )

2019-10-17

CN112865964B

( en )

2024-04-12

CN112865964A

( en )

2021-05-28

Similar Documents

Publication

Publication Date

Title

US20230188334A1

( en )

2023-06-15

Quantum key distribution method and device, and storage medium

CN113033828B

( en )

2022-03-22

Model training method, using method, system, credible node and equipment

Kales et al.

2019

Mobile private contact discovery at scale

CN107689947B

( en )

2021-03-30

Data processing method and device

US9503257B2

( en )

2016-11-22

Quantum key distribution device, quantum key distribution system, and quantum key distribution method

WO2020259635A1

( en )

2020-12-30

Method and apparatus for sharing blockchain data

CN110581763B

( en )

2022-07-15

A quantum key service blockchain network system

CN110661620B

( en )

2022-04-01

Shared key negotiation method based on virtual quantum link

CN113765665B

( en )

2022-02-08

Block chain network based on quantum key and data secure transmission method

JP2019535153A

( en )

2019-12-05

Method and system for quantum key distribution based on trusted computing

WO2016136024A1

( en )

2016-09-01

Key replacement direction control system, and key replacement direction control method

CN113765664A

( en )

2021-12-07

Blockchain network security communication method based on quantum key

CN115276981B

( en )

2025-01-03

Quantum key distribution method, device and computer readable storage medium

CN107666491A

( en )

2018-02-06

The data transmission method of air-ground integrated network based on symmetric cryptography

CN111385090B

( en )

2023-03-10

Key distribution method and system based on multi-key combination quantum key relay

Pan et al.

2023

Secure control using homomorphic encryption and efficiency analysis

US20120179902A1

( en )

2012-07-12

Network key update system, a server, a network key update method and a recording medium

JP2025542096A

( en )

2025-12-25

System and method for distribution of key generation data in a secure network

CN116405320B

( en )

2023-08-22

Data transmission method and device

CN104509025B

( en )

2017-10-20

System and method for mixing multi-source decryption

Deryabin et al.

2019

Protocol for secure and reliable data transmission in MANET based on modular arithmetic

CN116155492A

( en )

2023-05-23

A segmented key distribution method and system for hybrid relay QKD network

CN116015738A

( en )

2023-04-25

Privacy-protected anonymous network node query method, device, equipment and medium

CN115884174A

( en )

2023-03-31

Information processing method, device, equipment and medium

US2

Related documents

• Big data-based autonomous flight drone system and autonomous flight method … — Rgblab Co., Ltd. (US20210390867A1)#653964
• Generating augmented reality experiences utilizing physical objects to … — Meta Platforms Technologies, Llc (US20260037214A1)#653960
• Virtual reality system using multiple force arrays for a solver — DeepMotion, Inc. (US10657696B2)#653961
• Tracking position of device inside-out for virtual reality interactivity — Sony Interactive Entertainment America Llc (US10535153B2)#653962
• Augmented reality system with spatialized audio tied to user manipulated … — Magic Leap, Inc. (US11231770B2)#653963