CN117176345B - Quantum cryptography network key relay dynamic routing method, device and system - Google Patents

Abstract

The invention discloses a quantum cryptography network key relay dynamic routing method, device and system. The method includes querying all reachable key relay paths in the quantum cryptography network; selecting each key relay path on the key relay path. The relay node generates a derived key pool for the business assigned to the key relay path; based on the number of derived key pools generated by each relay node on each key relay path and the key generation speed , calculate the path weight of each relay node of each key relay path; determine the optimal key based on the maximum path weight and the number of relay nodes on each key relay path. relay path; the invention solves the key generation rate bottleneck problem of key relay, has a simple route calculation method and improves concurrency performance.

Description

Quantum cryptography network key relay dynamic routing method, device and system

Technical field

The invention relates to the field of quantum communication technology, and in particular to a quantum cryptographic network key relay dynamic routing method, device and system.

Background technique

Quantum communication is a new interdisciplinary subject developed in the past two decades. It is a new research field that combines quantum theory and information theory. In physics, quantum communication can be understood as high-performance communication using quantum effects under physical limits. In informatics, it is believed that quantum communication uses the basic principles of quantum mechanics (such as the principle of non-cloning of quantum states and the measurement collapse properties of quantum states, etc.) or the unique properties of quantum systems such as quantum state teleportation, as well as quantum measurement methods. Complete information transfer between the two places. Quantum communication has brought revolutionary development to information security because of its unconditional security and high efficiency. It is currently the main research direction for secure data transmission.

Quantum cryptography technology based on the Quantum Key Distribution (QKD) protocol is one of the most important practical applications of quantum communication at this stage. Traditional cryptography is a cryptography system based on mathematics, while quantum cryptography is based on quantum mechanics. Its security is based on physical properties such as the uncertainty principle, quantum non-cloning and quantum coherence, which has been proven It is absolutely safe, so quantum cryptography technology has attracted great attention from the academic community.

Quantum cryptography network is a secure communication network that uses quantum cryptography technology. The quantum cryptography network is constructed by a classical communication network and a quantum key distribution network. The quantum key distribution network is mainly composed of quantum key distribution terminal equipment and quantum links, which are used for key distribution. Classical communication networks use quantum keys to encrypt and decrypt data and transmit encrypted data. A quantum cryptography network node is generally composed of a classical communication terminal connected to a classical communication network and a quantum key distribution equipment terminal connected to a quantum communication network. The network nodes of a quantum cryptography network are generally divided into terminal nodes and relay nodes. Due to the limitation of the maximum distance of quantum communication and the cost of network construction, there are no direct quantum links between many terminals, and the direct distribution of quantum keys cannot be achieved. The encrypted communication data between them requires the use of relays. Node forwarding.

A large-scale quantum cryptography network will have a large number of relay nodes. Encrypted communication data between terminal nodes will be relayed through one or several relay nodes, and there will be different optional relay nodes during data transfer. How to select the relay nodes that the communication data of any two nodes in the quantum cryptography network must pass through in order from the initial node to the destination node is called quantum cryptography network routing.

In related technology, the patent application document with publication number CN103001875A discloses a complete solution for quantum cryptographic network routing. In this solution, it is necessary to calculate and determine the destination relay node as any other relay according to the weighted shortest path rule. The weight of the next hop route of the node's communication data is the key amount on the path. That is, under the shortest path rule, the path with a larger key amount is the next hop of the route. The patent application document with publication number CN109962774A discloses a dynamic routing method for quantum cryptography network key relay. In this routing method, the path weight of the relay path is related to the degree of supply and demand of quantum keys on the path. It requires Using the complex Poisson distribution, the routing weight calculation method is complex. The route establishment method proposed in the patent application document with publication number CN116418492A requires attention to the amount of remaining keys that can be relayed, and the calculation is complicated.

In fact, the amount of keys on the path cannot truly reflect the path's ability to meet the data routing encryption requirements in the next routing cycle, because whether the amount of existing keys on the path is sufficient is not only related to the amount of keys, but also to the path. related to the speed of key consumption. The related technologies mentioned above do not consider the problem of low code rate of long-distance QKD relay and the situation that the key generation speed is lower than the key consumption speed and cannot meet the business concurrency requirements. For example: at a distance of about one hundred kilometers, based on The QKD key code rate of the BB84 protocol is only about 1 Kbps. The low QKD code rate is determined by physical principles. QKD key negotiation requires the preparation, transmission, polarization filtering, detection, and polarization state of photons. A series of operations such as consistency check, key block parity check, etc. This complex process will further reduce the code rate of QKD.

In addition, complex routing calculation algorithms have performance degradation problems caused by competition for key relay resources in high concurrency scenarios.

Contents of the invention

The technical problem to be solved by the present invention is how to solve the key generation rate bottleneck problem of key relay.

The present invention solves the above technical problems through the following technical means:

In a first aspect, the present invention proposes a quantum cryptography network key relay dynamic routing method, which method includes:

Query all reachable key relay paths in the quantum cryptography network;

Select each relay node on the key relay path to generate a derived key pool for tasks assigned to the key relay path;

Calculate the path weight of each relay node of each key relay path based on the number of derived key pools generated by each relay node on each key relay path and the key generation speed;

The optimal key relay path is determined based on the maximum path weight and the number of relay nodes on each key relay path.

Further, the query for all reachable key relay paths in the quantum cryptography network includes:

Query the password management service platform for information about the QKD node to which the local business system belongs and the QKD node to which the opposite business system belongs;

Receive the information returned by the password management service platform about the QKD node to which the local business system belongs and the information about the QKD node to which the opposite business system belongs, and query the QKDN controller through the key manager corresponding to the QKD node to which the local business system belongs. Describe all reachable key relay paths in the quantum cryptography network.

Further, each relay node on the selected key relay path generates a derived key pool for the tasks assigned to the key relay path, including:

The local business system generates a globally unique business identifier businessId, and selects each relay node on the key relay path to initialize and generate a derived key pool related to the businessId;

Allocate at least 1 derived key pool for services assigned to the current key relay path.

Furthermore, the derived key pools between different services are isolated from each other.

Further, the method also includes:

Expand the derived key pool according to the expansion trigger condition of the derived key pool;

The expansion triggering condition is when the key consumption rate of the business reaches a% of the key generation rate, or when the stock keys of the derived key pool are lower than the threshold, or when the used derived key pool reaches the total derived key level. When b% of the key pool.

Further, the method also includes:

Shrink the derived key pool according to the shrinkage triggering condition of the derived key pool;

The shrinkage triggering condition is when the key consumption speed of m consecutive time window services is lower than c% of the key generation speed, or when the used derived key pool is lower than d% of the overall derived key pool.

Further, the derived key pool is a first-in-first-out queue FIFO structure with a maximum length.

Further, the method also includes:

Use the PBKDF2 algorithm to generate the derived key;

Add a set number n of the derived keys to the derived key pool by batch enqueuing, and remove n original derived keys in the derived key pool as historical derived keys, Update keys in the derived key pool.

Further, the calculation formula for generating a derived key using the PBKDF2 algorithm is:

key=PBKDF2(password,salt,iterations-count,hash-function,derived-key-len)

Among them, password is the password/password; salt is a cryptographically secure pseudo-random array; iterations-count is the number of iterations; hash-function is the hash function used for HMAC; derived-key-len is the derived key length; PBKDF2( ) It is the PBKDF2 operation; key is the derived key.

Further, use the random key in the master key pool generated by the QKD relay as the password;

use As the salt;

Use the business key pool number as the iterations-count, and use the SM3 algorithm as the hash-function;

The value of derived-key-len is 128.

Further, when the business concurrently calls to derive the key, the method also includes:

Hash according to the business identifier to distribute the derived key to the derived key pool corresponding to the business;

The CAS lock-free mechanism is used to make concurrent calls to the derived key pool corresponding to the same business.

Further, the CAS lock-free mechanism is used to concurrently call the derived key pool corresponding to the same business, including:

Allocate a unique sequence number to the same derived key pool, and add 1 to the service number corresponding to the service that has passed the CAS lock-free mechanism;

Pass the service number, derived key pool number, and key number of the derived key pool as parameters to the peer business system of QKD relay/negotiation to perform derived key relay.

Further, when the keys in the derived key pool are updated, the CAS number is +n, and the removed n historical derived keys are retained for a set duration.

Further, the path of each relay node of each key relay path is calculated based on the number of derived key pools generated by each relay node on each key relay path and the key generation speed. Weights, including:

The path weight of each relay node is calculated based on the sliding window as: the number of derived key pools generated by the relay node/key generation speed.

Further, when the relay node does not perform key derivation, the number of derived key pools corresponding to the relay node is set to 1.

Further, determining the optimal key relay path based on the maximum path weight and the number of relay nodes on each key relay path includes:

According to the maximum path weight and the number of relay nodes on each key relay path, calculate the weight of the corresponding key relay path P = number of relay nodes λw, λ is the empirical value of the proportion of control weight, w is the largest path weight on the key relay path,/> is the multiplication sign;

The key relay path with the smallest weight P value is determined as the optimal key relay path.

In a second aspect, the present invention also proposes a quantum cryptography network key relay dynamic routing device, which includes:

Relay path query module, used to query all reachable key relay paths in the quantum cryptography network;

A derivation module, configured to select each relay node on the key relay path to generate a derived key pool for tasks assigned to the key relay path;

The path weight calculation module is used to calculate the number of derived key pools generated by each relay node on each key relay path and the key generation speed. The path weight of the node;

A path determination module is used to determine the optimal key relay path based on the maximum path weight and the number of relay nodes on each key relay path.

In the third aspect, the present invention proposes a quantum cryptographic network key relay dynamic routing system. The system includes a quantum key distribution network, a key manager, a QKDN controller, a key management system and a password management service platform. The password management service platform is connected to a business communication terminal, and the business communication terminal is used to execute the quantum cryptography network key relay dynamic routing method as described above.

The advantages of the present invention are:

(1) The present invention uses the relay nodes on the key relay path to generate a derived key pool for the tasks assigned to the key relay path, and uses the number of derived key pools and keys generated by the relay nodes. Generation speed, calculate the path weight of each relay node of each key relay path, thereby determining the optimal key relay path. The routing calculation method is simple and has higher performance. Different services use separate key pools. There is no need to consider the problem of concurrent locking of multiple services sharing a key pool, solving the key generation rate bottleneck problem of key relay, and the route calculation method is simple, improving concurrency performance.

Additional aspects and advantages of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.

Description of the drawings

Figure 1 is a schematic flow chart of a quantum cryptography network key relay dynamic routing method proposed by an embodiment of the present invention;

Figure 2 is a schematic structural diagram of a quantum cryptography network key relay dynamic routing device proposed by an embodiment of the present invention;

Figure 3 is a schematic structural diagram of a quantum cryptography network key relay dynamic routing system proposed by an embodiment of the present invention.

Detailed ways

In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the embodiments of the present invention. Obviously, the described embodiments are part of the present invention. Examples, not all examples. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without making creative efforts fall within the scope of protection of the present invention.

As shown in Figure 1, the first embodiment of the present invention discloses a quantum cryptography network key relay dynamic routing method. The method includes the following steps:

S10. Query all reachable key relay paths in the quantum cryptography network;

S20. Select each relay node on the key relay path to generate a derived key pool for the tasks assigned to the key relay path;

S30. Calculate the path weight of each relay node of each key relay path based on the number of derived key pools generated by each relay node on each key relay path and the key generation speed;

S40. Determine the optimal key relay path based on the maximum path weight and the number of relay nodes on each key relay path.

It should be noted that in this embodiment, the relay node on the key relay path is used to generate a derived key pool for the tasks assigned to the key relay path, and the number of derived key pools generated by the relay node is used. and key generation speed, calculate the path weight of each relay node of each key relay path, thereby determining the optimal key relay path, and breaking through the key generation of QKD relay by using a derived key pool. Code rate bottleneck solves the key generation rate bottleneck problem of key relay.

In one embodiment, the step S10: querying all reachable key relay paths in the quantum cryptography network includes the following steps:

S11. Query the password management service platform for information about the QKD node to which the local business system belongs and the QKD node to which the opposite business system belongs;

S12. Receive the information returned by the password management service platform about the QKD node to which the local business system belongs and the information about the QKD node to which the opposite business system belongs, and provide the information to the QKDN controller through the key manager corresponding to the QKD node to which the local business system belongs. Query all reachable key relay paths in the quantum cryptography network.

Specifically, if business system A serves as the business initiating direction password management service platform (CMSP) to query the QKD node information of this node (starting point) and the opposite end business system B (end point); business system A carries the origin of quantum key network routing The start point and end point information queries the QKDN controller through the key manager (KM) corresponding to this node for all reachable key relay paths in the quantum cryptography network.

In one embodiment, the step S20: selecting each relay node on the key relay path to generate a derived key pool for the tasks assigned to the key relay path includes the following steps: :

