CN116132036A - Deterministic safety semi-quantum communication method based on quantum data compression - Google Patents
Deterministic safety semi-quantum communication method based on quantum data compression Download PDFInfo
- Publication number
- CN116132036A CN116132036A CN202310126905.2A CN202310126905A CN116132036A CN 116132036 A CN116132036 A CN 116132036A CN 202310126905 A CN202310126905 A CN 202310126905A CN 116132036 A CN116132036 A CN 116132036A
- Authority
- CN
- China
- Prior art keywords
- quantum
- sender
- pseudo
- information
- sequence
- 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.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0852—Quantum cryptography
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/04—Protocols for data compression, e.g. ROHC
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Electromagnetism (AREA)
- Theoretical Computer Science (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
The invention discloses a deterministic and safe semi-quantum communication method capable of safely transmitting a quantum information sequence based on a quantum data compression algorithm, which reduces the consumption of quantum resources in the communication process and expands the application range of communication. The invention also designs a new random disorder arrangement method, and designs a pseudo-random number generator based on a one-way hash function, thereby carrying out random disorder arrangement on the ordered information flow and enhancing the unpredictability and confidentiality in the information transmission process. In addition, the invention compresses and encrypts the quantum secret information based on the quantum data compression technology, can effectively resist various attacks, and improves the safety and reliability of information transmission. The invention widens the application range of the quantum secret communication network, and reduces the cost of technical implementation.
Description
Technical Field
The invention belongs to the field of quantum secret communication, and particularly relates to a deterministic safety half-quantum communication method based on quantum data compression.
Background
Quantum informatics is largely divided into two aspects: quantum computing and quantum communication. Various quantum algorithms in quantum computation make up for the defects of low efficiency and untimely classical algorithms. Quantum communication is used as the intersection of information theory, quantum mechanics and cryptography, and the physical properties of microscopic particles are utilized to realize accurate, effective and safe transmission of information. Among the many branches of quantum communication, the security of deterministic secure quantum communication is relatively high, because its quantum carriers are not transmitted through external channels.
In 1999, shimizu and Imoto proposed the first Deterministic Secure Quantum Communication (DSQC) method based on EPR pairs, which laid the foundation of deterministic secure quantum communication. In 2002, beige et al propose a deterministic secure quantum communication scheme using single photons as carriers, simplifying the communication flow. Next 2004, yan and Zhang designed deterministic and secure quantum communication algorithms based on stealth transmission states, which were highly secure. In 2005, man et al also proposed some deterministic secure quantum communication schemes based on invisible states and entanglement exchanges. Later, in 2006, li and the like respectively design two deterministic secure quantum communication schemes based on entangled pure states and multidimensional single photon states, so that carrier quantum states are increased, and the thought and direction of research are widened. In 2007 Long et al proposed deterministic secure quantum communication schemes and pointed out its unique property that the recipient could read a secret message only after obtaining at least one classical piece of information. Based on this, in 2014, shukla et al extended deterministic secure quantum communication schemes based on orthogonal states, which did not actually transmit message qubits, with higher security. In 2017, joy et al proposed two types of deterministic safe quantum algorithms using different quantum states as transmission channels. Even though these proposed deterministic secure quantum communication schemes have good characteristics, they do not have enough quantum resources and equipment, and are costly.
With the development of science and technology, the design of a quantum secret communication scheme capable of saving quantum resources and equipment becomes a research hot trend, and based on the research, boyer et al propose a half-quantum concept for the first time. The half quantum communication, namely the communication in which the participants do not have the capability of preparing and measuring the quantum state, can only perform relevant operation on the quantum state on the basis of calculating the base Z group, thereby achieving the purpose of saving quantum resources. With the application and popularization of half quantum concepts, related applications of multiple branches of quantum secret communication are proposed successively, such as half quantum key distribution, half quantum secret sharing, half quantum secure direct communication, half quantum conversation and the like. However, for the deterministic secure semi-quantum communication field, there is relatively little research currently done.
Disclosure of Invention
The technical problems to be solved by the invention are as follows: the deterministic safety half quantum communication method based on quantum data compression solves the problems of large quantum resource consumption and low practicability generated when various communication methods are concretely implemented in the existing quantum secret communication technology.
The invention adopts the following technical scheme for solving the technical problems:
the specific implementation process of the pseudo-random number generator comprises the following steps:
step A, presetting the number of pseudo-random numbers, and initializing an internal state counter by using a pseudo-random number seed;
step B, calculating a Hash value of the counter by using a one-way Hash function Hash;
step C, outputting the hash value as a pseudo-random number, and adding 1 to the value of a counter;
and D, repeating the steps B to C until the set pseudo-random number is completed.
A method for random arrangement of ordered information streams, comprising the steps of:
step a, according to the length of the information sequence, generating a pseudo-random number sequence with the length twice as long as the sequence length by using the pseudo-random number generator;
step b, the information sequences are in one-to-one correspondence with sequences with the same length as the first pseudo random number;
step c, endowing each information bit in the ordered information sequence with a new position sequence according to the numerical value of the pseudo-random number, and arranging the pseudo-random number from small to large;
and d, obtaining random arrangement of the ordered information stream.
Knowing the corresponding pseudo-random number seeds, generating a corresponding pseudo-random sequence, and recovering the information sequence by reverse pushing.
The quantum secret information data coding method is characterized in that: the method comprises two parts of three-quantum bit data compression and decompression; the method comprises the steps that a sender firstly sends an initial quantum state into a typical or atypical subspace, after the corresponding typical state or atypical state is obtained, the initial quantum state or atypical state is subjected to unitary conversion and recoding, measurement is carried out on specific quantum bits, and the first two different quantum bits are respectively sent into a quantum channel according to different results, namely, the corresponding two quantum information bits are sent to a receiver;
after receiving the compressed sequence, the receiver restores the information through inverse unitary transformation to convert the data into a typical state.
The sender converts according to the following formula:
wherein |ψ typ >Is in a typical state; i psi Ntyp >Is in atypical form; .
The specific procedure for the sender to measure on a specific qubit is as follows:
the sender makes measurements on the 3 rd qubit of |ψ',
if the measurement result is 0, the input state is projected to the typical subspace Ω, and the two qubits fed into the quantum channel are |xy>Called |psi c1 >；
If the measurement is 1, the input state is projected to atypical subspace Ω ⊥ Two qubits fed into the quantum channel are |mn>Called |psi c2 >。
A deterministic secure semi-quantum communication method comprising the steps of:
step1, initial state preparation, wherein a sender prepares N ordered quantum bit secret information streams and enough decoy photons, and sends the decoy photons to a receiver through a quantum channel;
step2, eavesdropping inspection, after receiving the decoy photon sequence, selecting part of photons to randomly perform Z-base measurement or reflection operation, wherein in the measurement operation, the receiver measures particles by using classical calculation base Z-base, reserves the result, generates the same state as the result and sends the same state back to the sender;
in the reflection operation, the receiving side is not interfered and reflects the particles back to the sending side;
after the sender receives the particles, the receiver publishes the positions and corresponding operations of detecting the particles to the sender, and the sender performs eavesdropping inspection;
step3, randomly arranging information flows, respectively preparing a pseudo-random number generator by a sender and a receiver, sharing a pseudo-random number seed through a classical channel, and generating 2N pseudo-random numbers; the sender performs disorder rearrangement on the quantum secret information stream according to the random arrangement method of the ordered information stream to obtain a new sequence;
step4, compressing, encrypting and transmitting, compressing the new sequence obtained in the step3 by using the quantum secret information data coding method, and transmitting the compressed sequence to a receiver through a quantum channel;
step5, publishing the secret key, when the receiving party receives the compressed sequence, the sending party sequentially attaches the secret key, namely the quantum bit |0> in decompression, to the received quantum state and sends the secret key to the receiving party;
and 6, decompressing and recovering the data, wherein the receiver decompresses the compressed data according to the secret key, and applies the method of claim 3 to decompress and randomize, so as to recover the original information stream.
The specific process of the receiver eavesdropping check in the step2 is as follows:
if the receiver performs the measurement operation, the sender compares the measurement result;
if the receiving party executes the reflection operation, the transmitting party executes X-base measurement on the received particles and compares the measurement results;
and sending the measurement result back to the sender, wherein the sender judges the received error rate, and if the error rate is higher than a preset safety threshold, the sender gives up the communication; otherwise, the sender discards the detection particles and proceeds to the next operation.
In step4, when the multidimensional qubit information is compressed, the sender divides the qubits in the new sequence obtained in step3 into groups of every three in the 3-dimensional tensor space for compression.
In step5, the sender sends the key to the receiver over the classical channel.
Compared with the prior art, the invention provides a method for effectively and safely transmitting the quantum secret information sequence in the field of semi-quanta based on the quantum data compression and decompression algorithm by utilizing the characteristic of quantum mechanics, widens the application range of the whole quantum secret communication network, reduces the cost of technical implementation, and particularly has the following advantages:
1. according to the characteristics of traditional deterministic secure quantum communication, the deterministic secure semi-quantum communication method based on quantum data compression is provided, various classical attacks can be effectively resisted, accurate transmission of quantum secret information is carried out, the transmission efficiency is high, and the practicability is strong.
2. The invention combines the decoy photon technology and the pseudo-random number generation technology, ensures the safety and the integrity of information transmission, and has higher attack resistance.
3. The invention designs the random arrangement rule of the ordered information flow, and increases the unpredictability and confidentiality in the information transmission process.
Drawings
FIG. 1 is a block diagram of the overall process route of the present invention;
FIG. 2 is a schematic diagram of the conversion of a typical set to a typical subspace;
FIG. 3 is a schematic diagram of data compression;
FIG. 4 is a pseudo-random number generator based on a one-way hash function;
fig. 5 is a random permutation rule map of an ordered information stream.
Detailed Description
In order to make the present application solution better understood by those skilled in the art, the following description will be made in detail and with reference to the accompanying drawings in the embodiments of the present application, it is apparent that the described embodiments are only some embodiments of the present application, not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art based on the embodiments herein without making any inventive effort, shall fall within the scope of the present application.
The invention aims to make up the defects of the existing method, solves the problems of large quantum resource consumption, high application cost, small audience range, low practicability and the like generated when various communication methods are implemented, combines a classical encryption algorithm, designs an encryption rule with higher security, and improves the security and reliability of integral communication. Based on a quantum data compression algorithm, a deterministic and safe half-quantum communication scheme capable of safely transmitting quantum information sequences is provided, so that the consumption of quantum resources in the communication process is reduced, and the application range of communication is enlarged.
The invention also designs a new random sequence disorder arrangement method, and designs a pseudo-random number generator based on a one-way hash function, thereby carrying out random disorder arrangement on the ordered information flow and enhancing the unpredictability and confidentiality in the information transmission process.
In addition, the invention compresses and encrypts the quantum secret information based on the quantum data compression technology, can effectively resist various attacks, and improves the safety and reliability of information transmission.
The specific implementation process of the pseudo-random number generator comprises the following steps:
step A, presetting the number of pseudo-random numbers, and initializing an internal state counter by using a pseudo-random number seed;
step B, calculating a Hash value of the counter by using a one-way Hash function Hash;
step C, outputting the hash value as a pseudo-random number, and adding 1 to the value of a counter;
and D, repeating the steps B to C until the set pseudo-random number is completed.
In particular embodiments, as shown in fig. 4, to satisfy the unpredictability of random numbers, a pseudo-random number generator based on a one-way hash function is used, the detailed execution steps are described below, and the Algorithm is described in brief:
(1) Initializing an internal state counter with a pseudorandom number seed;
(2) Calculating a Hash value of the counter by using a one-way Hash function Hash;
(3) Outputting the hash value as a pseudo-random number;
(4) The value of the counter is increased by 1;
(5) Repeating steps (2) through (4) according to the number of pseudo random numbers required. The codes in table 1 are shown specifically below.
TABLE 1
A method for random arrangement of ordered information streams, comprising the steps of:
step a, according to the length of the information sequence, generating a pseudo-random number sequence with the length twice as long as the sequence length by using the pseudo-random number generator;
step b, the information sequences are in one-to-one correspondence with sequences with the same length as the first pseudo random number;
step c, endowing each information bit in the ordered information sequence with a new position sequence according to the numerical value of the pseudo-random number, and arranging the pseudo-random number from small to large;
and d, obtaining random arrangement of the ordered information stream.
In the embodiment shown in FIG. 5, for an ordered information sequence I, it is assumed that its length is I N =4, subscript N indicates the sequence length, according to the following procedureIt performs random out-of-order rearrangement:
(1) According to the length I of the information sequence N To avoid the repetition of generating pseudo-random numbers, =4, a pseudo-random number sequence P, i.e. P, twice as long as I is generated using a pseudo-random number generator based on a one-way hash function N ＝8；
(2) Sequentially corresponding the information sequence I with a first sequence with the length of 4 of the pseudo-random number sequence P;
(3) According to the value P of pseudo-random number i I=1, …, N, a new position order is assigned to each information bit in I, and P is the same as i Ranging from small to large;
(4) A randomly arranged sequence of ordered information streams is obtained.
According to the rule of random rearrangement, if the corresponding pseudo random number seeds are possessed, the corresponding pseudo random sequence is generated, and the information sequence can be recovered through reverse pushing.
The quantum secret information data coding method comprises three quantum bit data compression and decompression; the method comprises the steps that a sender firstly sends an initial quantum state into a typical or atypical subspace, after the corresponding typical state or atypical state is obtained, the initial quantum state or atypical state is subjected to unitary conversion and recoding, measurement is carried out on specific quantum bits, and the first two different quantum bits are respectively sent into a quantum channel according to different results, namely, the corresponding two quantum information bits are sent to a receiver;
after receiving the compressed sequence, the receiver restores the information through inverse unitary transformation to convert the data into a typical state.
In the specific embodiment, as shown in fig. 2 and 3,
the conversion schematic diagram of the typical set and the typical subspace involved in the method is shown in fig. 2, and the principle is as follows:
according to the optimal compression theory in Schumacher quantum encoding:
when n→infinity, the best compression compatible with any high fidelity is to compress to a value that satisfies log (dimH) =ns (ρ) (i.e., dimh=2 nS(ρ) ) Hilbert of (A)In space, where n is the length of the character information, H is the dimension of Hilbert space, and S (ρ) is Feng Nuo Emaman entropy.
Based on the long character information of length n, it is assumed that each character is randomly synthesized from a pure state
Wherein x=1, …, n, p x For corresponding quantum state->
Then the density matrix ρ of each character is
Density matrix ρ of whole character information n Is that
It is deduced that the larger n is, the closer this density matrix is to a subspace of the entire Hilbert space of the entire character information, and the dimension of this subspace gradually tends to 2 nS(ρ) 。
By utilizing the theoretical support of classical information theory, selecting an orthogonal basis for diagonalizing rho,
definition: for a particular value of n and infinitesimal value ε, the typical subspace Ω is ρ where eigenvalue λ satisfies the formula n The space that the eigenvectors are spread apart,
2 -n(S(ρ)+ε) ≤λ≤2 -n(S(ρ)-ε)
then for the following
δ is an infinitesimal value and n is sufficiently large, ρ is obeyed to this condition n Eigenvalue sum tr (ρ) n E) Will be satisfied (where E is the projection operator to the typical subspace Ω, POVM)
tr(ρ n E)＞1-δ
And, the dimension dim (Ω) of the eigenvalue thus satisfies
(1-δ)2 n(S(ρ)-ε) ≤dim(Ω)≤2 n(S(ρ)+ε)
A schematic diagram of its conversion from a typical set to a typical subspace is shown in fig. 2.
The main idea of encoding is to reliably feed the quantum states into the canonical subspace, at which time a fuzzy measurement can be made, projecting the input information into the canonical subspace Ω or the atypical subspace Ω ⊥ The result is a probability P of a typical subspace Ω Ω ＝tr(ρ n E)＞1-δ。
As shown in fig. 3, which is a schematic diagram of data compression, the principle is as follows:
the quantum data compression refers to a technology of compressing information containing a large number of quantum bits on the premise of reasonably transmitting photons, enabling the information to be represented by a small number of quantum bits and transmitted in a quantum channel, and finally recovering the information with certain fidelity.
1. Three-particle quantum data compression algorithm
The sender first sends the initial quantum state into a typical omega or atypical omega ⊥ Subspace, in obtaining the corresponding representative state |psi typ >Or atypical state |ψ Ntyp >After that, it is compressed, and the flow is as follows:
(1) When quantum compression is performed, the sender performs conversion by using unitary transformation U,
then |ψ' > =u|ψ > is the result of the recoding.
(2) The sender makes measurements on the 3 rd qubit of |ψ' >:
1) If the measurement result is 0, the input state is projected to the typical subspace Ω, and the two qubits fed into the quantum channel are |xy>Called |psi c1 >；
2) If the measurement result is 1, then the inputThe incoming state is projected to atypical subspace Ω ⊥ Two qubits fed into the quantum channel are |mn>Called |psi c2 >。
(3) Regardless of the result, the sender sends only the first two quantum information bits, i.e. |ψ c1 >And |psi c2 >To realize quantum information compression transmission.
2. Three-particle quantum data decompression algorithm
After receiving the compressed sequence, the receiver will perform the following transformations:
(1) When quantum decompression is performed, the receiver transmits the quantum bit |0>Added to the received quantum state, and transformed by inverse unitary transformation U -1 The information is restored, the execution,
(2) In decompression, the original state |ψ is restored typ >The atypical state is also converted into the typical state at this time, but since any measurement is made on the state obtained in the characteristic state base vector, the measurement result is mapped to atypical subspace Ω ⊥ The probability of (2) is only 0.058, and thus the number of typical states converted from atypical states is small.
A deterministic secure semi-quantum communication method comprising the steps of:
step1, initial state preparation, wherein a sender prepares N ordered quantum bit secret information streams and enough decoy photons, and sends the decoy photons to a receiver through a quantum channel;
and step2, eavesdropping inspection, wherein after receiving the decoy photon sequence, a receiver selects partial photons to randomly perform Z-based measurement or reflection operation.
In the measurement operation, the receiving side measures the particles by using a classical calculation base Z base, reserves the result, generates the same state as the result and sends the same state back to the sending side;
in the reflection operation, the receiving side is not interfered and reflects the particles back to the sending side;
after the sender receives the particles, the receiver publishes the positions and corresponding operations of detecting the particles to the sender, and the sender performs eavesdropping inspection;
step3, randomly arranging information flows, respectively preparing a pseudo-random number generator by a sender and a receiver, sharing a pseudo-random number seed through a classical channel, and generating 2N pseudo-random numbers; the sender performs disorder rearrangement on the quantum secret information stream according to a random arrangement method of the ordered information stream to obtain a new sequence;
step4, compressing, encrypting and transmitting, compressing the new sequence obtained in the step3 by using the quantum secret information data coding method, and transmitting the compressed sequence to a receiver through a quantum channel;
step5, publishing the secret key, when the receiving party receives the compressed sequence, the sending party sequentially attaches the secret key, namely the quantum bit |0> in decompression, to the received quantum state and sends the secret key to the receiving party through a classical channel;
and 6, decompressing and recovering the data, wherein the receiver decompresses the compressed data according to the secret key, and applies the method of claim 3 to decompress and randomize, so as to recover the original information stream.
In a specific embodiment, as shown in figure 1,
the message sender (Alice) has quantum capability and can perform relevant quantum operations, and the message receiver (Bob) has classical capability, and the quantum operations are limited only to: (1) accessing a quantum channel; (2) being capable of measuring quantum states on the Z-group; (3) preparing a quantum state based on the Z group; (4) rearranging the qubits using a quantum delay line. The implementation principle of the whole method is roughly divided into the following steps:
step1: preparing in an initial state; alice prepares N ordered streams of qubit secret information Q and enough decoy photons { |0>, |1>, |++ >, |- >, and sends the decoy photons to Bob over the quantum channel.
Step2: eavesdropping inspection; when Bob receives the decoy photon sequence, some of them are selected to randomly perform a Z-based measurement or reflection operation.
In the measurement operation, bob measures the particles by using a classical calculation base Z base { I0 >, |1> }, reserves the result, generates the same state as the result and sends back to Alice;
in the reflection operation Bob is undisturbed to reflect particles back to Alice.
After Alice receives the particles, bob publishes the positions of the detected particles to Alice and corresponding operations, and Alice performs eavesdropping inspection:
2-1: if Bob performs the measurement operation, alice compares the measurement results;
2-2: if Bob performs a reflection operation, alice performs an X-base { |++ >, |- - } measurement on the received particle, and compares the measurements.
Alice will get an error rate and discard the communication if the error rate is above a predetermined safety threshold; otherwise, alice discards the detection particles and proceeds to the next step.
Step3: a random arrangement of information streams; alice and Bob respectively prepare a pseudo-random number generator based on a one-way hash function, share a pseudo-random number seed through a classical channel, and generate 2N pseudo-random numbers. Alice performs disorder rearrangement on the quantum secret information stream according to the random arrangement rule of the ordered information stream to obtain a new sequence Q'.
Step4: compression encryption and transmission; when multi-dimensional qubit information is compressed, the complexity becomes very high, so Alice compresses the qubits in the sequence Q' into groups of three (in 3-dimensional tensor space):
|Q'>＝{|aaa>,|aab>,|aba>,|abb>,|baa>,|bab>,|bba>,|bbb>}
the specific compression process is shown in a quantum data compression algorithm. After compression is completed, alice sends the resulting compressed sequence Q "to Bob over a quantum channel.
Step5: a public key; when Bob receives Q ", alice sends the key required for decompression (i.e., qubit |0> appended to the received quantum state in turn) to Bob over the classical channel.
Step6: decompressing; bob decompresses the secret information according to the key and Q "to obtain Q', and the specific process may refer to quantum data decompression.
Step7: derandomizing and recovering; and (3) according to the generated pseudo-random number sequence, the Bob de-randomizes the decompressed sequence Q' to obtain a sequence Q, accurately recovers secret information, and successfully communicates.
It should be noted that the terms "comprises" and "comprising," and any variations thereof, in the description and claims of the present application and in the foregoing figures, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed or inherent to such process, method, article, or apparatus.
Those skilled in the art should understand that, in combination with the prior art and the above embodiments, those skilled in the art may implement modifications, and such modifications do not affect the essential content of the present solution, which is not described herein.
It is to be understood that the present solution is not limited to the particular embodiments described above, wherein devices and structures not described in detail are to be understood as being implemented in a manner common in the art; any person skilled in the art, using the methods and technical content disclosed above, may make many possible variations and modifications of the technical solution or be modified into equivalent embodiments of equivalent variations without affecting the essential content of the solution, without departing from the scope of the technical solution. Therefore, any simple modification, equivalent variation and modification of the above embodiments according to the technical substance of the present solution still falls within the scope of protection of the technical solution of the present solution.
Claims (10)
1. A pseudo-random number generator characterized by: the specific implementation process comprises the following steps:
step A, presetting the number of pseudo-random numbers, and initializing an internal state counter by using a pseudo-random number seed;
step B, calculating a Hash value of the counter by using a one-way Hash function Hash;
step C, outputting the hash value as a pseudo-random number, and adding 1 to the value of a counter;
and D, repeating the steps B to C until the set pseudo-random number is completed.
2. A method for random arrangement of ordered information streams, characterized by: the method comprises the following steps:
step a, according to the length of the information sequence, generating a pseudo-random number sequence twice as long as the length of the sequence by using the pseudo-random number generator of claim 1;
step b, the information sequences are in one-to-one correspondence with sequences with the same length as the first pseudo random number;
step c, endowing each information bit in the ordered information sequence with a new position sequence according to the numerical value of the pseudo-random number, and arranging the pseudo-random number from small to large;
and d, obtaining random arrangement of the ordered information stream.
3. The method for random permutation of ordered information streams according to claim 2, characterized in that: knowing the corresponding pseudo-random number seeds, generating a corresponding pseudo-random sequence, and recovering the information sequence by reverse pushing.
4. The quantum secret information data coding method is characterized in that: the method comprises two parts of three-quantum bit data compression and decompression; the method comprises the steps that a sender firstly sends an initial quantum state into a typical or atypical subspace, after the corresponding typical state or atypical state is obtained, the initial quantum state or atypical state is subjected to unitary conversion and recoding, measurement is carried out on specific quantum bits, and the first two different quantum bits are respectively sent into a quantum channel according to different results, namely, the corresponding two quantum information bits are sent to a receiver;
after receiving the compressed sequence, the receiver restores the information through inverse unitary transformation to convert the data into a typical state.
5. The quantum secret information data encoding method according to claim 4, wherein: the sender converts according to the following formula:
wherein |ψ typ >Is in a typical state; i psi Ntyp >Is in atypical form; .
6. The quantum secret information data encoding method according to claim 5, wherein: the specific procedure for the sender to measure on a specific qubit is as follows:
the sender makes measurements on the 3 rd qubit of |ψ',
if the measurement result is 0, the input state is projected to the typical subspace Ω, and the two qubits fed into the quantum channel are |xy>Called |psi c1 >；
If the measurement is 1, the input state is projected to atypical subspace Ω ⊥ Two qubits fed into the quantum channel are |mn>Called |psi c2 >。
7. The deterministic safety semi-quantum communication method is characterized in that: the method comprises the following steps:
step1, initial state preparation, wherein a sender prepares N ordered quantum bit secret information streams and enough decoy photons, and sends the decoy photons to a receiver through a quantum channel;
step2, eavesdropping inspection, after receiving the decoy photon sequence, selecting part of photons to randomly perform Z-base measurement or reflection operation, wherein in the measurement operation, the receiver measures particles by using classical calculation base Z-base, reserves the result, generates the same state as the result and sends the same state back to the sender;
in the reflection operation, the receiving side is not interfered and reflects the particles back to the sending side;
after the sender receives the particles, the receiver publishes the positions and corresponding operations of detecting the particles to the sender, and the sender performs eavesdropping inspection;
step3, random arrangement of information flow, namely respectively preparing a pseudo-random number generator according to claim 1 by a sender and a receiver, sharing pseudo-random number seeds through classical channels, and generating 2N pseudo-random numbers; a sender performs disorder rearrangement on the quantum secret information stream according to the random arrangement method of the ordered information stream as set forth in claim 2 or 3 to obtain a new sequence;
step4, compressing, encrypting and transmitting, compressing the new sequence obtained in the step3 by using the quantum secret information data coding method according to any one of claims 4 to 6, and transmitting the compressed sequence to a receiver through a quantum channel;
step5, publishing the secret key, when the receiving party receives the compressed sequence, the sending party sequentially attaches the secret key, namely the quantum bit |0> in decompression, to the received quantum state and sends the secret key to the receiving party;
and 6, decompressing and recovering the data, wherein the receiver decompresses the compressed data according to the secret key, and applies the method of claim 3 to decompress and randomize, so as to recover the original information stream.
8. The deterministic secure semi-quantum communication method according to claim 7, wherein: the specific process of the receiver eavesdropping check in the step2 is as follows:
if the receiver performs the measurement operation, the sender compares the measurement result;
if the receiving party executes the reflection operation, the transmitting party executes X-base measurement on the received particles and compares the measurement results;
and sending the measurement result back to the sender, wherein the sender judges the received error rate, and if the error rate is higher than a preset safety threshold, the sender gives up the communication; otherwise, the sender discards the detection particles and proceeds to the next operation.
9. The deterministic secure semi-quantum communication method according to claim 7, wherein: in step4, when the multidimensional qubit information is compressed, the sender divides the qubits in the new sequence obtained in step3 into groups of every three in the 3-dimensional tensor space for compression.
10. The deterministic secure semi-quantum communication method according to claim 7, wherein: in step5, the sender sends the key to the receiver over the classical channel.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310126905.2A CN116132036A (en) | 2023-02-17 | 2023-02-17 | Deterministic safety semi-quantum communication method based on quantum data compression |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310126905.2A CN116132036A (en) | 2023-02-17 | 2023-02-17 | Deterministic safety semi-quantum communication method based on quantum data compression |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116132036A true CN116132036A (en) | 2023-05-16 |
Family
ID=86311535
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310126905.2A Pending CN116132036A (en) | 2023-02-17 | 2023-02-17 | Deterministic safety semi-quantum communication method based on quantum data compression |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116132036A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116782206A (en) * | 2023-08-23 | 2023-09-19 | 南京中科齐信科技有限公司 | Train-mounted wireless ad hoc network security method and system based on quantum communication |
-
2023
- 2023-02-17 CN CN202310126905.2A patent/CN116132036A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116782206A (en) * | 2023-08-23 | 2023-09-19 | 南京中科齐信科技有限公司 | Train-mounted wireless ad hoc network security method and system based on quantum communication |
| CN116782206B (en) * | 2023-08-23 | 2023-10-24 | 南京中科齐信科技有限公司 | Train-mounted wireless ad hoc network security method and system based on quantum communication |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Deng et al. | Two-step quantum direct communication protocol using the Einstein-Podolsky-Rosen pair block | |
| Lin et al. | Quantum secure direct communication with χ-type entangled states | |
| Long et al. | Quantum secure direct communication and deterministic secure quantum communication | |
| Sun et al. | Quantum secure direct communication with two-photon four-qubit cluster states | |
| Bourennane et al. | Quantum key distribution using multilevel encoding | |
| CN107222307B (en) | Controlled quantum secure direct communication method based on four-particle cluster state | |
| WO2019069103A1 (en) | A system and method for quantum-safe authentication, encryption and decryption of information | |
| Cao et al. | Quantum secure direct communication with cluster states | |
| Li et al. | Quantum probabilistic encryption scheme based on conjugate coding | |
| CN107493168A (en) | Quanta identity authentication method and its application process during quantum key distribution | |
| CN116132036A (en) | Deterministic safety semi-quantum communication method based on quantum data compression | |
| Huang et al. | Quantum secure direct communication based on quantum homomorphic encryption | |
| Yu-Guang et al. | An efficient quantum secure direct communication scheme with authentication | |
| WO2010011127A2 (en) | Quantum network relay | |
| Noura et al. | Efficient chaotic encryption scheme with OFB mode | |
| You-Bang et al. | Quantum dialogue by using non-symmetric quantum channel | |
| Li et al. | Improved quantum “Ping-pong” protocol based on GHZ state and classical XOR operation | |
| Chauhan et al. | Bidirectional quantum secure direct communication using dense coding of four qubit cluster states | |
| Li et al. | Deterministic Quantum Secure Direct Communication and Authentication Protocol Based on W‐Class State | |
| Zhang et al. | Quantum-key-expansion protocol based on number-state-entanglement-preserving tensor network with compression | |
| ABDULLAH et al. | Implementing quantum image security algorithm based on geometric transformation and quantum random number generation | |
| Guo et al. | Multi-party deterministic secure quantum communication using d-dimension GHZ state | |
| Wang et al. | Quantum secure direct communication without using perfect quantum channel | |
| Wang et al. | General probabilistic dense coding scheme | |
| Avritzer et al. | Quantum steganography via coherent-and Fock-state encoding in an optical medium |
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 |