Shared key establishment method in quantum computing environment

Abstract

The invention discloses a shared key establishment method in a quantum computing environment, which relates to the technical field of shared key establishment, and comprises the following steps: acquiring the cost of each quantum state, generating random numbers by using a quantum random number generator, and counting the average length of the random numbers of different quantum states and the generation quantity per unit time. Preparing a corresponding quantum state key according to the coded random number, and recording the average preparation time of different quantum state keys; calculating error rates of different quantum states; calculating a first key establishment evaluation coefficient according to the random number average length and the unit time generation quantity, calculating a second key establishment evaluation coefficient according to the average preparation time and the error rate, and calculating a comprehensive evaluation index of each quantum state according to the first key establishment evaluation coefficient, the second key establishment evaluation coefficient and the cost of each quantum state, and the key establishment quantum state is determined, so that different application scenes and requirements can be adapted.

Description

Technical Field

[0001] The present invention relates to the technical field of shared key establishment, and specifically to a method for establishing a shared key in a quantum computing environment. Background Art

[0002] With the rapid development of information technology, traditional encryption algorithms are facing increasingly severe challenges in ensuring information security. Quantum computing, with its computing power beyond that of classical computers, poses a potential threat to traditional encryption algorithms based on mathematical problems such as large number factorization and discrete logarithm. Therefore, exploring key establishment methods that can maintain security in a quantum computing environment has become a research hotspot in the field of information security. Traditional key establishment methods, such as the Diffie-Hellman key exchange protocol, rely on the intractability of mathematical problems such as large number factorization and discrete logarithm. However, Shor's algorithm in quantum computing can effectively factor large prime numbers in polynomial time, thus cracking encryption algorithms based on large number factorization. Similarly, quantum algorithms can also accelerate the solution of discrete logarithm problems, making traditional key exchange protocols insecure in a quantum computing environment. To address the challenges of quantum computing, quantum cryptography has emerged. Quantum cryptography utilizes the basic principles of quantum mechanics, such as the non-clonability of quantum states and the uncertainty principle, to design a series of new key establishment methods. Among them, Quantum Key Distribution (QKD) is an important means to achieve unconditionally secure key establishment. Quantum key distribution transmits quantum states through a quantum channel and uses the principles of quantum mechanics to ensure that eavesdropping behavior will surely be detected, thus guaranteeing the security of the key.

[0003] In the Chinese invention application with the application publication number CN115134163A, a cross-domain key management system, a cross-domain key establishment method, devices, and a storage medium are disclosed, including a blockchain network subsystem and at least two target domain subsystems; a cloud server is used to initialize the public key of the cloud server, the private key of the cloud server, and system parameters, and generate the private key of at least one node and the public key information of at least one node in the target domain subsystem to which it belongs, and send the registration transaction data of the cloud server and at least one node to the blockchain network subsystem; the blockchain network subsystem is used to verify the registration transaction data after receiving it and save the registration transaction data in the case of successful verification. It can solve the problem of slow authentication and key establishment speed between devices from two different domains. It can improve the speed of cross-domain key establishment.

[0004] In the above invention application, the problem of slow authentication and key establishment speed between devices from two different domains is solved, but if security measures are not in place, it may increase the risk of key leakage and be more vulnerable to man-in-the-middle attacks, and attackers may intercept or tamper with information during the communication process between devices.

[0005] To this end, the present invention provides a method for establishing a shared key in a quantum computing environment. Summary of the invention

[0006] 1. Technical issues to be resolved

