A reliable and secure semi-quantum communication method based on quantum data compression.

Abstract

The present invention discloses a reliable and secure semi-quantum communication method based on the quantum data compression algorithm, which can transmit quantum information sequences securely, thereby reducing the consumption of quantum resources in the communication process and broadening the scope of communication use. The present invention further designs a new random out-of-order arrangement method, and designs a pseudo-random number generator based on a one-way hash function, thereby randomly disordering the orderly information flow and enhancing the unpredictability and confidentiality in the information transmission process. In addition, the present invention compresses and encrypts quantum secret information based on the quantum data compression technology, which can effectively defend against various attacks and improve the security and reliability of information transmission. The present invention broadens the overall scope of use of quantum secret communication networks and reduces the cost of implementing the technology.

Description

Technical Field

[0001] The present invention relates to the field of quantum secure communication, and specifically to a provably secure semi-quantum communication method based on quantum data compression.

Background Art

[0002] Quantum informatics is mainly divided into two aspects: quantum computing and quantum communication. Various quantum algorithms in quantum computing compensate for the disadvantages of low efficiency and corresponding delay of representative algorithms. Quantum communication, as the intersection of information theory, quantum mechanics and cryptography, utilizes the physical properties of microscopic particles to achieve accurate, effective and secure information transmission. Among many fields of quantum communication, the security of provably secure quantum communication is relatively high because its quantum carrier is not transmitted through an external channel.

[0003] In 1999, Shimizu and Imoto first proposed a certainty-safe quantum communication (DSQC) method based on EPR pairs, laying the foundation for certainty-safe quantum communication. In 2002, Beige et al. proposed a certainty-safe quantum communication scheme using a single photon as the carrier, simplifying the communication flow. Then, in 2004, Yan and Zhang designed a highly secure certainty-safe quantum communication algorithm based on teleportation. In 2005, Man et al. similarly proposed several certainty-safe quantum communication schemes based on teleportation and entanglement swapping. Subsequently, in 2006, Li et al. designed two types of certainty-safe quantum communication schemes based on entanglement-pure states and multidimensional single-photon states, respectively, increasing the quantum states of the carrier and broadening the ideas and directions of the research. In 2007, Long et al. proposed a certainty-safe quantum communication scheme, noting its unique property that a secure message can only be read after the receiver has obtained at least one bit of representative information. Building on this, in 2014, Shukla et al. extended a certainty-safe quantum communication scheme based on orthogonal states, which does not actually transmit message qubits and is relatively secure. In 2017, Joy et al. proposed two certainty-safe quantum algorithms using different quantum states as transmission channels. While all of these proposed certainty-safe quantum communication schemes have excellent properties, they still require substantial quantum resources and equipment, making them very expensive.

[0004] With the advancement of science and technology, the design of quantum secure communication schemes that can conserve quantum resources and equipment has become a research boom. Based on this, Boyer et al. first proposed the concept of semi-quantum communication. So-called semi-quantum communication means that the communication does not have the ability to create or measure quantum states, but rather there are participants who can only perform related operations on quantum states based on the computing-based Z base, thereby achieving the goal of conserving quantum resources. With the application and promotion of the semi-quantum concept, related applications such as semi-quantum key distribution, semi-quantum secret sharing, semi-quantum secure direct communication, and semi-quantum dialogue are being proposed one after another in many fields of quantum secure communication. However, research in the field of certainty-secure semi-quantum communication is currently relatively scarce. [Overview of the project] [Problems that the invention aims to solve]

[0005] The problem that this invention aims to solve is to provide a reliable and secure semi-quantum communication method based on quantum data compression that solves the problem in conventional quantum secure communication technology, where the consumption of quantum resources during the specific implementation of various communication methods is large and therefore impractical. [Means for solving the problem]

[0006] To solve the above-mentioned problems, the present invention employs the following technical solution. The specific implementation process is as follows:

[0007] Step A involves pre-setting the number of pseudo-random numbers and initializing the internal state counter with the pseudo-random number seed,

[0008] Step B involves calculating the hash value of the counter using a one-way hash function Hash, Step C involves outputting the hash value as a pseudo-random number and adding 1 to the counter value,

[0009] A pseudorandom number generator characterized by including step D, which repeats steps B to C until a set number of pseudorandom numbers has been generated.

[0010] Step a: Based on the length of the information sequence, a pseudorandom number sequence twice the length of the sequence is generated using the aforementioned pseudorandom number generator, Step b involves a one-to-one correspondence between an information sequence and a sequence in which the length of the first pseudo-random number is equal, in order.

[0011] Step c involves assigning a new positional order to each information bit in an ordered information sequence based on the value of a pseudorandom number, and arranging them in ascending order of the pseudorandom values. A method for randomizing an ordered flow of information, comprising step d, which is the step of obtaining a random arrangement of an ordered flow of information.

[0012] The corresponding pseudorandom seed is known, the corresponding pseudorandom sequence is generated, and the information sequence is recovered by inverse estimation. A method for coding quantum secret information data, comprising two parts: compression and decompression of triple-particle bit data,

[0013] Regarding the compression of qubit data, the transmitting side first transmits the initial quantum state to a representative or non-representative subspace, obtains the corresponding representative or non-representative state, performs a unitary transformation, recodes after the transformation, measures a specific qubit, and based on the different results, transmits the previous two different qubits to the quantum channel, that is, transmits two corresponding quantum information bits to the receiving side.

[0014] A method for coding quantum secret information data, characterized in that, regarding the decompression of quantum data, the receiving side receives the compressed sequence, then restores the information by inverse unitary transform, and transforms the data into a representative state. The sender performs the conversion according to the following formula: JPEG0007831798000001.jpg37170

[0015] The specific process by which the sender measures a particular qubit is: JPEG0007831798000002.jpg63170 Initial state creation, step 1: The transmitting side prepares N ordered qubit secret information streams and a sufficiently large number of decoy photons, and transmits the decoy photons to the receiving side via a quantum channel.

[0016] In an eavesdropping test, the receiving side, after receiving a decoy photon sequence, randomly selects some of the photons and performs a Z-base measurement or reflection operation. In the measurement operation, the receiving side uses the Z-base, a representative computing base, to measure the particle, stores the result, and generates a state identical to the result, which is then sent back to the transmitting side. In the reflection operation, the receiving side reflects the particle back to the transmitting side without being affected by external disturbances.

[0017] Step 2 involves the receiving side disclosing the location of the detected particle and the corresponding operation to the transmitting side after the transmitting side has received the particle, and the transmitting side then conducting an eavesdropping check.

[0018] A random arrangement of information flow, wherein the transmitting side and the receiving side each prepare one pseudo-random number generator according to claim 1, Classical correspondence Step 3 involves sharing a pseudorandom number seed via the channel, generating 2N pseudorandom numbers, and the sender rearranging the quantum secret information flow out of order based on the aforementioned random arrangement method of ordered information flow to obtain a new sequence.

[0019] Compression, encryption and transmission, step 4 comprising compressing the new sequence obtained in step 3 using the quantum secret information data coding method described in any one of the above items, and transmitting the compressed sequence to the receiver via a quantum channel,

[0020] The key is revealed, and after the receiver receives the compression sequence, the sender will decompress it. Step 5 of transmitting to the receiving side the key that needs to be sequentially added to the received quantum state;

[0021] Data decompression and recovery, wherein the receiving side decompresses the compressed data based on the key, and releases the randomness by the foregoing method to recover the original information flow, step 6; A secure and safe semi-quantum communication method characterized by including the above.

[0022] The specific process of eavesdropping inspection by the receiving side in step 2 is that when the receiving side performs a measurement operation, the transmitting side compares the measurement results,

[0023] When the receiving side performs a reflection operation, the transmitting side performs an X-basis measurement on the received particles and compares the measurement results,

[0024] Return the measurement results to the transmitting side, and the transmitting side determines the error rate received. If the error rate is higher than a predetermined safety threshold, abandon the current communication. If the error rate is below the predetermined safety threshold, the transmitting side discards these detected particles and continues to execute the operations of the next step.

[0025] In step 4, when the multi-dimensional quantum bit information is compressed, the transmitting side divides the quantum bits in the new sequence obtained in step 3 into groups of three in a three-dimensional tensor space for compression. In step 5, the transmitting side transmits the key Classical correspondence to the receiving side via the channel.

Advantages of the Invention

[0026] Compared with the prior art, the present invention utilizes the characteristics of quantum mechanics and proposes a method that can effectively and securely transmit quantum secret information sequences in the semi-quantum field based on quantum data compression and decompression algorithms. It expands the entire scope of use of the quantum secure communication network and reduces the cost of implementing the technology. Specifically, it has the following advantages.

[0027] 1. Based on the characteristics of conventional reliable and secure quantum communication, the present invention proposes a reliable and secure semi-quantum communication method based on quantum data compression, which can effectively defend against various representative attacks, accurately transmit quantum confidential messages, has high transmission efficiency, and is highly practical.

[0028] 2. The present invention combines decoy photon technology and pseudo-random number generation technology to guarantee the security and integrity of information transmission and to have relatively high resistance to attacks.

[0029] 3. The present invention designs a random arrangement rule for an ordered flow of information, thereby improving unpredictability and confidentiality in information transmission processes. [Brief explanation of the drawing]

[0030] [Figure 1] This is a flowchart of the overall method of the present invention. [Figure 2] This is a schematic diagram of the transformation between the representative set and the representative subspace. [Figure 3] This is a schematic diagram of data compression. [Figure 4] This is a pseudo-random number generator based on a one-way hash function. [Figure 5] This is a map of the random arrangement rules for an ordered flow of information. [Modes for carrying out the invention]

[0031] To enable a person skilled in the art to better understand the embodiments of the present invention, the technical solutions in the embodiments of the present invention will be described clearly and completely below, together with the accompanying drawings of the embodiments of the present invention. However, it will be clear that the embodiments described are only a part of the embodiments of the present invention, and not all embodiments. All other embodiments that a person skilled in the art can obtain based on the embodiments of the present invention without any creative work are within the scope of the present application.

[0032] The objective of this invention is to overcome the shortcomings of conventional methods, solving problems such as the high consumption of quantum resources, high application costs, limited users, and poor practicality that occur when various communication methods are specifically implemented. Furthermore, it aims to improve the security and reliability of the entire communication by designing more secure encryption rules by combining representative encryption algorithms. Based on a quantum data compression algorithm, we propose a certainty-secure semi-quantum communication scheme that can securely transmit quantum information sequences, thereby reducing the consumption of quantum resources in the communication process and expanding the scope of communication use.

[0033] This invention further designs a novel random out-of-order sequencing method for sequences and, by designing a pseudo-random number generator based on a one-way hash function, randomly disrupts the sequencing of ordered information flows, thereby enhancing unpredictability and confidentiality in information transmission processes.

[0034] Furthermore, this invention can compress and encrypt quantum secret information based on quantum data compression technology, effectively defend against various attacks, and improve the security and reliability of information transmission.

[0035] It is a pseudo-random number generator, and the specific implementation process is as follows: Step A involves pre-setting the number of pseudo-random numbers and initializing the internal state counter with the pseudo-random number seed,

[0036] Step B involves calculating the hash value of the counter using a one-way hash function Hash,

[0037] Step C involves outputting the hash value as a pseudo-random number and adding 1 to the counter value, Step D includes repeating steps B and C until the set number of pseudo-random numbers has been generated.

[0038] In a specific example, as shown in Figure 4, a pseudo-random number generator based on a one-way hash function is employed to satisfy the unpredictability of random numbers. The detailed execution steps are described as follows, and the algorithm is a simplified description of them.

[0039] (1) Initialize the internal state counter with a pseudo-random number seed. (2) Calculate the hash value of the counter using the one-way hash function Hash. (3) Output the hash value as a pseudorandom number. (4) Add 1 to the value of the counter. (5) Repeat steps (2) to (4) based on the number of pseudorandom numbers required. Specifically, this is shown in the code in Table 1 below.

[0040] Table 1 JPEG0007831798000004.jpg95170

[0041] A method for randomly arranging an orderly flow of information is, Step a: Based on the length of the information sequence, a pseudorandom number sequence twice the length of the sequence is generated using the pseudorandom number generator described above. Step b involves a one-to-one correspondence between an information sequence and a sequence in which the length of the first pseudo-random number is equal, in order. Step c involves assigning a new positional order to each information bit in the order information sequence based on the pseudo-random value, and arranging them in ascending order of the pseudo-random values. This includes step d, which is to obtain a random arrangement of an ordered flow of information.

[0042] In a specific embodiment, as shown in Figure 5, for one ordered information sequence I, its length I is given. N Let = 4, and the subscript N indicates the length of the sequence, which is then sorted randomly out of order according to the following steps. (1) Length of information sequence I NBased on =4, in order to avoid generating repeatability of pseudorandom numbers, a pseudorandom number generator based on a one-way hash function is used to generate a pseudorandom number sequence P having a length twice that of I, i.e., P N = 8 (2) The information sequence I and the sequence in which the first element of the pseudorandom number sequence P has a length of 4 are matched in order. (3) Based on the pseudo-random number Pi, i=1,...,N, a new positional order is assigned to each information bit in and they are arranged in ascending order according to Pi. (4) Obtain a random sequence of ordered information flows.

[0043] As can be seen from the rules of random sorting, if we have a corresponding pseudorandom seed and generate a corresponding pseudorandom sequence, we can recover the information sequence by inverse estimation.

[0044] The coding method for quantum secret information data includes two parts: compression and decompression of triple quantum bit data. Regarding the compression of quantum bit data, the sender first transmits the initial quantum state to a representative or non-representative subspace, obtains the corresponding representative or non-representative state, performs a unitary transformation, recodes after the transformation, measures a specific quantum bit, and based on the different results, transmits the previous two different quantum bits to the quantum channel, i.e., transmits two corresponding quantum information bits to the receiver. Decompression of quantum data involves the receiving end receiving a compressed sequence, then restoring the information through an inverse unitary transform, and finally converting the data to a representative state.

[0045] Specific examples are shown in Figures 2 and 3. A schematic diagram of the transformation between the representative set and the representative subspace related to this method is shown in Figure 2, and its principle is as follows. Based on the optimal compression theory in Schumacher quantum coding, as n→∞, the optimal compression that is compatible with any high fidelity is log(dimH)=nS(ρ) (i.e., dimH=2) nS(ρ) This refers to compressing the data into a Hilbert space that satisfies the following conditions: n is the length of the character information, H is the dimension of the Hilbert space, and S(ρ) is the von Neumann entropy.

[0046] Based on long character information of length n, JPEG0007831798000005.jpg66170

[0047] In this case, the larger n is, the closer this density matrix approaches a single subspace in the entire Hilbert space of all character information, and the number of dimensions of this subspace is 2. nS(ρ) It is presumed that there is a tendency for it to asymptotically approach this value.

[0048] Using the theoretical support of representative information theory, we select an orthogonal basis to diagonalize , and for one particular n and an infinitesimal value ε, the representative subspace Ω has ρ such that the eigenvalue λ satisfies the following equation n If defined as a space that can be pinched out to eigenvectors, A schematic diagram of the conversion from the representative set to the representative subspace is shown in Figure 2.

[0049] The main idea behind coding is to reliably transmit the quantum state to a representative subspace, in which case blurring measurements may be performed. JPEG0007831798000007.jpg21170

[0050] Figure 3 is a schematic diagram of data compression, and the principle is as follows. Quantum data compression refers to a technique that, assuming the rational transmission of photons, compresses information containing a large number of qubits so that it can be represented by a small number of qubits and transmitted through quantum channels, and finally recovers with a certain degree of fidelity.

[0051] 1. Compression algorithm for three-particle quantum data JPEG0007831798000008.jpg21170 is compressed, and the flow is as follows: (1) When compressing quanta, the transmitting side uses a unitary transform U to perform the transformation. JPEG0007831798000009.jpg96170(3) Regardless of the result, the sender only uses the first two quantum information bits. JPEG0007831798000010.jpg16161 enables the compression and transmission of quantum information.

[0052] 2. Algorithm for decompressing three-particle quantum data After the receiving end receives the compressed sequence, it performs the following transformation.

[0053] JPEG0007831798000011.jpg102170

[0054] The reliable and secure semi-quantum communication method is The initial state is created in step 1, in which the transmitting side prepares a stream of N order qubit secret information and a sufficiently large number of decoy photons, and transmits the decoy photons to the receiving side via a quantum channel. In an eavesdropping test, the receiving side receives a decoy photon sequence, selects some of the photons, and randomly performs a Z-base measurement or reflection operation. In the measurement operation, the receiving side uses the Z-base, a representative computing base, to measure the particles, stores the results, and generates a state identical to the results and sends it back to the transmitting side. In the reflection operation, the receiving side reflects the particles back to the transmitting side without being affected by external disturbances. Step 2 involves the receiving side disclosing the location of the detected particle and the corresponding operation to the transmitting side after the transmitting side has received the particle, and the transmitting side then conducting an eavesdropping check. A random arrangement of information flow, wherein the sender and receiver each prepare one of the aforementioned pseudo-random number generators. Classical correspondenceStep 3 involves sharing a pseudorandom number seed via a channel, generating 2N pseudorandom numbers, and the sender rearranging the quantum secret information flow out of order based on a random arrangement method for ordered information flows to obtain a new sequence. Compression, encryption and transmission, comprising step 4, compressing the new sequence obtained in step 3 using the quantum secret information data coding method described above, and transmitting the compressed sequence to the receiving side via a quantum channel. Decompression and recovery of JPEG0007831798000012.jpg33170 data, comprising step 6, the receiving side decompresses the compressed data based on a key, derandomizes it using the aforementioned random arrangement method of the ordered information flow, and recovers the original information stream. A specific example is shown in Figure 1. The message sender (Alice) possesses quantum capabilities and can perform the relevant quantum operations, while the message receiver (Bob) possesses representative capabilities, but its quantum operations are limited to (1) accessing quantum channels, (2) measuring quantum states in Z groups, (3) creating quantum states based on Z groups, and (4) rearranging qubits using quantum delay lines. The principle that realizes the entire method can be broadly divided into the following steps. Step 1: Initial state creation, where Alice has N ordered qubit secret information JPEG0007831798000013.jpg12170 and decoy photons are sent to Bob via the quantum channel. Step 2: In the eavesdropping test, Bob receives a decoy photon sequence, then selects some of the photons and randomly performs Z-base measurements or reflection operations.

[0055] In the measurement operation, Bob is the representative computing base. JPEG0007831798000014.jpg12170 The result is retained and the same state as the result is generated and sent to Alice, and in the reflection operation, Bob reflects the particle to Alice without being affected by disturbances.

[0056] After Alice receives the particle, Bob reveals the location of the detected particle and the corresponding operation to Alice, who then performs an eavesdropping test. 2-1: When Bob performs the measurement operation, Alice compares the measurement results. 2-2: If Bob performs a reflection operation, Compare the measurement results for JPEG0007831798000015.jpg12170.

[0057] Alice obtains an error rate. If the error rate is higher than a predetermined safety threshold, she abandons the current communication. If the error rate is below the predetermined safety threshold, Alice discards these detected particles and proceeds to the next step.

[0058] Step 3: A random sequence of information flows, with Alice and Bob each preparing a pseudo-random number generator based on a one-way hash function. Classical correspondence A pseudorandom number seed is shared via a channel, and 2N pseudorandom numbers are generated. Alice rearranges the quantum secret information stream out of order based on the random arrangement rules of an ordered information stream to obtain a new sequence Q'.

[0059] Step 4: Compression, encryption, and transmission. When multidimensional qubit information is compressed, the complexity becomes very high, so Alice compresses the qubits in sequence Q' by dividing them into groups of three (in three-dimensional tensor space). JPEG0007831798000016.jpg13170 For the specific compression process, refer to the quantum data compression algorithm. After the compression is complete, Alice sends the resulting compressed sequence Q'' to Bob via the quantum channel.

[0060] Step 5: Key disclosure. After Bob receives Q'', Alice will receive the key needed for decompression. JPEG0007831798000017.jpg11170 Classical correspondence Send to Bob via the channel.

[0061] Step 6: Decompression. Bob decompresses the secret information based on the key and Q'' to obtain Q'. For the specific process, refer to the quantum data decompression documentation.

[0062] Step 7: De-randomization and recovery. Based on the generated pseudo-random number sequence, Bob de-randomizes the decompressed sequence Q' to obtain sequence Q, accurately recovers the secret information, and successfully communicates.

[0063] It should be noted that the terms “including,” “having,” and any variations thereof in the specification, claims, and drawings of this application are intended to cover non-exclusive inclusion, for example, a process, method, system, product, or equipment including a series of steps or units, including, but not limited to, any other steps or units not explicitly listed or specific to those processes, methods, products, or equipment.

[0064] Those skilled in the art will understand that modifications can be realized by combining the prior art and the embodiments described above, and these modifications will not be described further here. Such modifications do not affect the substantial content of the present invention and will not be described further here.

[0065] It should be understood that the present invention is not limited to the specific embodiments described above, and that apparatuses and structures not described in detail should be understood to be carried out in the general manner of the art. Those skilled in the art can make many possible changes and modifications to the technical solutions of the present invention using the methods and technical content disclosed above, or modify them into equivalent examples of equivalent changes, without departing from the scope of the technical solutions of the present invention, and this does not affect the essential content of the invention. Therefore, any simple modifications, equivalent changes, and modifications made to the above embodiments based on the technical substance of the present invention without departing from the content of the technical solutions of the present invention still remain within the scope of protection of the technical solutions of the present invention.

Claims

1. The initial state is created in step 1, in which the transmitting side prepares a stream of N ordered qubit secret information and a predetermined number of decoy photons, and transmits the decoy photons to the receiving side via a quantum channel. In an eavesdropping test, the receiving side, after receiving a decoy photon sequence, selects some of the photons and randomly performs a Z-base measurement or reflection operation. In the measurement operation, the receiving side measures the particle using the Z-base, which is a representative computing base, stores the measurement result, and generates the same state and sends it back to the transmitting side. In the reflection operation, the receiving side reflects the particle back to the transmitting side without adding any disturbance to the particle. Step 2 involves the receiving party disclosing the location of the detected particle and the corresponding operation to the transmitting party after the transmitting party has received the particle, and the transmitting party then conducting an eavesdropping test. Step 3 is a random arrangement of the information flow, in which the sender and receiver each prepare one pseudorandom number generator, share a pseudorandom number seed via a classical communication channel, generate 2N pseudorandom numbers, and the sender rearranges the quantum secret information flow out of order based on an ordered random arrangement method of the information flow to obtain a new sequence. Compression, encryption and transmission, comprising step 4, which compresses the new sequence obtained in step 3 by coding quantum secret information data and transmits the compressed sequence to the receiving side via a quantum channel, Step 5 involves key disclosure, in which, after the receiver receives the compressed sequence, the sender sends a key to the receiver indicating that the qubit |0> must be sequentially added to the received quantum state during decompression. Data decompression and recovery, including step 6 in which the receiving party decompresses the compressed data based on the key, removes randomness, and restores the original information flow, The method for randomly arranging the orderly flow of information in step 3 is: Step a: Based on the length of the information sequence, a pseudorandom number generator is used to generate a pseudorandom number sequence that is twice the length of the sequence. Step b involves sequentially associating an information sequence with a sequence corresponding to the first sequence length of a pseudorandom number in a one-to-one manner, Step c involves assigning a new positional order to each information bit in an ordered information sequence based on the value of a pseudorandom number, and rearranging them in ascending order of the pseudorandom number values. The process includes step d, which involves obtaining a random arrangement of an ordered flow of information, Furthermore, the specific implementation process of the pseudo-random number generator is as follows: Step A involves pre-setting the number of pseudo-random numbers to generate and initializing the internal state counter using the pseudo-random number seed. Step B involves calculating the hash value of the counter using a one-way hash function (Hash), Step C involves outputting the hash value as a pseudo-random number and adding 1 to the counter value, Step D includes repeating steps B and C until the set number of pseudorandom numbers is reached, The method for coding quantum secret information data in step 4 is: It involves two processes: compression and decompression of triple-particle bit data. In the compression of triple quantum bit data, the transmitting side first assigns the initial quantum state to a representative or non-representative subspace, obtains the corresponding representative or non-representative state, performs a unitary transformation, performs coding again after the transformation, measures a specific qubit, and, depending on the measurement result, transmits the previous two different qubits to the quantum channel, thereby transmitting the corresponding two quantum information bits to the receiving side. In decompressing triple-particle data, after the receiving end receives the compressed sequence, the information is recovered using inverse unitary transform, and the data is converted to a representative state. A reliable and secure semi-quantum communication method characterized by the following:

2. The corresponding pseudorandom number seed is known, and a corresponding pseudorandom sequence is generated based on that seed. The information sequence is then recovered by inverse estimation using these pseudorandom numbers. The reliable and secure semiquantum communication method according to feature 1.

Images