S21. The local business system generates a globally unique business identifier businessId, and selects each relay node on the key relay path to initialize and generate a derived key pool related to the businessId;

S22. Allocate at least one derived key pool to the services assigned to the current key relay path.

Specifically, the local business system, that is, the business initiator, generates a globally unique business identifier businessId. The businessId generates a 64-bit unique id according to the snowflake algorithm. The id is of long type, and the highest digit of the business identifier has a fixed value of 0. Next is a 41-bit storage millisecond timestamp, followed by a 12-bit relay node code, including a 6-bit starting node and a 6-bit end point, and then a 6-bit machine code workerId (datacenterId is consistent with the starting node, Therefore, it is omitted), and the last 4 bits store the sequence number; when the same millisecond timestamp is used, it is distinguished by this incremental sequence number. The relay link does not need to be re-established every time the key negotiation is performed, so the concurrency requirements are not that high.

In one embodiment, each relay node on the selected key relay link initializes and generates a derived key pool related to the businessId. The initial generation (Generally n ≥ 3) derived key pools, allocate at least 1 derived key pool to the services that have been assigned to the current key relay path, and the derived key pools between services are isolated from each other.

In one embodiment, the method further includes the following steps:

Expand the derived key pool according to the expansion trigger condition of the derived key pool;

The expansion triggering condition is when the key consumption rate of the business reaches a% of the key generation rate, or when the stock keys of the derived key pool are lower than the threshold, or when the used derived key pool reaches the total derived key level. When b% of the key pool.

Specifically, when the key consumption rate of the business reaches 75% of the key generation rate, a 2-fold expansion of the derived key pool is triggered or the existing keys in the derived key pool are lower than the threshold (such as the maximum length of the derived key pool). 10%) triggers a 2-fold expansion, and when the used derived key pool reaches 80% of the overall derived key pool, a 2-fold expansion of the overall derived key pool is triggered. This embodiment improves the concurrency capability by expanding the derived key pool, so as to allocate resources in advance to prevent waiting for key derivation during business use.

In one embodiment, the method further includes the following steps:

Shrink the derived key pool according to the shrinkage triggering condition of the derived key pool;

The shrinkage triggering condition is when the key consumption speed of m consecutive time window services is lower than c% of the key generation speed, or when the used derived key pool is lower than d% of the overall derived key pool.

Specifically, when the key consumption speed of the business in consecutive m (m is an empirical value, ranging from 3 to 5) time windows is lower than 25% of the key generation speed, a 2-fold reduction is triggered. When the used When the derived key pool is less than 20% of the overall derived key pool, a 2-fold reduction in the overall derived key pool is triggered to release resources and reduce costs.

In one embodiment, the derived key pool is a first-in-first-out queue FIFO structure with a maximum length.

Specifically, the derived key pool in this embodiment is a FIFO (first in first out queue) structure with a maximum length of 40k (40960) keys. When the derived key pool reaches the maximum length, a new derived key is added to the queue At the end, the derived key at the head of the queue is discarded. If the maximum length of the derived key pool is too long, the derived key will last longer, and there is a risk of being cracked by brute force. If the maximum length is too short, there will be a problem with the derived key pool. In the case of frequent expansion or business requesting key use and waiting for QKD key negotiation, the maximum length in the derived key pool generally adopts the key generation amount of the master key pool within 5 to 10 seconds.

In this embodiment, the derived key pool is a FIFO structure with a maximum length. A reasonable maximum length can protect the validity of the derived key and prevent brute force cracking.

In one embodiment, the method further includes updating the key in the derived key pool, including the following steps:

Use the PBKDF2 algorithm to generate the derived key;

Add a set number n of the derived keys to the derived key pool by batch enqueuing, and remove n original derived keys in the derived key pool as historical derived keys, Update keys in the derived key pool.

Specifically, as the master key pool of the key negotiation of the QKD key relay continuously negotiates to generate new keys, the derived key pool updates the keys in batches, adding 4k (4096) to the end of the FIFO queue at a time. ) derived keys, and discard the 4k (4096) derived keys at the head of the queue, where n can be 4096.

In one embodiment, the calculation formula for generating a derived key using the PBKDF2 algorithm is:

key=PBKDF2(password,salt,iterations-count,hash-function,derived-key-len)

Among them, password is the password/password; salt is a cryptographically secure pseudo-random array; iterations-count is the number of iterations; hash-function is the hash function used for HMAC; derived-key-len is the derived key length; PBKDF2( ) It is the PBKDF2 operation; key is the derived key.

In one embodiment, a random key in the master key pool generated by the QKD relay is used as the password;

use As the salt can increase randomness;

Use the business key pool number as the iterations-count and SM3 as the hash-function;

The value of derived-key-len is 128.

It should be noted that the PBKDF2 (Password-Based Key Derivation Function) algorithm is a simple key derivation algorithm with high key generation efficiency when the number of iterations is low to meet the needs of high-concurrency business scenarios. . And because the trusted relay nodes are independent physical machines, there is no shared computing problem similar to the cloud. The QKD network between nodes is also different from the classic channel, so memory-timing side channel attacks can not be considered. -threats posed by channel attacks).

In addition, since the password derived from the key is a truly random number, the salt value is related to the business, and the derived keys for different services are isolated. The XOR of the salt value and the password ensures the randomness of the salt. At the same time, the key relay process is One-time padding is discarded after use. The derived key pool uses a FIFO queue structure with a maximum length and is time-limited. Therefore, even if it is attacked by ASIC (ASIC-resistant) or FPGA (FPGA-resistant), on the one hand The timeliness of GPU brute force cracking cannot meet the attack requirements. On the other hand, it is necessary to brute force the derived key of the entire relay link to obtain the final negotiation key. The exposure of the derived key between individual nodes does not affect the overall security. .

In one embodiment, when the business concurrently calls to derive the key, the method further includes the following steps:

Hash according to the business identifier to distribute the derived key to the derived key pool corresponding to the business;

The CAS lock-free mechanism is used to make concurrent calls to the derived key pool corresponding to the same business.

In this embodiment, when the business calls the derived key concurrently, Hash is performed based on the unique business identifier to distribute it to the derived key pool corresponding to the business. The same business derived key pool uses the lock-free CAS (Compare And Swap) method during concurrent calls. This method speeds up key calling efficiency by separating key negotiation and key usage, and uses CAS's lock-free method to improve concurrency efficiency when calling.

In one embodiment, the CAS lock-free mechanism is used to concurrently call the derived key pool corresponding to the same business, including:

Allocate a unique sequence number to the same derived key pool, and add 1 to the service number corresponding to the service that has passed the CAS lock-free mechanism;

Pass the service number, derived key pool number, and key number of the derived key pool as parameters to the peer business system of QKD relay/negotiation to perform derived key relay.

It should be noted that this embodiment allocates a unique sequence number to the same derived key pool. The business obtains the number + 1 through CAS, and uses the business number, the derived key pool number, and the key number of the derived key pool as parameters. Passed to the QKD relay/negotiation peer to avoid confusion in the order of derived key calls.

In one embodiment, when the keys in the derived key pool are updated, the CAS number is +n, and the removed n historical derived keys are retained for a set duration.

In this embodiment, the CAS number is +4096 when the derived keys are updated in batches. In order to prevent the derived keys from being relayed during the batch update of derived keys, the 4096 historical derived keys that have been dequeued are temporarily retained, and the CAS number is reset to zero every day.

It should be noted that the retention time of historical derived keys is related to the key generation speed. The generation time of 4096 keys generally does not exceed 5 seconds. If the generation rate is particularly slow, the maximum time for security is no more than 10 seconds.

In one embodiment, the step S30: Calculate each key relay path based on the number of derived key pools generated by each relay node on each key relay path and the key generation speed. The path weight of each relay node includes the following steps:

The path weight of each relay node is calculated based on the sliding window as: the number of derived key pools generated by the relay node/key generation speed.

It should be noted that if there are multiple relay paths, the path weights of all relay nodes on the key relay path are calculated based on the sliding window: number of derived key pools/key generation speed, the greater the weight Small paths are shorter.

Further, if the relay node does not perform any key derivation, the number of derived key pools is set to 1.

In one embodiment, the step S40: Determine the optimal key relay path based on the maximum path weight and the number of relay nodes on each key relay path, including the following steps:

S41. Based on the maximum path weight and the number of relay nodes on each key relay path, calculate the weight of the corresponding key relay path P = number of relay nodes λw, λ is the empirical value of the proportion of control weight, w is the largest path weight on the key relay path,/> is the multiplication sign;

S42. Determine the key relay path with the smallest weight P value as the optimal key relay path.

It should be noted that according to the barrel effect, find the maximum weight w in each path, and calculate the weight P of each key relay path. The smaller P means the better the path, and the optimal path with the smallest P value is selected. .

As shown in Figure 2, the second embodiment of the present invention discloses a quantum cryptography network key relay dynamic routing device. The device includes:

The relay path query module 10 is used to query all reachable key relay paths in the quantum cryptography network;

The derivation module 20 is configured to select each relay node on the key relay path to generate a derived key pool for the tasks assigned to the key relay path;

The path weight calculation module 30 is used to calculate the weight of each key relay path based on the number of derived key pools generated by each relay node on each key relay path and the key generation speed. The path weight of the following node;

The path determination module 40 is used to determine the optimal key relay path based on the maximum path weight and the number of relay nodes on each key relay path.

In one embodiment, the relay path query module 10 is specifically used to:

Query the password management service platform for information about the QKD node to which the local business system belongs and the QKD node to which the opposite business system belongs;

Receive the information returned by the password management service platform about the QKD node to which the local business system belongs and the information about the QKD node to which the opposite business system belongs, and query the QKDN controller through the key manager corresponding to the QKD node to which the local business system belongs. Describe all reachable key relay paths in the quantum cryptography network.

In one embodiment, the derivation module 20 includes:

An initialization unit, used for the local business system to generate a globally unique business identifier businessId, and select each relay node on the key relay path to initialize and generate a derived key pool related to the businessId;

The allocation unit is used to allocate at least 1 derived key pool for services allocated to the current key relay path.

In one embodiment, the derived key pools between different services are isolated from each other.

In one embodiment, the device further includes a capacity expansion module, specifically used for:

Expand the derived key pool according to the expansion trigger condition of the derived key pool;

The expansion triggering condition is when the key consumption rate of the business reaches a% of the key generation rate, or when the stock keys of the derived key pool are lower than the threshold, or when the used derived key pool reaches the total derived key level. When b% of the key pool.

In one embodiment, the device further includes a capacity reduction module, specifically used for:

Shrink the derived key pool according to the shrinkage triggering condition of the derived key pool;

The shrinkage triggering condition is when the key consumption speed of m consecutive time window services is lower than c% of the key generation speed, or when the used derived key pool is lower than d% of the overall derived key pool.

In one embodiment, the derived key pool is a first-in-first-out queue FIFO structure with a maximum length.

In one embodiment, the device further includes a key update module, specifically used for:

Use the PBKDF2 algorithm to generate the derived key;

Add a set number n of the derived keys to the derived key pool by batch enqueuing, and remove n original derived keys in the derived key pool as historical derived keys, Update keys in the derived key pool.

In one embodiment, the calculation formula for generating a derived key using the PBKDF2 algorithm is:

key=PBKDF2(password,salt,iterations-count,hash-function,derived-key-len)

Among them, password is a password or password; salt is a cryptographically secure pseudo-random array; iterations-count is the number of iterations; hash-function is the hash function used for HMAC; derived-key-len is the derived key length; PBKDF2( ) It is the PBKDF2 operation; key is the derived key.

In one embodiment, a random key in the master key pool generated by the QKD relay is used as the password;

use As the salt;

Use the business key pool number as the iterations-count and SM3 as the hash-function;

The value of derived-key-len is 128.

In one embodiment, the device further includes a key calling module for:

A derived key distribution unit, configured to perform Hash according to the service identifier to distribute the derived key to the derived key pool corresponding to the service;

The calling unit is used to make concurrent calls to the derived key pool corresponding to the same business using the CAS lock-free mechanism.

In one embodiment, the calling unit is specifically used to:

Allocate a unique sequence number to the same derived key pool, and add 1 to the service number corresponding to the service that has passed the CAS lock-free mechanism;

Pass the service number, derived key pool number, and key number of the derived key pool as parameters to the peer business system of QKD relay/negotiation to perform derived key relay.

In one embodiment, when the keys in the derived key pool are updated, the CAS number is +n, and the removed n historical derived keys are retained for a set duration.

In one embodiment, the path weight calculation module 30 is configured to calculate the path weight of each relay node based on the sliding window as: the number of derived key pools generated by the relay node/key generation speed.

In one embodiment, when the relay node does not perform key derivation, the number of derived key pools corresponding to the relay node is set to 1.

In one embodiment, the path determination module 40 includes:

A weight calculation unit, used to calculate the weight of the corresponding key relay path based on the maximum path weight and the number of relay nodes on each key relay path P = number of relay nodes λw, λ is the empirical value of the proportion of control weight, w is the largest path weight on the key relay path,/> is the multiplication sign;

The path determination unit is used to determine the key relay path with the smallest weight P value as the optimal key relay path.

It should be noted that for other embodiments of the quantum cryptography network key relay dynamic routing device of the present invention or implementation methods, please refer to the above method embodiments, and no redundancy is required here.

As shown in Figure 3, the third embodiment of the present invention discloses a quantum cryptography network key relay dynamic routing system. The system includes a quantum key distribution network, a key manager, a QKDN controller, and a key management system. And the password management service platform, the quantum key distribution network is connected to the key management system through the key manager, the key manager is connected to the QKDN controller, the password management service platform is connected to the business communication terminal, and the business communication terminal is used for The quantum cryptography network key relay dynamic routing method as described in the first embodiment is executed.

Specifically, the quantum key distribution module (QKD) is used to implement quantum key distribution with the quantum key distribution module of the connecting node, so that both parties can obtain a key pair.

The Key Manager (KM) is responsible for receiving and managing keys generated by QKD, relaying keys and providing keys to applications that require passwords.

The QKDN controller is used to control various resources of the QKD network to ensure the safe, stable, efficient and robust operation of the QKD network.

Key management system (KMS) is responsible for creating and managing keys, protecting the confidentiality, integrity and availability of keys, and meeting the key management needs of applications and businesses.

The Password Management Service Platform (CMSP) is responsible for the routing control, resource scheduling, etc. of the Key Management System (KMS).

In the description of this specification, reference to the terms "one embodiment," "some embodiments," "an example," "specific examples," or "some examples" or the like means that specific features are described in connection with the embodiment or example. , structures, materials or features are included in at least one embodiment or example of the invention. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.

In addition, the terms “first” and “second” are used for descriptive purposes only and cannot be understood as indicating or implying relative importance or implicitly indicating the quantity of indicated technical features. Therefore, features defined as "first" and "second" may explicitly or implicitly include at least one of these features. In the description of the present invention, "plurality" means at least two, such as two, three, etc., unless otherwise expressly and specifically limited.

Although the embodiments of the present invention have been shown and described above, it can be understood that the above-mentioned embodiments are illustrative and should not be construed as limitations of the present invention. Those of ordinary skill in the art can make modifications to the above-mentioned embodiments within the scope of the present invention. The embodiments are subject to changes, modifications, substitutions and variations.

Claims (18)

1. A quantum cryptography network key relay dynamic routing method, the method comprising:

inquiring all reachable key relay paths in the quantum cryptography network;

each relay node on the key relay path is selected to generate a derived key pool for the service distributed to the key relay path;

calculating the path weight of each relay node of each key relay path according to the number of derivative key pools generated by each relay node on each key relay path and the key generation speed;

and determining an optimal key relay path according to the maximum path weight value and the number of relay nodes on each key relay path.

2. The quantum cryptography network key relay dynamic routing method of claim 1, wherein querying all reachable key relay paths in the quantum cryptography network comprises:

inquiring information of a QKD node to which a local service system belongs and a QKD node to which a peer service system belongs from a password management service platform;

and receiving the information of the QKD node to which the local end service system belongs and the information of the QKD node to which the opposite end service system belongs, which are returned by the password management service platform, and inquiring all reachable key relay paths in the quantum password network to a QKDN controller through a key manager corresponding to the QKD node to which the local end service system belongs.

3. The method of claim 1, wherein each relay node on the selected key relay path generates a derived key pool for traffic allocated on the key relay path, comprising:

the local terminal service system generates a globally unique service identifier businessId, and each relay node on the key relay path is selected to generate a derivative key pool related to the businessId in an initializing mode;

at least 1 derived key pool is allocated for traffic allocated to the current key relay path.

4. A quantum cryptography network key relay dynamic routing method of claim 3 wherein the pools of derivative keys between different services are isolated from each other.

5. The quantum cryptography network key relay dynamic routing method of claim 1, further comprising:

expanding the capacity of the derived key pool according to the capacity expansion triggering condition of the derived key pool;

the capacity expansion triggering condition is when the key consumption speed of the service reaches a% of the key generation speed, or when the stock key of the derived key pool is lower than a threshold value, or when the used derived key pool reaches b% of the total derived key pool.

6. The quantum cryptography network key relay dynamic routing method of claim 1, further comprising:

carrying out capacity reduction on the derivative key pool according to the capacity reduction triggering condition of the derivative key pool;

the capacity reduction triggering condition is when the consumed key speed of continuous m time window services is lower than c% of the key generation speed, or when the used derivative key pool is lower than d% of the total derivative key pool.

7. The method of claim 1, wherein the derived key pool is a FIFO structure having a maximum length.

8. The quantum cryptography network key relay dynamic routing method of claim 1, further comprising:

generating a derivative key by adopting a PBKDF2 algorithm;

and adding the set number n of the derivative keys into the derivative key pool by adopting a batch enqueuing mode, removing n original derivative keys in the derivative key pool as historical derivative keys, and updating keys in the derivative key pool.

9. The method for dynamically routing the quantum cryptography network key relay of claim 8, wherein the calculation formula for generating the derivative key by using the PBKDF2 algorithm is as follows:

key=PBKDF2(password,salt,iterations-count,hash-function,derived-key-len)

wherein, the password is a password or a password; salt is a cryptographically secure pseudorandom number group; the iteration-count is the iteration number; hash-function is a hash function for HMAC; the derived-key-len is the derived key length; PBKDF2 () is the operation of PBKDF 2; key is a derivative key.

10. The quantum cryptography network key relay dynamic routing method of claim 9, wherein a random key in a master key pool generated by QKD relay is employed as the password;

by usingAs said salt,/->Is an exclusive or operation, | is a byte string connector;

taking a service key pool number as the interfaces-count, and taking an SM3 algorithm as the hash-function;

the determined-key-len takes a value of 128.

11. The quantum cryptography network key relay dynamic routing method of claim 1, wherein upon a traffic concurrency invocation of a derivative key, the method further comprises:

carrying out Hash according to the service identification to distribute the derivative key to a derivative key pool corresponding to the service;

and (3) adopting a CAS (control and access system) unlocking mechanism to carry out concurrent call on the derivative key pool corresponding to the same service.

12. The method for dynamically routing the quantum cryptography network key relay of claim 11, wherein the employing the CAS airless mechanism to make a concurrent call to the derivative key pool corresponding to the same service comprises:

a unique sequence number is allocated to the same derived key pool, and the service number +1 corresponding to the service passing through the CAS (CAS) non-lock mechanism is allocated;

and transmitting the service number, the derived key pool number and the key number of the derived key pool as parameters to a QKD relay or a negotiated opposite-end service system to perform the derived key relay.

13. The quantum cryptography network key relay dynamic routing method of claim 8, wherein CAS number +n is updated for keys in the derivative key pool and n history derivative key set durations of shifts are reserved.

14. The method for dynamically routing the key relay of the quantum cryptography network according to claim 1, wherein the calculating the path weight of each relay node of each key relay path according to the number of the derived key pools generated by each relay node on each key relay path and the key generation speed comprises:

the path weight of each relay node is calculated based on the sliding window as follows: the number of derived key pools generated by the relay node +..

15. The method of claim 14, wherein when the relay node does not derive the key, the number of derived key pools corresponding to the relay node is set to 1.

16. The method for dynamic routing of key relay in a quantum cryptography network of claim 1, wherein determining an optimal key relay path based on a maximum path weight and a number of relay nodes on each key relay path comprises:

according to the maximum path weight and the number of relay nodes on each key relay path, calculating the weight P=the number of relay nodes of the corresponding key relay pathλw, λ is the empirical value of the control weight ratio, w is the maximum path weight on the key relay path, +.>Is a multiplied symbol;

and determining the key relay path with the minimum weight P value as the optimal key relay path.

17. A quantum cryptography network key relay dynamic routing apparatus, the apparatus comprising:

the relay path inquiry module is used for inquiring all reachable key relay paths in the quantum cryptography network;

the deriving module is used for selecting each relay node on the key relay path to generate a deriving key pool for the service distributed on the key relay path;

the path weight calculation module is used for calculating the path weight of each relay node of each key relay path according to the number of derivative key pools generated by each relay node on each key relay path and the key generation speed;

and the path determining module is used for determining the optimal key relay path according to the maximum path weight and the number of relay nodes on each key relay path.

18. The system is characterized by comprising a quantum key distribution network, a key manager, a QKDN controller, a key management system and a password management service platform, wherein the password management service platform is connected with a service communication terminal, and the service communication terminal is used for executing the quantum password network key relay dynamic routing method according to any one of claims 1-16.