[0007] In view of the shortcomings of the prior art, the present invention provides a method for establishing a shared key in a quantum computing environment. The present invention obtains the cost Cb of each quantum state. i , use the quantum random number generator to generate random numbers, and count the average length Cd of random numbers in different quantum states i And the number of units generated per time Sl i , prepare the corresponding quantum state key according to the encoded random number, and record the average preparation time Zs of different quantum state keys i ; Calculate the error rate Cw of different quantum states i ; Based on the average length of random numbers Cd i And the number of units generated per time Sl i , calculate the first key establishment evaluation coefficient Dp i , based on the average preparation time Zs i and error rate Cw i , calculate the second key establishment evaluation coefficient Ep i , and establish the evaluation coefficient Dp based on the first key i , Second key establishment evaluation coefficient Ep i and the cost Cb of each quantum state i Calculate the comprehensive evaluation index zp for each quantum state i , determining the key establishment quantum state can provide strong support for the optimization of the QKD system. According to the evaluation results, the system administrator can flexibly adjust the random number generation strategy, quantum state preparation scheme and key distribution strategy to adapt to different application scenarios and needs, thereby solving the technical problems recorded in the background technology.

[0008] (II) Technical solution

[0009] To achieve the above objectives, the present invention is implemented through the following technical solutions: A method for establishing a shared key in a quantum computing environment, comprising the following steps:

[0010] The cost of obtaining each quantum state Cb i , use the quantum random number generator to generate random numbers, and count the average length Cd of random numbers in different quantum states i And the number of units generated per time Sl i , prepare the corresponding quantum state key according to the encoded random number, and record the average preparation time Zs of different quantum state keys i ;

[0011] A sends the quantum state key to B through a quantum channel. A and B each randomly select a measurement basis to measure part of the quantum state key, compare the publicly disclosed measurement results, and calculate the error rate Cw of different quantum states. i ;

[0012] According to the average length Cd of the random numbers i and the number Sl generated per unit time i , calculate the first key establishment evaluation coefficient Dp i , according to the average preparation time Zs i and the error rate Cw i , calculate the second key establishment evaluation coefficient Ep i , and according to the first key establishment evaluation coefficient Dp i , the second key establishment evaluation coefficient Ep i and the cost Cb of each quantum state i calculate the comprehensive evaluation index zp of each quantum state i , and determine the quantum state for key establishment.

[0013] Furthermore, determine the two communicating parties A and B, as well as the quantum communication devices and classical communication devices they use. Prepare multiple quantum states that meet the requirements according to the adopted protocol, query the devices and conditions required for different quantum state preparation technologies, obtain the costs of different quantum state devices and the costs of system integration and maintenance, and record them as the cost Cb of each quantum state after sorting. i .

[0014] A quantum state is a mathematical representation that describes a quantum system in different states. It can be the state description of a particle, a group of particles, or even the entire universe. A quantum state contains all the information of the system. As long as the information of the system's quantum state is known, the measurement results of the system can be given.

[0015] Furthermore, use a quantum random number generator to generate random numbers, encode the generated random numbers onto the quantum states, and statistically calculate the average length Cd of the random numbers of different quantum states i and the number Sl generated per unit time i .

[0016] A quantum random number generator (QRNG) is a random number generation device based on the principles of quantum mechanics. Different from traditional pseudo-random number generators (PRNGs), QRNGs utilize the randomness of quantum mechanics to generate truly random numbers. These random numbers have unpredictability, non-reproducibility, and high security, and thus are of great significance in application scenarios that require highly secure random numbers.

[0017] Polarization Encoding: In quantum key distribution protocols such as the BB84 protocol, random numbers are used to select the polarization directions of quantum states. For example, horizontal polarization and vertical polarization can represent bits 0 and 1, while 45° and -45° polarizations can also serve as another set of basis vectors. Alice selects the polarization direction according to the random number and prepares the corresponding quantum state.

[0018] Phase Encoding: In phase-encoded QKD protocols, random numbers are used to modulate the phase of photons. By changing the phase of photons, different quantum states can be prepared.

[0019] Amplitude Encoding: Amplitude modulation is also a possible encoding method, where different information is represented by changing the amplitude of photons.

[0020] Furthermore, according to the encoded random numbers, a quantum light source and a modulation device are used to prepare the corresponding quantum state keys, and the average preparation time Zs of different quantum state keys is recorded. i 。

[0021] Furthermore, A sends the quantum state key to B through a quantum channel. After receiving the quantum state, B measures the quantum state key using the agreed measurement basis and records the measurement results.

[0022] Furthermore, A and B each randomly select a measurement basis to measure part of the quantum state keys, and publicly disclose their measurement basis selections and the corresponding measurement results through a classical channel. By comparing the publicly disclosed measurement results, the error rate Cw of different quantum states is calculated. i 。

[0023] The error rate refers to the proportion of inconsistent measurement results among all comparison results. For example, if Alice and Bob compare 100 measurement results under the same basis and 5 of them are inconsistent, then the error rate is 5%.

[0024] Furthermore, the average length Cd of the random numbers is obtained. i and the number of generated per unit time Sl. i , and the first key establishment evaluation coefficient Dp is calculated. i :

[0025]

[0026] where, is the mean of all average lengths Cd of the random numbers. i of, is the mean of all numbers of generated per unit time Sl. i of.

[0027] Furthermore, the average preparation time Zs is obtained. i and the error rate Cw. i, calculate the second key establishment evaluation coefficient \(E_p\) i :

[0028]

[0029] Among them, is the mean value of all average preparation times \(Z_s\) i , is the mean value of all error rates \(C_w\) i .

[0030] Furthermore, obtain the first key establishment evaluation coefficient \(D_p\) i and the second key establishment evaluation coefficient \(E_p\) i , and combine the cost \(C_b\) of each quantum state i to calculate the comprehensive evaluation index \(z_p\) of each quantum state i :

[0031]

[0032] Among them, \(i\) represents the sequential number of each qualified quantum state, \(i = 1, 2, \cdots, y\).

[0033] Furthermore, after sorting the comprehensive evaluation index \(z_p\) of each quantum state from large to small, select the quantum state corresponding to the largest sorted comprehensive evaluation index \(z_p\) i as the key establishment quantum state. i

[0034] (III) Beneficial effects

[0035] The present invention provides a method for establishing a shared key in a quantum computing environment, having the following beneficial effects:

[0036] 1. Obtain the cost \(C_b\) of each quantum state i , use a quantum random number generator (QRNG) to generate random numbers, count the average length \(C_d\) of random numbers and the number of generated per unit time \(S_l\) i of different quantum states, prepare the corresponding quantum state keys according to the encoded random numbers, and record the average preparation time \(Z_s\) i of different quantum state keys, which can help make more economical and reasonable decisions when selecting quantum states, thus avoiding resource waste and achieving the maximization of cost-effectiveness. Recording the average preparation time of different quantum states helps analyze the bottlenecks and optimization points in the preparation process of different quantum states, and further improves the overall efficiency of quantum state preparation. i

[0037] 2. A sends the quantum state key to B through a quantum channel. A and B each randomly select a measurement basis to measure part of the quantum state keys, compare the publicly disclosed measurement results, and calculate the error rate \(C_w\) of different quantum statesi It has significant benefits in security detection, key screening and purification, performance evaluation and optimization, and enhancing trust and interoperability during the quantum key distribution process.

[0038] 3. According to the average length Cd of random numbers i and the number Sl generated per unit time i , calculate the first key establishment evaluation coefficient Dp i , according to the average preparation time Zs i and the error rate Cw i , calculate the second key establishment evaluation coefficient Ep i , and according to the first key establishment evaluation coefficient Dp i , the second key establishment evaluation coefficient Ep i and the cost Cb of each quantum state i calculate the comprehensive evaluation index zp of each quantum state i , determine the quantum state for key establishment, which can provide strong support for the optimization of the QKD system. According to the evaluation results, the system administrator can flexibly adjust the random number generation strategy, quantum state preparation scheme, key distribution strategy, etc. to adapt to different application scenarios and requirements. Description of the Drawings

[0039] Figure 1 It is a schematic flowchart of a method for establishing a shared key in a quantum computing environment according to the present invention. Detailed Embodiments

[0040] Next, the technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present invention without creative efforts shall fall within the protection scope of the present invention.

[0041] Please refer to Figure 1 , the present invention provides a method for establishing a shared key in a quantum computing environment, including the following steps:

[0042] Step 1. Obtain the cost Cb of each quantum state i , use a quantum random number generator (QRNG) to generate random numbers, count the average length Cd of random numbers in different quantum states i and the number Sl generated per unit time i , prepare the corresponding quantum state key according to the encoded random numbers, and record the average preparation time Zs of the quantum state keys in different quantum states i .

[0043] The content of Step 1 includes the following:

[0044] Step 101: Determine the two communication parties A and B, as well as the quantum communication devices and classical communication devices they use. Prepare various quantum states that meet the requirements according to the adopted protocol. These quantum states can be entangled states (such as Bell states) or non-entangled states. Query the devices and conditions required for different quantum state preparation technologies, obtain the costs of different quantum state devices and the costs of system integration and maintenance, and record them as the cost Cb of each quantum state after collation i 。

[0045] A quantum state is a mathematical representation that describes a quantum system in different states. It can be the state description of a particle, a group of particles, or even the entire universe. A quantum state contains all the information of the system. As long as the information of the system's quantum state is known, the measurement results of the system can be given

[0046] Step 102: Use a quantum random number generator (QRNG) to generate random numbers, and encode the generated random numbers onto the quantum states. Statistically analyze the average length Cd of the random numbers for different quantum states i and the number of generated per unit time Sl i 。

[0047] A quantum random number generator (QRNG) is a random number generation device based on the principles of quantum mechanics. Different from traditional pseudo-random number generators (PRNGs), QRNGs use the randomness of quantum mechanics to generate truly random numbers. These random numbers have the characteristics of unpredictability, non-reproducibility, and high security, so they are of great significance in application scenarios that require high-security random numbers

[0048] Polarization encoding: In quantum key distribution protocols such as the BB84 protocol, random numbers are used to select the polarization directions of quantum states. For example, horizontal polarization and vertical polarization can represent bits 0 and 1, while 45° and -45° polarizations can also be used as another set of basis vectors. Alice selects the polarization direction according to the random number and prepares the corresponding quantum state

[0049] Phase encoding: In phase-encoded QKD protocols, random numbers are used to modulate the phase of photons. By changing the phase of photons, different quantum states can be prepared

[0050] Amplitude encoding: Amplitude modulation is also a possible encoding method, where different information is represented by changing the amplitude of photons

[0051] Step 103: According to the encoded random numbers, use a quantum light source and modulation devices, such as phase modulators, amplitude modulators, etc., to prepare the corresponding quantum state keys, and record the average preparation time Zs of different quantum state keys i 。

[0052] During use, combine the content in Steps 101 to 103:

[0053] Obtain the cost Cd of each quantum state i , use a quantum random number generator (QRNG) to generate random numbers, and statistically calculate the average length Cd of the random numbers in different quantum states i and the number Sl generated per unit time i , prepare the corresponding quantum state keys according to the encoded random numbers, and record the average preparation time Zs of different quantum state keys i , which can help make more economical and reasonable decisions when selecting quantum states, thus avoiding waste of resources and achieving the maximization of cost-effectiveness. Recording the average preparation time of different quantum states helps analyze the bottlenecks and optimization points in the preparation process of different quantum states, and then improves the overall efficiency of quantum state preparation.

[0054] Step Two: A sends the quantum state key to B through a quantum channel. A and B each randomly select a measurement basis to measure part of the quantum state key, compare the publicly disclosed measurement results, and calculate the error rate Cw of different quantum states i .

[0055] The said Step Two includes the following content:

[0056] Step 201: A sends the quantum state key to B through a quantum channel. After receiving the quantum state, B uses the agreed measurement basis to measure the quantum state key and records the measurement results.

[0057] Step 202: A and B each randomly select a measurement basis to measure part of the quantum state key, and publicly disclose their measurement basis selections and the corresponding measurement results through a classical channel. Compare the publicly disclosed measurement results and calculate the error rate Cw of different quantum states i .

[0058] The error rate refers to the proportion of inconsistent measurement results among all comparison results. For example, if Alice and Bob compare 100 measurement results under the same basis and 5 of them are inconsistent, then the error rate is 5%.

[0059] During use, combine the content in Steps 201 and 202:

[0060] A sends the quantum state key to B through a quantum channel. A and B each randomly select a measurement basis to measure part of the quantum state key, compare the publicly disclosed measurement results, and calculate the error rate Cw of different quantum states i , which has significant benefits in security detection, key screening and purification, performance evaluation and optimization, and enhancing trust and interoperability during quantum key distribution.

[0061] Step 3: Calculate the first key establishment evaluation coefficient Dp based on the average length Cd of random numbers i and the number of generated per unit time Sl i , and calculate the second key establishment evaluation coefficient Ep based on the average preparation time Zs i and the error rate Cw i . Then, calculate the comprehensive evaluation index zp of each quantum state based on the first key establishment evaluation coefficient Dp i , the second key establishment evaluation coefficient Ep i , and the cost Cb of each quantum state i to determine the quantum state for key establishment i . i i

[0062]

[0063] The specific content of Step 3 is as follows:

[0064] i Step 301: Obtain the average length Cd of random numbers i and the number of generated per unit time Sl i , and calculate the first key establishment evaluation coefficient Dp

[0064]

[0065] where is the mean value of all average lengths Cd of random numbers i , and is the mean value of all numbers of generated per unit time Sl i .

[0066] i Step 302: Obtain the average preparation time Zs i and the error rate Cw, and calculate the second key establishment evaluation coefficient Ep i :

[0067]

[0068] where is the mean value of all average preparation times Zs i , and is the mean value of all error rates Cw i .

[0069] i Step 303: Obtain the first key establishment evaluation coefficient Dpand the second key establishment evaluation coefficient Ep i , and combine with the cost Cb of each quantum state i to calculate the comprehensive evaluation index zp of each quantum state i :

[0070]

[0071] Among them, i represents the sequential number of each quantum state that meets the requirements, and i = 1, 2, …, y.

[0072] Step 304: After comprehensively evaluating and sorting each quantum state evaluation index zp i from largest to smallest, select the quantum state evaluation index zp with the largest ranking i The corresponding quantum state is the key establishment quantum state.

[0073] When in use, combine the content in Steps 301 to 304:

[0074] According to the average length of random numbers Cd i and the quantity generated per unit time Sl i , calculate the first key establishment evaluation coefficient Dp i , according to the average preparation time Zs i and the error rate Cw i , calculate the second key establishment evaluation coefficient Ep i , and according to the first key establishment evaluation coefficient Dp i , the second key establishment evaluation coefficient Ep i and the cost Cb of each quantum state i calculate the comprehensive evaluation index zp of each quantum state i , determine the key establishment quantum state, which can provide strong support for the optimization of the QKD system. According to the evaluation results, the system administrator can flexibly adjust the random number generation strategy, quantum state preparation plan, key distribution strategy, etc. to adapt to different application scenarios and requirements.

[0075] The above embodiments can be implemented in whole or in part by software, hardware, firmware, or any other combination. When implemented using software, the above embodiments can be implemented in whole or in part in the form of a computer program product. Those of ordinary skill in the art can realize that the units and algorithm steps of each example described in combination with the embodiments disclosed herein can be implemented by electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are executed in hardware or software depends on the specific application and design constraints of the technical solution.

[0076] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place, or may be distributed to multiple network units. One can select some or all of the units according to actual needs to achieve the purpose of the solution of this embodiment.

[0077] As described above, it is only the specific implementation manner of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art within the technical scope disclosed by the present application can easily think of changes or substitutions, which should all be covered within the protection scope of the present application.

Claims

1. A method for establishing a shared key in a quantum computing environment, characterized in that: The steps include: The cost of obtaining each quantum state Cb i , use the quantum random number generator to generate random numbers, and count the average length Cd of random numbers in different quantum states i And the number of units generated per time Sl i , prepare the corresponding quantum state key according to the encoded random number, and record the average preparation time Zs of different quantum state keys i ; A sends the quantum state key to B through the quantum channel. A and B each randomly select a measurement basis to measure part of the quantum state key, compare the public measurement results, and calculate the error rate Cw of different quantum states. i ; According to the average length of random numbers Cd i And the number of units generated per time Sl i , calculate the first key establishment evaluation coefficient Dp i , based on the average preparation time Zs i and error rate Cw i , calculate the second key establishment evaluation coefficient Ep i , and establish the evaluation coefficient Dp based on the first key i , Second key establishment evaluation coefficient Ep i and the cost Cb of each quantum state i Calculate the comprehensive evaluation index zp for each quantum state i , determine the key to establish the quantum state.

2. The method for establishing a shared key in a quantum computing environment according to claim 1, characterized in that: Determine the communicating parties A and B, as well as the quantum communication equipment and classical communication equipment they use, prepare multiple quantum states that meet the requirements according to the adopted protocol, query the equipment and conditions required for different quantum state preparation technologies, obtain the cost of different quantum state equipment and the cost of system integration and maintenance, and record them as the cost of each quantum state Cb i .

3. The method for establishing a shared key in a quantum computing environment according to claim 1, characterized in that: Use a quantum random number generator to generate random numbers, encode the generated random numbers into quantum states, and count the average length Cd of random numbers in different quantum states i And the number of units generated per time Sl i .

4. The method for establishing a shared key in a quantum computing environment according to claim 1, characterized in that: According to the encoded random number, the corresponding quantum state key is prepared using a quantum light source and a modulation device, and the average preparation time Zs of different quantum state keys is recorded. i .

5. The method for establishing a shared key in a quantum computing environment according to claim 1, characterized in that: A sends the quantum state key to B through the quantum channel. After receiving the quantum state, B uses the agreed measurement basis to measure the quantum state key and records the measurement results.

6. The method for establishing a shared key in a quantum computing environment according to claim 1, characterized in that: A and B each randomly select a measurement basis to measure part of the quantum state key, and publish their measurement basis selection and corresponding measurement results through the classical channel, compare the published measurement results, and calculate the error rate Cw of different quantum states i .

7. The method for establishing a shared key in a quantum computing environment according to claim 1, characterized in that: Get the average length of random numbers Cd i And the number of units generated per time Sl i , calculate the first key establishment evaluation coefficient Dp i : in, is the average length of all random numbers Cd i The mean of Generate quantity Sl for all time units i The mean of .

8. The method for establishing a shared key in a quantum computing environment according to claim 1, characterized in that: Get the average preparation time Zs i and error rate Cw i , calculate the second key establishment evaluation coefficient Ep i : in, is the average preparation time Zs i The mean of For all error rates Cw i The mean of .

9. The method for establishing a shared key in a quantum computing environment according to claim 1, characterized in that: Get the first key establishment evaluation coefficient Dp i The evaluation coefficient Ep is established with the second key i , combined with the cost Cb of each quantum state i , calculate the comprehensive evaluation index zp of each quantum state i : Among them, i represents the sequential number of each quantum state that meets the requirements, i = 1, 2, ..., y.

10. The method for establishing a shared key in a quantum computing environment according to claim 1, characterized in that: The comprehensive evaluation index zp of each quantum state i After sorting from large to small, select the quantum state comprehensive evaluation index zp with the largest sorting i The corresponding quantum state is the key establishment quantum state.

Images