CN112068803A - Quantum pseudo-random number generation method and generation system - Google Patents
Quantum pseudo-random number generation method and generation system Download PDFInfo
- Publication number
- CN112068803A CN112068803A CN202010789935.8A CN202010789935A CN112068803A CN 112068803 A CN112068803 A CN 112068803A CN 202010789935 A CN202010789935 A CN 202010789935A CN 112068803 A CN112068803 A CN 112068803A
- Authority
- CN
- China
- Prior art keywords
- quantum
- random number
- participant
- protocol
- pseudo
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 42
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 36
- 238000005259 measurement Methods 0.000 claims abstract description 17
- 239000002245 particle Substances 0.000 claims abstract description 17
- 230000006854 communication Effects 0.000 claims description 25
- 238000004891 communication Methods 0.000 claims description 24
- 238000002360 preparation method Methods 0.000 claims description 8
- 238000007689 inspection Methods 0.000 claims description 5
- 230000010287 polarization Effects 0.000 claims description 5
- 238000004590 computer program Methods 0.000 claims description 3
- 230000007547 defect Effects 0.000 abstract description 6
- 238000005516 engineering process Methods 0.000 abstract description 6
- 230000005610 quantum mechanics Effects 0.000 abstract description 4
- 230000004807 localization Effects 0.000 abstract description 3
- 238000004364 calculation method Methods 0.000 description 9
- 238000004458 analytical method Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 5
- 230000005540 biological transmission Effects 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 238000002474 experimental method Methods 0.000 description 3
- 230000001360 synchronised effect Effects 0.000 description 3
- 238000011161 development Methods 0.000 description 2
- 238000005070 sampling Methods 0.000 description 2
- OKUGPJPKMAEJOE-UHFFFAOYSA-N S-propyl dipropylcarbamothioate Chemical compound CCCSC(=O)N(CCC)CCC OKUGPJPKMAEJOE-UHFFFAOYSA-N 0.000 description 1
- 238000005311 autocorrelation function Methods 0.000 description 1
- 239000000969 carrier Substances 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000006731 degradation reaction Methods 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000004927 fusion Effects 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008092 positive effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 239000002096 quantum dot Substances 0.000 description 1
- 238000001583 randomness test Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000000087 stabilizing effect Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/58—Random or pseudo-random number generators
- G06F7/582—Pseudo-random number generators
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N10/00—Quantum computing, i.e. information processing based on quantum-mechanical phenomena
Landscapes
- Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Computational Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Evolutionary Computation (AREA)
- Condensed Matter Physics & Semiconductors (AREA)
- Computing Systems (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Artificial Intelligence (AREA)
- Optical Communication System (AREA)
Abstract
The invention belongs to the technical field of encryption, and discloses a quantum pseudo-random number generation method and a quantum pseudo-random number generation system. The algorithm used by the invention is simple and easy to realize, the key generation speed is high, and the security of the key is ensured by physical characteristics such as the heisenberg inaccurate measurement principle, quantum unclonable theorem, the relevance and non-localization of entangled particles and the like in quantum mechanics, so that the random number has unconditional security and true randomness; by combining quantum key distribution and a classical pseudo-random number generation algorithm, the method has the advantages of both and overcomes the defects of the two technologies; the invention improves the security, the randomness and the key generation efficiency of the shared random number and also reduces the key generation cost.
Description
Technical Field
The invention belongs to the technical field of encryption, and particularly relates to a quantum pseudo-random number generation method and a quantum pseudo-random number generation system.
Background
At present, quantum communication is a new discipline of cross fusion of quantum mechanics, information theory and cryptography, and is a new communication mode for transferring secret information by using the quantum characteristics of microscopic particles as information carriers. Compared with the classical communication mode, quantum secure communication has great advantages in various aspects such as security, transmission efficiency, channel capacity and the like, so that quantum secure communication has become a new hotspot of scientific research and a new direction of technical development in the communication and information field. Among the many applications of Quantum communication, Quantum Key Distribution (QKD) shares a random Quantum Key between two communication parties, which is an important direction that is the most deeply studied and practical. Researchers studying QKD have proposed many important quantum cryptography protocols, including mainly: in 1984, Bennett and Brassard jointly developed the world's first QKD (BB84 protocol) using the polarization states of single photons; QKD (B92 protocol) using non-orthogonal single-photon bits proposed by Bennett in 1992; in 1991, QKD utilizing Bell-state entanglement characteristics was proposed for the first time by Ekert of Oxford university in England; in 1992 Bennett, Brassard and Mermim improved the Ekert's solution to make it more compact, i.e., not using the Bell state to achieve QKD. With the rapid development of quantum technology, quantum Identity authentication qia (quantum Identity authentication), quantum Secret sharing qss (quantum Secret sharing) and quantum privacy comparison qpc (quantum Private comparison) are also rapidly developing.
In 1917, g.s.vernam proposed a one-time pad encryption scheme, and g.shannon demonstrated unconditional security of this encryption scheme at 1949. The one-time pad is a symmetric cryptographic algorithm for encrypting and decrypting a plaintext by using a random key with the same length as the plaintext by two communication parties, and the key is discarded after being used once. Although the one-time pad has extremely high security, it is difficult to share a sufficiently long random key between the two communicating parties. Quantum key distribution can realize high-strength secure key distribution between two communication parties, but the quantum key distribution also faces a serious short board, namely, low key generation efficiency and high cost. The QKD short-board problem becomes more severe if the amount of data between the two communicating parties is large.
A Pseudo Random Number Generator (PRNG) is an algorithm that stably outputs a Pseudo random sequence at an extremely fast rate by inputting a "Seed" (Seed) into a preset mathematical algorithm, and statistical characteristics of the Pseudo random sequence are guaranteed by the algorithm. The pseudo-random number generation method has the characteristics of simple device, mature algorithm and higher generation efficiency, and is widely applied to various aspects of lottery activities, statistical sampling, numerical simulation and the like. Since the algorithm of the classical pseudo random number generator is public, the security of the pseudo random number generated by the classical pseudo random number generator completely depends on the confidentiality degree of the seed information, and the randomness of the pseudo random number generator is greatly related to the randomness of the seed information.
In summary, the problems of the prior art are as follows: the existing quantum random number generation method has low key generation efficiency and high cost; whereas pseudo-random number generators have high requirements on "seed" confidentiality and randomness.
The difficulty of solving the technical problems is as follows: the random key is shared between two users, and how to reduce the generation cost and improve the key generation efficiency is difficult on the premise of ensuring the security and the randomness of the key.
The significance of solving the technical problems is as follows: the invention combines quantum key distribution and a classical pseudo-random number generation algorithm, and the quantum pseudo-random number generation scheme has the advantages of the quantum key distribution and the classical pseudo-random number generation algorithm and overcomes the defects of the two technologies. Compared with the prior art, the invention improves the safety, the randomness and the key generation efficiency of the shared random number, also reduces the key generation cost, and further ensures that the one-time pad encryption mode is easier to realize in real life.
Disclosure of Invention
Aiming at the problems in the prior art, the invention provides a quantum pseudo-random number generation method and a quantum pseudo-random number generation system.
The invention is realized in such a way that a quantum pseudo-random number generation method comprises the steps of sharing a seed key with the same binary bit by utilizing QKD (quantum key distribution) between two communication parties, then inputting the seed into a pseudo-random number generator of a linear congruence random number generation algorithm by the two communication parties, and enabling the two communication parties to share the pseudo-random number with the same binary bit as a key of a one-time pad.
The method specifically comprises the following steps:
step one, a first participant and a second participant of a protocol share a linear congruence random number generation algorithm in a public channel;
step two, the first participant of the protocol randomly prepares a quantum sequence S containing 4n single photons with polarization states of one of |0 >, |1 >, | + >, and | -)1(ii) a The first participant of the protocol sends S through the quantum channel1To a second participant of the protocol;
step three, the second participant of the protocol receives S1Thereafter, the pairs S of X and Z radicals are randomly used1Making measurements and publishing the sequence of used bases through a common channel;
step four, the first participant of the protocol prepares S according to the base sequence used by the second participant of the protocol1Comparing the base sequences, retaining the single photon state corresponding to the same base, and discarding the single photon state corresponding to different bases to form a quantum sequence S2；
Step five, the first participant of the protocol is at S2Randomly selecting a part of single photons and publishing the preparation state of the single photons through a public channel, and comparing the preparation state and the measurement state of the part of single photons by a second participant of the protocol to perform eavesdropping inspection;
step six, if a second participant of the protocol finds that the error rate of the enticing particles exceeds a threshold value, eavesdropping exists in communication, and the protocol is terminated; otherwise, no eavesdropping exists in the communication, and the protocol continues to be carried out;
step seven, the first participant of the protocol and the second participant of the protocol simultaneously abandon the single photon for eavesdropping check, and the residual particles form a quantum sequence S3(ii) a Will S3Middle (| 0)>，|->) Coded to 0, will (| 1)>，|+>) Coded 1, the first participant of the protocol and the second participant of the protocol being based on S3Obtain a binary bit sequence k1；
Step eight, the first participant of the protocol and the protocolThe second participant of (a) will k1Linear congruence algorithm is input as seed to obtain pseudo-random sequence binary bit sequence k2。
Further, in the first step, the linear congruential random number generation algorithm includes:
the next number is obtained by performing linear operation and modulo operation on the previous number, and the recursion formula is:
xn+1＝(axn+c)modm
wherein: a is a multiplier, 0<a<m; c is increment, c is more than or equal to 0<m; m is the modulus, m>0；X0Is an initial value, X is not less than 00<M；xn+1Is a random number, x is more than or equal to 0n+1<M。
Further, in step three, the X group and the Z group are: the X base and the Z base are two measurement bases for quantum key distribution, wherein the X base { + >, | - >) is a set of standard orthogonal bases; the Z base { | + >, | - > } is another set of orthonormal bases;
the X group and the Z group are non-orthogonal groups and satisfy the following relation:
another object of the present invention is to provide a quantum pseudo random number generation system that implements the quantum pseudo random number generation method.
It is a further object of the invention to provide a computer program product stored on a computer readable medium, comprising a computer readable program for providing a user input interface for implementing said quantum pseudorandom number generation method when executed on an electronic device.
It is another object of the present invention to provide a computer-readable storage medium including instructions that, when executed on a computer, cause the computer to perform the quantum pseudo random number generation method.
In summary, the advantages and positive effects of the invention are: the algorithm used by the invention is simple and easy to realize, the key generation speed is high, and the security of the key is ensured by physical characteristics such as the heisenberg inaccurate measurement principle, quantum unclonable theorem, the relevance and non-localization of entangled particles and the like in quantum mechanics, so that the random number has unconditional security and true randomness. By combining quantum key distribution with a classical pseudo-random number generation algorithm, the quantum pseudo-random number generation scheme has the advantages of both and overcomes the defects of the two technologies. The invention improves the safety, the randomness and the key generation efficiency of the shared random number, and also reduces the key generation cost, thereby leading the one-time pad encryption mode to be easier to realize in real life.
The invention can overcome the problems of low key generation rate and high cost in the QKD technology and the problems of high seed confidentiality and randomness requirements of a pseudo-random number generator. Compared with the classical QKD scheme, the method fully utilizes the safety and randomness of the QKD and simultaneously relieves the problems of low generation rate and high cost in the QKD scheme. Compared with the classic PRNG scheme, the method provides an unconditionally safe 'seed' with true randomness, and therefore the safety and the randomness of the pseudo random number are guaranteed. Therefore, the random number shared by the invention has stronger safety, good randomness and higher key generation rate.
Drawings
Fig. 1 is a flowchart of a quantum pseudo random number generation method according to an embodiment of the present invention.
Fig. 2 is a schematic diagram of a quantum pseudo random number generation method according to an embodiment of the present invention.
Fig. 3 is a schematic diagram of a quantum key distribution device provided in an embodiment of the present invention.
Fig. 4 is a schematic diagram of generation of a quantum random key according to an embodiment of the present invention.
Fig. 5 is a code diagram of a linear equivalence algorithm provided by an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail with reference to the following embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The existing quantum random number generation method has low key generation efficiency and high cost, and the pseudo-random number generator has high requirements on seed confidentiality and randomness.
In view of the problems in the prior art, the present invention provides a quantum pseudo random number generation method and a quantum pseudo random number generation system, and the following describes the present invention in detail with reference to the accompanying drawings.
As shown in fig. 1, a quantum pseudo random number generation method provided by an embodiment of the present invention includes:
s101, a first participant and a second participant of the protocol share a linear congruence random number generation algorithm in the public channel.
S102, a first participant of the protocol randomly prepares a random solution containing 4n single photons with a polarization state of |0>，|1>，|+>，|->A quantum sequence S of1(ii) a The first participant of the protocol sends S through the quantum channel1To a second participant of the protocol.
S103, the second participant of the protocol receives S1Thereafter, the pairs S of X and Z radicals are randomly used1Measurements are made and the sequence of the used basis is published through a common channel.
S104, the first participant of the protocol prepares S according to the base sequence used by the second participant of the protocol1Comparing the base sequences, retaining the single photon state corresponding to the same base, and discarding the single photon state corresponding to different bases to form a quantum sequence S2。
S105, the first participant of the protocol is at S2Randomly selecting a part of single photons and publishing the preparation state of the single photons through a public channel, and comparing the preparation state and the measurement state of the part of single photons by a second participant of the protocol to perform eavesdropping inspection;
s106, if the second participant of the protocol finds that the error rate of the enticing particles exceeds the threshold value, eavesdropping exists in the communication, and the protocol is terminated; otherwise, no eavesdropping exists in the communication, and the protocol continues to be carried out;
s107, the first participant of the protocol and the second participant of the protocol discard the single photons for eavesdropping, and the remaining particles form a quantum sequence S3(ii) a Will S3Middle (| 0)>，|->) Coded to 0, will (| 1)>，|+>) Coded 1, the first participant of the protocol and the second participant of the protocol being based on S3Obtain a binary bit sequence k1；
S108, the first participant of the protocol and the second participant of the protocol will k1Linear congruence algorithm is input as seed to obtain pseudo-random sequence binary bit sequence k2。
Fig. 2 is a schematic diagram of a quantum pseudo random number generation method according to an embodiment of the present invention.
In step S101, the linear congruence random number generation algorithm provided in the embodiment of the present invention includes:
the next number is obtained by performing linear operation and modulo operation on the previous number, and the recursion formula is:
xn+1＝(axn+c)modm
wherein: a is a multiplier, 0<a<m; c is increment, c is more than or equal to 0<m; m is the modulus, m>0；X0Is an initial value, X is not less than 00<M；xn+1Is a random number, x is more than or equal to 0n+1<M。
In step S103, the X group and the Z group provided in the embodiment of the present invention are: the X base and the Z base are two measurement bases for quantum key distribution, wherein the X base { + >, | - >) is a set of standard orthogonal bases; the Z base { | + >, | - > } is another set of orthonormal bases;
the X group and the Z group are non-orthogonal groups and satisfy the following relation:
the present invention will be further described with reference to the following specific examples.
Example (b):
1. basis of related problems
Pseudo-random number generation algorithms generally include: square-of-middle, fibonacci, shift, linear congruence, nonlinear and inverse congruence, and decimal.
The square mid-sampling method has the advantages of simple calculation, easy realization on a computer and less memory occupation; the defects are that the phenomenon of small number bias exists, the uniformity is poor, the length and the period of the array are difficult to determine, the dependence on initial data is large, and the degradation phenomenon is easy to occur. The Fibonacci method has the advantages of simple calculation, high calculation speed and longer period; the method has the disadvantages of easy repeated occurrence of random sequences, poor independence, non-centering phenomenon and obvious sequence correlation. The shift method has the advantages of high operation speed; the method has the disadvantages of large dependence on the initial value, short pseudorandom number column length and poor independence if the initial value is too small, existence of sparse grids, and correlation of the period of the last random sequence with the word length of a computer. The linear congruence method has the advantages of general calculation speed and the defects of high-latitude sparse grids and long-period correlation. The nonlinear and inverse congruence methods are complex in calculation and large in calculation amount; the disadvantages are that the random sequence generation efficiency is low, a long period phenomenon exists and the period depends on the computer word length. The minimum number method has the advantages of simple calculation and easy realization; the disadvantages are that the seed is pure decimal and the number of digits is as large as possible.
Six kinds of pseudo-random number generation algorithms are analyzed in five dimensions of 'calculation complexity', 'dependence on seeds', 'random sequence uniformity', 'random sequence periodicity' and 'random sequence generation efficiency', and the results are shown in table 1.
TABLE 1 analysis table of six pseudo-random generation algorithms
Analysis shows that the linear congruence method has low dependence on seeds, good random sequence quality and acceptable calculation difficulty and generation efficiency, so that the linear congruence method is suitable for being combined with QKD to form a quantum pseudo-random number generation scheme. The linear congruence method is a pseudo-random number generation algorithm widely applied at present, and the basic idea is that the next number is obtained by performing linear operation and modulus on the previous number, and the recursion formula is as follows:
xn+1＝(axn+c)modm (1)
wherein: a is a multiplier, 0<a<m; c is increment, c is more than or equal to 0<m; m is the modulus, m>0；X0Is an initial value, X is not less than 00<M；xn+1Is a random number, x is more than or equal to 0n+1<M。
The quantum key distribution used in the invention relates to two measurement bases, namely X base and Z base, wherein { + >, | - >) is a group of standard orthogonal bases, X base; { | + >, | - > } is another set of orthonormal bases, the Z base. The X and Z radicals are non-orthogonal radicals and they satisfy the following relationships:
the results of the four different states measured from the two measurement bases are shown in table 2:
TABLE 2 measurement results of different states
2. Quantum pseudorandom number generation scheme
(1) Alice and Bob share a linear congruential random number generation algorithm in the open channel.
(2) Alice randomly prepares a random array containing 4n single photons and has a polarization state (| 0)>，|1>，|+>，|->) A quantum sequence of1. Alice sends S through quantum channel1Sent to Bob.
(3) Bob receives S1Thereafter, the pairs S of X and Z radicals are randomly used1Measurements are made and the sequence of the used basis is published through a common channel.
(4) Alice prepares S according to the base sequence used by Bob and itself1Comparing the base sequences, retaining the single photon state corresponding to the same base, and discarding the single photon state corresponding to different bases to form a quantum sequence S2。
(5) Alice at S2A part of single photons are randomly selected and the preparation state of the single photons is published by a public channel, Bob compares the preparation state and the measurement state of the part of single photons, and eavesdropping inspection is carried out.
(6) If the Bob finds that the error rate of the enticing particles exceeds a threshold value, eavesdropping exists in communication, and the protocol is terminated; otherwise, no eavesdropping is carried out in the communication, and the protocol continues to be carried out.
(7) Alice and Bob simultaneously discard the single photon for eavesdropping inspection, and the residual particles form a quantum sequence S3. Will S3Middle (| 0)>，|->) Coded to 0, will (| 1)>，|+>) The code is 1, so Alice and Bob are according to S3Obtain a binary bit sequence k1。
(8) Alice and Bob will k1Inputting linear congruence algorithm as 'seed' to obtain pseudo-random sequence binary bit sequence k2。
3. Experimental data
With a quantum key distribution device, such as that of FIG. 3, a seed key k is shared between users Alice and Bob1. The quantum key distribution equipment finds synchronous light through stabilizing transmission voltage, automatically synchronizes and delays, and the process is shown in figure 3, so as to obtain a quantum random key k1。
20-bit binary bit key k generated by quantum key distribution equipment1Inputting the data as a seed into a linear equivalence algorithm to obtain a 200-bit binary bit pseudo-random number k2。
The linear congruence algorithm code and the run results are shown in fig. 5.
4. Security analysis
4.1 interception-retransmission attack
If an eavesdropper Eve exists in the communication process of Alice and Bob, most information of the protocol is disclosed through a public channel, so that eavesdropping can only occur in a quantum channel. If Eve will be S1The qubits in (a) are intercepted and eavesdropped and then sent to Bob. Because the quantum states used by the protocol are non-orthogonal to each other, Eve does not know the specific quantum state and can not acquire information. According to the quantum unclonable theorem (without destroying unknown quanta, it is impossible to clone the quanta): the eavesdropping behavior of Eve necessarily brings about a disturbance to S1. The disturbance can be discovered by Alice and Bob through the error rate, and further the eavesdropping behavior of Eve is discovered, so that the interception-retransmission attack cannot be successful.
5.2 entanglement attack
If the eavesdropper Eve will S1Capture of qubit in (1), and pair S1The particle in (1) is subjected to unitary operation E to form a larger Hilbert space, and the value of |0 is obtained>And |1>States formed after the respective attacks
Wherein { e00，e01，e10，e11The operators E determine four pure states, and the normalization conditions are met:
the matrix representation of unitary operation E of Eve is
Since EE is equal to I, a, b, a ', b' satisfy the following relationship
|a|2+|b|2＝1
|a'|2+|b'|2＝1
ab*＝(a')*b'
Further result in
|a|2＝|a'|2,|b|2＝|b'|2
At the time of security detection, Eve is detected with a probability P. If Eve attacks the particles in the entangled state, the interference of the eavesdropper necessarily introduces errors, so that the existence of the eavesdropper can be detected with the probability of P.
P＝|b|2＝1-|a|2＝|b'|2＝1-|a'|2
When no error is introduced, the total particle can only be a direct product of the auxiliary quantum states of Eve. But the direct product state indicates that there is no correlation between the helper particles and the particles, so the eavesdropper does not obtain any useful information, thereby proving that the entanglement attack is not successful.
5. Randomness analysis
The quantum random number k is obtained by experiments1，k1＝00010011101100011100。k1Inputting linear congruence as' seedThe algorithm obtains a pseudo random sequence binary bit sequence k2， k2＝283483864712408716237293098180225377348957308785228764716622892031 01808468184608257706587530381224342174921422916505856310581267548082 226439880216309280330330589508989884390920249812478106312562966528。
Use ENT (Pseudo-random Number Sequence Test Program) Test Program pair k2The randomness test was carried out, and the test results were as follows
k2Arithmetic mean 4.41;
k28.6619;
k2the first order autocorrelation function was found to be 0.04.
Thus, pseudo random number k2Satisfying the random number characteristic.
6. Efficiency analysis
Obtained by experiment, k1Is generated for a time t1，t1＝0.00256S。k2Is generated for a time t2，t2＝0.01707S。
The generation efficiency of the quantum random key is 7799.54b/s, and the generation efficiency of the pseudo-random number is 600bit/0.017074 s-35141.15 b/s by the linear congruence algorithm.
The quantum pseudo random number generation time of 600 bits is t3，t3＝0.00256s+0.01707s＝0.01963s。
The generation time of the quantum random key of 600 bits is t4，t4＝600/7799.54＝0.07693s。
In the experiment, the ratio of the generation efficiency of the quantum pseudo random number to the quantum random key efficiency is p, and p is t4/t3＝0.07693s/0.01964s＝3.92
With the further increase of the key length, the generation efficiency of the quantum pseudo random number is further improved, and the ratio of the quantum pseudo random number to the quantum random key is higher than 3.92. Thus, quantum pseudo random numbers are more efficient in key generation than quantum random keys.
The present invention will be further described with reference to effects.
The algorithm used by the invention is simple and easy to realize, the key generation speed is high, and the security of the key is ensured by physical characteristics such as the heisenberg inaccurate measurement principle, quantum unclonable theorem, the relevance and non-localization of entangled particles and the like in quantum mechanics, so that the random number has unconditional security and true randomness. By combining quantum key distribution with a classical pseudo-random number generation algorithm, the quantum pseudo-random number generation scheme has the advantages of both and overcomes the defects of the two technologies. The invention improves the safety, the randomness and the key generation efficiency of the shared random number, and also reduces the key generation cost, thereby leading the one-time pad encryption mode to be easier to realize in real life.
The present invention will be further described with reference to the experimental effects.
Fig. 3 is a quantum key distribution device, fig. 4a is a stable transmission voltage, fig. 4b is a seeking synchronous light, fig. 4c is an automatic synchronous delay, fig. 4d is a shared quantum random key, and fig. 5 is a graph of experimental program operation results.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When used in whole or in part, can be implemented in a computer program product that includes one or more computer instructions. When loaded or executed on a computer, cause the flow or functions according to embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, the computer instructions may be transmitted from one website site, computer, server, or data center to another website site, computer, server, or data center via wire (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL), or wireless (e.g., infrared, wireless, microwave, etc.)). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that includes one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.
Claims (7)
1. A quantum pseudo-random number generation method is characterized in that the quantum pseudo-random number generation method comprises the steps of sharing a seed key with the same binary bit by both communication parties by utilizing QKD, then inputting the seed into a pseudo-random number generator of a linear congruence random number generation algorithm by both communication parties, and enabling both communication parties to share the pseudo-random number with the same binary bit as a key of a one-time pad.
2. A quantum pseudorandom number generation method as claimed in claim 1 wherein the quantum pseudorandom number generation method further comprises:
step one, a first participant and a second participant of a protocol share a linear congruence random number generation algorithm in a public channel;
step two, the first participant of the protocol randomly prepares a solution containing 4n single photons and having a polarization state of |0>，|1>，|+>，|->A quantum sequence S of1(ii) a The first participant of the protocol sends S through the quantum channel1To a second participant of the protocol;
step three, the second participant of the protocol receives S1Thereafter, the pairs S of X and Z radicals are randomly used1Making measurements and publishing the sequence of used bases through a common channel;
step four, the first participant of the protocol prepares S according to the base sequence used by the second participant of the protocol1The single photon state corresponding to the same base is reserved, and different bases are comparedThe corresponding single photon state is discarded to form a quantum sequence S2；
Step five, the first participant of the protocol is at S2Randomly selecting a part of single photons and publishing the preparation state of the single photons through a public channel, and comparing the preparation state and the measurement state of the part of single photons by a second participant of the protocol to perform eavesdropping inspection;
step six, if a second participant of the protocol finds that the error rate of the enticing particles exceeds a threshold value, eavesdropping exists in communication, and the protocol is terminated; otherwise, no eavesdropping exists in the communication, and the protocol continues to be carried out;
step seven, the first participant of the protocol and the second participant of the protocol simultaneously abandon the single photon for eavesdropping check, and the residual particles form a quantum sequence S3(ii) a Will S3Middle (| 0)>，|->) Coded to 0, will (| 1)>，|+>) Coded 1, the first participant of the protocol and the second participant of the protocol being based on S3Obtain a binary bit sequence k1；
Step eight, the first participant of the agreement and the second participant of the agreement will be k1Linear congruence algorithm is input as seed to obtain pseudo-random sequence binary bit sequence k2。
3. The quantum pseudorandom number generation method of claim 2 wherein in step one, the linear congruential random number generation algorithm comprises:
the next number is obtained by performing linear operation and modulo operation on the previous number, and the recursion formula is:
xn+1＝(axn+c)mod m
wherein: a is a multiplier, 0<a<m; c is increment, c is more than or equal to 0<m; m is the modulus, m>0；X0Is an initial value, X is not less than 00<M；xn+1Is a random number, x is more than or equal to 0n+1<M。
4. The quantum pseudorandom number generation method of claim 2 wherein in step three, the X and Z groups are: the X base and the Z base are two measurement bases for quantum key distribution, wherein the X base { + >, | - >) is a set of standard orthogonal bases; z base { + >, | - >) is another set of orthonormal bases;
the X group and the Z group are non-orthogonal groups and satisfy the following relation:
5. a quantum pseudo random number generation system for implementing the quantum pseudo random number generation method according to any one of claims 1 to 4.
6. A computer program product stored on a computer readable medium, comprising a computer readable program for providing a user input interface for implementing a quantum pseudorandom number generation method as claimed in any one of claims 1 to 4 when executed on an electronic device.
7. A computer-readable storage medium comprising instructions which, when executed on a computer, cause the computer to perform the quantum pseudorandom number generation method of any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010789935.8A CN112068803B (en) | 2020-08-07 | 2020-08-07 | Quantum pseudo-random number generation method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010789935.8A CN112068803B (en) | 2020-08-07 | 2020-08-07 | Quantum pseudo-random number generation method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112068803A true CN112068803A (en) | 2020-12-11 |
| CN112068803B CN112068803B (en) | 2024-08-20 |
Family
ID=73660862
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010789935.8A Active CN112068803B (en) | 2020-08-07 | 2020-08-07 | Quantum pseudo-random number generation method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112068803B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2608353A (en) * | 2021-05-18 | 2023-01-04 | Arqit Ltd | Random number generation in quantum key distribution |
| CN115801257A (en) * | 2023-02-13 | 2023-03-14 | 广东广宇科技发展有限公司 | Quantum encryption-based big data secure transmission method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040109564A1 (en) * | 2002-07-05 | 2004-06-10 | Nicolas Cerf | High-rate quantum key distribution scheme relying on continuously phase and amplitude-modulated coherent light pulses |
| CN111490875A (en) * | 2020-04-23 | 2020-08-04 | 成都信息工程大学 | Cloud data semi-quantum secure sharing method and system based on proxy re-encryption |
-
2020
- 2020-08-07 CN CN202010789935.8A patent/CN112068803B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040109564A1 (en) * | 2002-07-05 | 2004-06-10 | Nicolas Cerf | High-rate quantum key distribution scheme relying on continuously phase and amplitude-modulated coherent light pulses |
| CN111490875A (en) * | 2020-04-23 | 2020-08-04 | 成都信息工程大学 | Cloud data semi-quantum secure sharing method and system based on proxy re-encryption |
Non-Patent Citations (1)
| Title |
|---|
| 江英华;: "基于伪随机数的量子密钥分发方案", 中国新技术新产品, no. 15, 16 August 2020 (2020-08-16), pages 19 - 20 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2608353A (en) * | 2021-05-18 | 2023-01-04 | Arqit Ltd | Random number generation in quantum key distribution |
| GB2608353B (en) * | 2021-05-18 | 2024-10-16 | Arqit Ltd | Random number generation in quantum key distribution |
| CN115801257A (en) * | 2023-02-13 | 2023-03-14 | 广东广宇科技发展有限公司 | Quantum encryption-based big data secure transmission method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112068803B (en) | 2024-08-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Gao et al. | Quantum private query: A new kind of practical quantum cryptographic protocol | |
| Long et al. | Theoretically efficient high-capacity quantum-key-distribution scheme | |
| Liu et al. | A protocol for the quantum private comparison of equality with χ-type state | |
| Long et al. | Quantum secure direct communication and deterministic secure quantum communication | |
| Ugwuishiwu et al. | An overview of quantum cryptography and shor’s algorithm | |
| Kuang et al. | Quantum permutation pad for universal quantum-safe cryptography | |
| CN108599942A (en) | Without the half quantum privacy comparative approach of measurement-repeating transmission tangled | |
| CN112068803B (en) | Quantum pseudo-random number generation method and system | |
| Liu et al. | Quantum multi-party private comparison protocol using d-dimensional Bell states | |
| Fehr | Quantum cryptography | |
| Das et al. | Improving the security of" measurement-device-independent quantum communication without encryption" | |
| Akrom | Hybrid quantum key distribution protocol with chaotic system for securing data transmission | |
| Sabani et al. | Quantum Key Distribution: Basic Protocols and Threats | |
| Huang et al. | Cryptanalysis and improvement of a multi-user quantum communication network using χ-type entangled states | |
| Das et al. | Secure multi-party quantum conference and xor computation | |
| Zhu et al. | Efficient quantum secret sharing scheme with two-particle entangled states | |
| Win et al. | Analysis of quantum key distribution protocols | |
| Zhang et al. | Quantum-key-expansion protocol based on number-state-entanglement-preserving tensor network with compression | |
| Zakaria et al. | Enhancing the randomness of symmetric key using genetic algorithm | |
| Jiang et al. | A quantum pseudo-random number generation scheme | |
| Zeng et al. | Quantum key distribution with authentication | |
| JP2007189517A (en) | Quantum cryptography device | |
| Liliana | Two, Three and Four Dimensional BB84: A Comparative Analysis Based on C# Simulation | |
| Knight et al. | Quantum Information Processing and Cryptography | |
| CN115549899B (en) | Two-party quantum key distribution method based on encryption three-photon matrix product state |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |