Quantum secure communication negotiation method, device, equipment, medium and program product

Abstract

The application discloses a quantum secure communication negotiation method and device, equipment, medium and program product, and relates to the technical field of communication. The method comprises the following steps: receiving a target sequence transmitted by a second communication end based on an original sequence through a quantum channel; converting the target sequence into a first Gaussian sequence with uniform distribution; encoding the first Gaussian sequence by using a parallel concatenated recursive systematic convolution code to obtain a check sequence, and sending the check sequence to the second communication end, so that the second communication end determines key information corresponding to the original sequence by decoding the check sequence and a second Gaussian sequence corresponding to the original sequence through the parallel concatenated recursive systematic convolution code; and determining the key information by decoding the first Gaussian sequence and the check sequence through the parallel concatenated recursive systematic convolution code. According to the application, the quantum secure communication negotiation and key error correction can be more safely and efficiently realized, so that the overall quantum secure communication negotiation efficiency and error correction accuracy can be effectively improved.

Description

Technical Field

[0001] This application belongs to the field of communication technology, and in particular relates to a quantum secure communication negotiation method, apparatus, equipment, medium and program product. Background Technology

[0002] With the development of the information age, high-speed information transmission has become a fundamental element of technological innovation in many industries. Specific scenarios such as autonomous driving and vehicle-to-everything (V2X) require low-latency information transmission. However, as the demand for communication system throughput increases, information security also becomes a crucial aspect that needs attention. In today's society, with the development of big data, cloud computing, and other emerging technologies, people are increasingly emphasizing information transmission speeds. Vehicle-to-everything (V2X) and 5G (5th-Generation Mobile Communication Technology) communications require real-time data transmission. However, in the rapid dissemination of information, information security has become an unavoidable issue. Much transmitted data is inadvertently eavesdropped on or illegally used, posing information security risks. Therefore, in this data age, ensuring the secure transmission of information is essential.

[0003] In real-world communication systems, classic secure communication relies on encryption and decryption techniques based on computational and cryptographic principles. This involves using various encryption methods to transform plaintext into ciphertext before sending it to the receiver. However, the content exchanged between the two parties in this communication method is highly vulnerable to eavesdropping, making secure information transmission impossible. Especially in this increasingly information-dependent era, ensuring the security of encryption keys during transmission and distribution is a critical challenge we must address. Summary of the Invention

[0004] This application provides a quantum secure communication negotiation method, apparatus, device, medium, and program product, which can more securely and efficiently realize quantum secure communication negotiation and key error correction, thereby effectively improving the overall quantum secure communication negotiation efficiency and error correction accuracy.

[0005] In a first aspect, embodiments of this application provide a quantum secure communication negotiation method, applied at a first communication terminal, the quantum secure communication negotiation method comprising:

[0006] The target sequence transmitted by the second communication terminal based on the original sequence is received via a quantum channel;

[0007] Transform the target sequence into a uniformly distributed first Gaussian sequence;

[0008] The first Gaussian sequence is encoded using a parallel concatenated recursive system convolutional code to obtain a check sequence. The check sequence is then sent to the second communication terminal so that the second communication terminal can determine the key information corresponding to the original sequence by decoding the second Gaussian sequence corresponding to the check sequence and the original sequence using the parallel concatenated recursive system convolutional code.

[0009] The key information is determined by decoding the convolutional code using a parallel concatenated recursive system based on the first Gaussian sequence and the check sequence.

[0010] In some possible implementations, converting the target sequence into a uniformly distributed first Gaussian sequence includes:

[0011] Normalize the target sequence;

[0012] The normalized target sequence is spherized to obtain the first Gaussian sequence.

[0013] In some possible implementations, after spherizing the normalized target sequence to obtain the first Gaussian sequence, the quantum secure communication negotiation method further includes:

[0014] The target rotation matrix is ​​determined based on the normalized target sequence and the first Gaussian sequence.

[0015] The target rotation matrix is ​​transmitted to the second communication terminal so that the second communication terminal can convert the original sequence into a second Gaussian sequence based on the target rotation matrix.

[0016] In some possible implementations, key information is determined by decoding convolutional codes in a parallel concatenated recursive system based on the first Gaussian sequence and the check sequence, including:

[0017] Based on the first Gaussian sequence and the check sequence, the second Gaussian sequence is obtained;

[0018] The key information is determined by decoding the convolutional code using a parallel concatenated recursive system based on the second Gaussian sequence and the check sequence.

[0019] In some possible implementations, a second Gaussian sequence is obtained by reconstructing the sequence based on the first Gaussian sequence and the check sequence, including:

[0020] The second Gaussian sequence is obtained by reconstructing the first Gaussian sequence, the check sequence, and the original key rate.

[0021] In some possible implementations, sending the verification sequence to the second communication terminal includes:

[0022] The verification sequence is sent to the second communication terminal through a common channel.

[0023] Based on the same inventive concept, in a second aspect, embodiments of this application provide a quantum secure communication negotiation method applied to a second communication terminal, the quantum secure communication negotiation method comprising:

[0024] The original sequence is transmitted to the first communication terminal through a quantum channel so that the first communication terminal receives the target sequence corresponding to the original sequence.

[0025] The original sequence is converted into a uniformly distributed second Gaussian sequence;

[0026] The system receives a verification sequence sent by the first communication terminal. The verification sequence is obtained by the first communication terminal encoding the first Gaussian sequence using a parallel concatenated recursive system convolutional code. The first Gaussian sequence corresponds to the target sequence.

[0027] Based on the second Gaussian sequence and the check sequence, the key information corresponding to the original sequence is determined by convolutional code decoding using a parallel concatenated recursive system.

[0028] In some possible implementations, converting the original sequence into a uniformly distributed second Gaussian sequence includes:

[0029] Receive the target rotation matrix sent by the first communication terminal. The target rotation matrix is ​​the rotation matrix from the normalized target sequence to the first Gaussian sequence.

[0030] The second Gaussian sequence is determined based on the target rotation matrix and the original sequence.

[0031] In some possible implementations, the quantum secure communication negotiation method further includes, before determining the second Gaussian sequence based on the target rotation matrix and the original sequence:

[0032] Normalize the original sequence;

[0033] Based on the target rotation matrix and the original sequence, the second Gaussian sequence is determined, including:

[0034] The second Gaussian sequence is determined based on the target rotation matrix and the original sequence after normalization.

[0035] In some possible implementations, receiving the verification sequence sent by the first communication end includes:

[0036] The verification sequence sent by the first communication terminal is received through a common channel.

[0037] Based on the same inventive concept, in a third aspect, embodiments of this application provide a quantum secure communication negotiation device applied to a first communication terminal, the quantum secure communication negotiation device comprising:

[0038] The first receiving module is used to receive the target sequence transmitted by the second communication end based on the original sequence through a quantum channel;

[0039] The first conversion module is used to convert the target sequence into a uniformly distributed first Gaussian sequence.

[0040] The first sending module is used to encode the first Gaussian sequence using parallel concatenated recursive system convolutional codes to obtain a verification sequence, and send the verification sequence to the second communication terminal so that the second communication terminal can determine the key information corresponding to the original sequence by decoding the second Gaussian sequence corresponding to the verification sequence and the original sequence using parallel concatenated recursive system convolutional codes.

[0041] The first decoding module is used to determine the key information by decoding the convolutional code of a parallel concatenated recursive system based on the first Gaussian sequence and the check sequence.

[0042] Based on the same inventive concept, in a fourth aspect, embodiments of this application provide a quantum secure communication negotiation device applied to a second communication terminal, the quantum secure communication negotiation device comprising:

[0043] The first transmission module is used to transmit the original sequence to the first communication terminal through a quantum channel, so that the first communication terminal receives the target sequence corresponding to the original sequence.

[0044] The second conversion module is used to convert the original sequence into a uniformly distributed second Gaussian sequence.

[0045] The second receiving module is used to receive the verification sequence sent by the first communication end. The verification sequence is obtained by the first communication end encoding the first Gaussian sequence using a parallel concatenated recursive system convolutional code. The first Gaussian sequence corresponds to the target sequence.

[0046] The first determining module is used to determine the key information corresponding to the original sequence by using a parallel concatenated recursive system convolutional code decoding based on the second Gaussian sequence and the check sequence.

[0047] Based on the same inventive concept, in a fifth aspect, embodiments of this application provide a quantum secure communication negotiation device, which includes:

[0048] Processor and memory storing computer program instructions;

[0049] When the processor executes the computer program instructions, it implements the quantum secure communication negotiation method provided in any of the embodiments of this application described above.

[0050] Sixthly, embodiments of this application provide a computer storage medium storing computer program instructions, which, when executed by a processor, implement the quantum secure communication negotiation method provided in any of the above embodiments of this application.

[0051] In a seventh aspect, embodiments of this application provide a computer program product in which instructions, when executed by a processor of an electronic device, cause the electronic device to perform a quantum secure communication negotiation method as provided in any of the embodiments of this application described above.

[0052] As described above, the quantum secure communication negotiation method, apparatus, device, medium, and program product of this application embodiment receive a target sequence transmitted by a second communication end based on an original sequence through a quantum channel, and then converts the target sequence into a uniformly distributed first Gaussian sequence. A first receiving end encodes the first Gaussian sequence using a parallel concatenated recursive system convolutional code Turbo code to obtain a verification sequence, and sends the verification sequence to the second communication end. After receiving the verification sequence, the second communication end can determine the key information corresponding to the original sequence using Turbo code based on the second Gaussian sequence corresponding to the verification sequence and the original sequence. Then, the first communication end can determine the key information by decoding with Turbo code based on the first Gaussian sequence and the verification sequence, thereby realizing quantum secure communication negotiation and decoding error correction between the first and second communication ends. This application provides a quantum secure communication negotiation method, apparatus, device, medium, and program product. By using parallel concatenated recursive system convolutional codes for relevant encoding and decoding during the quantum key negotiation and error correction process, it exhibits good negotiation performance in quantum secure communication negotiation scenarios. It can more securely and efficiently realize quantum secure communication negotiation and key error correction, thereby effectively improving the overall quantum secure communication negotiation efficiency and error correction accuracy. Attached Figure Description

[0053] To more clearly illustrate the technical solutions of the embodiments of this application, the accompanying drawings used in the embodiments of this application will be briefly introduced below. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0054] Figure 1 This is a schematic flowchart of a quantum secure communication negotiation method provided in an embodiment of this application;

[0055] Figure 2 This is a flowchart illustrating a quantum secure communication negotiation method provided in another embodiment of this application;

[0056] Figure 3 This is a schematic diagram of the encoder principle of Turbo code provided in one embodiment of this application;

[0057] Figure 4 This is a schematic diagram of the structure of a Turbo code decoder according to an embodiment of this application;

[0058] Figure 5This is a summary process for multidimensional negotiation based on Turbo codes provided in one embodiment of this application;

[0059] Figure 6 This is a flowchart of a multi-dimensional negotiation module provided in an embodiment of this application;

[0060] Figure 7 This is a schematic diagram of the structure of a quantum secure communication negotiation device provided in an embodiment of this application;

[0061] Figure 8 This is a schematic diagram of the structure of a quantum secure communication negotiation device provided in another embodiment of this application;

[0062] Figure 9 This is a schematic diagram of the structure of a quantum secure communication negotiation device provided in an embodiment of this application. Detailed Implementation

[0063] The features and exemplary embodiments of various aspects of this application will be described in detail below. To make the objectives, technical solutions, and advantages of this application clearer, the application will be further described in detail below with reference to the accompanying drawings and specific embodiments. It should be understood that the specific embodiments described herein are only intended to explain this application and not to limit it. For those skilled in the art, this application can be implemented without some of these specific details. The following description of the embodiments is merely to provide a better understanding of this application by illustrating examples.

[0064] It should be noted that, in this document, relational terms such as "first" and "second" are used merely to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising..." does not exclude the presence of additional identical elements in the process, method, article, or apparatus that includes said element.

[0065] To facilitate subsequent understanding, the relevant concepts appearing in the embodiments of this application will be introduced first below.

[0066] Quantum secure communication transmits information by storing it in a quantum state, using the quantum state as the carrier. Because quantum states possess the characteristics of being unclonable and uncertain, quantum communication using quantum states ensures the security of the key.

[0067] Quantum key distribution (QKD) is a new branch of research that combines cryptography and quantum mechanics. Based on the different spectral distribution characteristics of the quantum state carrier signal, it is divided into discrete-variable quantum key distribution (DVQKD) and continuous-variable quantum key distribution (CV-QKD, CVQKD). They respectively modulate their information onto the phase or polarization state of a single-photon state signal and the canonical component of the quantized light field. Because of this, DVQKD has limitations such as high difficulty in fabrication, high detection costs, and low information carrying capacity. CVQKD, on the other hand, has the opposite characteristics in terms of fabrication, detection, and information carrying capacity, thus offering greater advantages.

[0068] The final step in the quantum key distribution process always requires post-processing, which includes key negotiation (error correction) and security enhancement. Since the legitimate communicating parties (Alice and Bob) already possess a highly inconsistent original key before key negotiation, the key negotiation process exists to correct inconsistencies in the key sequence, ensuring that both parties obtain a completely identical encryption key. Security enhancement, on the other hand, ensures that eavesdroppers cannot obtain information about the security key from the stolen information.

[0069] Key negotiation is a crucial step in physical layer security and quantum communication. Only through key negotiation can the communicating parties obtain a consistent encryption key, thus ensuring secure communication. During the key negotiation process, its validity and security are two critical factors that must be considered. Besides ensuring the consistency of the negotiated key, it is also essential to ensure that an eavesdropper, Eve, cannot obtain any information related to the key based on the information she overhears, and therefore cannot obtain the key itself.

[0070] In QKD (Quantum Keyless Digitization), the sender first transmits and measures the signal to be sent using a quantum state to obtain the original key. Theoretically, quantum channels are unconditionally secure. However, in practical communication, both parties may obtain incorrect or eavesdropped key information due to quantum channel interference and the influence of eavesdroppers. Therefore, post-processing of the original key is essential.

[0071] Turbo codes, short for parallel concatenated recursive system convolutional codes, are a new type of error-correcting code. They cleverly combine various previous error-correcting coding schemes with iterative decoding, using an interleaver to reduce the correlation between member codes, making them a highly effective class of codes in the field of channel coding.

[0072] In view of the above, in order to solve the problems of the prior art, embodiments of this application provide a quantum secure communication negotiation method, apparatus, device, medium, and program product. It should be noted that the embodiments provided in this application are not intended to limit the scope of this application.

[0073] The quantum secure communication negotiation method provided in the embodiments of this application will be introduced first below.

[0074] Figure 1 A flowchart illustrating a quantum secure communication negotiation method according to an embodiment of this application is shown. This quantum secure communication negotiation method is applied to a first communication end, which can be an electronic device, including a server or user terminal, etc. The first communication end is the Bob end, and the second communication end is the Alice end. Figure 1 As shown, the quantum secure communication negotiation method includes the following steps:

[0075] S110, receiving the target sequence transmitted by the second communication end based on the original sequence through the quantum channel;

[0076] S120, converts the target sequence into a uniformly distributed first Gaussian sequence;

[0077] S130, the first Gaussian sequence is encoded using parallel concatenated recursive system convolutional codes to obtain a verification sequence, and the verification sequence is sent to the second communication terminal so that the second communication terminal can determine the key information corresponding to the original sequence by decoding the second Gaussian sequence corresponding to the original sequence using parallel concatenated recursive system convolutional codes based on the verification sequence and the original sequence.

[0078] S140 determines the key information by decoding the convolutional code of a parallel concatenated recursive system based on the first Gaussian sequence and the check sequence.

[0079] As described above, a quantum secure communication negotiation method according to an embodiment of this application is applied to a first communication terminal. This first communication terminal can receive a target sequence transmitted by a second communication terminal based on an original sequence via a quantum channel, and then convert the target sequence into a uniformly distributed first Gaussian sequence. The first communication terminal encodes the first Gaussian sequence using a parallel concatenated recursive system convolutional code Turbo code to obtain a verification sequence, and sends the verification sequence to the second communication terminal. After receiving the verification sequence, the second communication terminal can determine the key information corresponding to the original sequence using Turbo code based on the verification sequence and the corresponding second Gaussian sequence. The first communication terminal can then determine the key information using Turbo code decoding based on the first Gaussian sequence and the verification sequence. Thus, the quantum secure communication negotiation and decoding error correction between the first and second communication terminals are ultimately achieved accurately and efficiently.

[0080] The quantum secure communication negotiation method provided in this application employs parallel concatenated recursive system convolutional codes for relevant encoding and decoding during the quantum key negotiation and error correction process. This method exhibits good negotiation performance in quantum secure communication negotiation scenarios and can achieve quantum secure communication negotiation and key error correction more securely and efficiently, thereby effectively improving the overall quantum secure communication negotiation efficiency and error correction accuracy.

[0081] The specific implementation methods of steps 110 to 140 above are described in detail below.

[0082] In S110, specifically, the second communication terminal uses a quantum channel to transmit the original sequence as a quantum state, and the first communication terminal receives the corresponding target sequence. The target sequence received by the first communication terminal is not the final key information, so it still needs to go through the following multi-factor negotiation process.

[0083] In S120, specifically in CVQKD, the coherent states prepared by the second communication terminal all exhibit a Gaussian distribution. This also means that the target sequence received by the first communication terminal is essentially a non-uniformly distributed Gaussian variable. After receiving the target sequence, the first communication terminal uses the processing operations in multidimensional negotiation to convert the non-uniformly distributed target sequence into a uniformly distributed first Gaussian sequence.

[0084] In some embodiments of this application, more specifically, to fully ensure the reliability of converting the target sequence to the first Gaussian sequence, the conversion of the target sequence to a uniformly distributed first Gaussian sequence may include:

[0085] Normalize the target sequence;

[0086] The normalized target sequence is spherized to obtain the first Gaussian sequence.

[0087] In this embodiment, taking the target sequence Y as an example, Y is a continuous variable with uneven distribution. During normalization processing, Where ||Y|| is the modulus of the target sequence Y.

[0088] After normalizing the target sequence, a sphericalization process can be performed on the normalized target sequence. Specifically, during the sphericalization process, the first communication terminal can select d points on the sphere to obtain a sequence of the form {b1, b2, ..., b...}. d The binary bit string of}, b d The value can be either 0 or 1, thus obtaining a d-dimensional vector y. This transforms the unevenly distributed key received by the first communication end into a uniformly distributed key, that is, transforms the unevenly distributed target sequence into a uniformly distributed first Gaussian sequence.

[0089] Optionally, according to some embodiments of this application, considering the requirements of the second communication end for the transformation of the original sequence, in order to achieve a more synchronous and efficient uniform distribution of the transformed Gaussian sequence, after performing spheroidization processing on the normalized target sequence to obtain the first Gaussian sequence, the quantum secure communication negotiation method may further include:

[0090] The target rotation matrix is ​​determined based on the normalized target sequence and the first Gaussian sequence.

[0091] The target rotation matrix is ​​transmitted to the second communication terminal so that the second communication terminal can convert the original sequence into a second Gaussian sequence based on the target rotation matrix.

[0092] In this embodiment, after obtaining the target sequence after normalization and the first Gaussian sequence, the rotation matrix from the target sequence after normalization to the first Gaussian sequence is determined and denoted as the target rotation matrix.

[0093] After determining the target rotation matrix, the first communication terminal can send it to the second communication terminal via a classical channel (common channel). Upon receiving the target rotation matrix, the second communication terminal can operate on the original sequence with reference to it, thereby transforming it into a second Gaussian sequence. For example, the second communication terminal normalizes the original sequence and then rotates the normalized original sequence according to the target rotation matrix, thus obtaining a uniformly distributed second Gaussian sequence corresponding to the original sequence.

[0094] In S130, in its specific implementation, parallel concatenated recursive system convolutional Turbo codes are used for negotiation and key error correction. Specifically, by encoding the first Gaussian sequence using Turbo codes, a check sequence can be obtained after encoding.

[0095] After obtaining the aforementioned verification sequence through Turbo coding at the first communication end, this verification sequence can be sent to the second communication end. In this way, the second communication end, based on the second Gaussian sequence corresponding to the verification sequence and the original sequence, determines the key information corresponding to the original sequence through parallel concatenated recursive system convolutional code decoding.

[0096] Optionally, according to some embodiments of this application, in order to more fully guarantee the reliability of the verification sequence received by the second communication end, so as to more efficiently combine this verification sequence to complete quantum communication negotiation and error correction, the above-mentioned sending the verification sequence to the second communication end may include:

[0097] The verification sequence is sent to the second communication terminal through a common channel.

[0098] In S140, specifically, after obtaining a uniformly distributed first Gaussian sequence based on the target sequence and encoding a verification sequence, the first communication end can determine the key information by decoding the first Gaussian sequence and the verification sequence using a parallel concatenated recursive system convolutional code Turbo code.

[0099] According to some embodiments of this application, optionally, and more specifically, the determination of key information based on the first Gaussian sequence and the parity sequence through parallel concatenated recursive system convolutional code decoding may include:

[0100] Based on the first Gaussian sequence and the check sequence, the second Gaussian sequence is obtained;

[0101] The key information is determined by decoding the convolutional code using a parallel concatenated recursive system based on the second Gaussian sequence and the check sequence.

[0102] In this embodiment, the first communication terminal recovers the second Gaussian sequence from the first Gaussian sequence using a verification sequence. Specifically, the second Gaussian sequence can be recovered based on the first Gaussian sequence, the verification sequence, and the original key rate. This original key rate can be flexibly set according to actual quantum negotiation metrics, etc., and this application does not impose strict limitations.

[0103] When using Turbo codes for decoding, an iterative soft-decision decoding algorithm can be employed, combined with a second Gaussian sequence and a check sequence for decoding.

[0104] Based on the same inventive concept, see below. Figure 2 . Figure 2 A flowchart illustrating a quantum secure communication negotiation method according to another embodiment of this application is shown. This quantum secure communication negotiation method is applied to a second communication terminal, which can be an electronic device, including a server or a user terminal, etc.

[0105] like Figure 2 As shown, the quantum secure communication negotiation method includes the following steps:

[0106] S210, the original sequence is transmitted to the first communication terminal through the quantum channel so that the first communication terminal receives the target sequence corresponding to the original sequence;

[0107] S220 transforms the original sequence into a uniformly distributed second Gaussian sequence;

[0108] S230, receive the verification sequence sent by the first communication end. The verification sequence is obtained by the first communication end encoding the first Gaussian sequence using a parallel concatenated recursive system convolutional code. The first Gaussian sequence corresponds to the target sequence.

[0109] S240, based on the second Gaussian sequence and the check sequence, determines the key information corresponding to the original sequence through parallel concatenated recursive system convolutional code decoding.

[0110] This application provides a quantum secure communication negotiation method applied to a second communication terminal. The method transmits an original sequence to a first communication terminal via a quantum channel, enabling the first communication terminal to receive a target sequence corresponding to the original sequence. The second communication terminal converts the original sequence into a uniformly distributed second Gaussian sequence. It also receives a verification sequence sent by the first communication terminal, which is obtained by encoding the first Gaussian sequence using a parallel concatenated recursive system convolutional code. The first Gaussian sequence corresponds to the target sequence. Thus, the second communication terminal can determine the key information corresponding to the original sequence using Turbo code decoding based on the second Gaussian sequence and the received verification sequence.

[0111] The quantum secure communication negotiation method provided in this application employs parallel concatenated recursive system convolutional codes for relevant encoding and decoding during the quantum key negotiation and error correction process. This method exhibits good negotiation performance in quantum secure communication negotiation scenarios and can more securely and efficiently realize quantum secure communication negotiation and key error correction between the first and second communication ends, thereby effectively improving the overall quantum secure communication negotiation efficiency and error correction accuracy.

[0112] The specific implementation methods of steps 210 to 240 above are described in detail below.

[0113] In S210, in a specific implementation, the original sequence is transmitted to the first communication terminal through a quantum channel so that the first communication terminal receives the target sequence corresponding to the original sequence.

[0114] Specifically, the second communication terminal uses a quantum channel to transmit the original sequence in quantum state, and the first communication terminal receives the corresponding target sequence.

[0115] In S220, in a specific implementation, to facilitate the multidimensional negotiation processing operation in subsequent quantum communication, the original sequence is converted into a uniformly distributed second Gaussian sequence.

[0116] Optionally, according to some embodiments of this application, in order to fully ensure the reliability and efficiency of converting the original sequence into a uniformly distributed second Gaussian sequence, the conversion of the original sequence into a uniformly distributed second Gaussian sequence may include:

[0117] Receive the target rotation matrix sent by the first communication terminal. The target rotation matrix is ​​the rotation matrix from the normalized target sequence to the first Gaussian sequence.

[0118] The second Gaussian sequence is determined based on the target rotation matrix and the original sequence.

[0119] In this specific implementation, taking the original sequence X as an example, X is a continuous variable with uneven distribution. During normalization processing, Where ||X|| is the modulus of the original sequence X.

[0120] After normalizing the original sequence, the normalized original sequence can be rotated using the target rotation matrix mentioned above, thereby transforming the unevenly distributed normalized original sequence into a uniformly distributed second Gaussian sequence.

[0121] It should be noted that the target rotation matrix described above can be combined with the description above, and will not be repeated here in this embodiment.

[0122] Optionally, according to some embodiments of this application, before determining the second Gaussian sequence based on the target rotation matrix and the original sequence, the quantum secure communication negotiation method may further include:

[0123] Normalize the original sequence;

[0124] Determining the second Gaussian sequence based on the target rotation matrix and the original sequence can include:

[0125] The second Gaussian sequence is determined based on the target rotation matrix and the original sequence after normalization.

[0126] In S230, specifically, the verification sequence sent by the first communication end is received. The verification sequence is obtained by the first communication end encoding the first Gaussian sequence using a parallel concatenated recursive system convolutional code Turbo code. The first Gaussian sequence corresponds to the target sequence.

[0127] According to some embodiments of this application, optionally, in order to more reasonably realize the acceptance of the above-mentioned verification sequence, receiving the verification sequence sent by the first communication terminal may include:

[0128] The verification sequence sent by the first communication terminal is received through a common channel.

[0129] S240, based on the second Gaussian sequence and the check sequence, determines the key information corresponding to the original sequence through parallel concatenated recursive system convolutional code decoding.

[0130] To facilitate understanding of the quantum secure communication protocol method provided in the above embodiments, a specific scenario embodiment is used to illustrate the method below. In this scenario embodiment, the first communication end is Bob's end, and the second communication end is Alice's end. This application proposes a CVQKD key negotiation scheme based on Turbo codes to address issues such as secure communication distance and negotiation efficiency. The technical solutions used in this application include 1. a Turbo code encoder / decoder, 2. a multi-dimensional negotiation protocol, and 3. the application of Turbo codes. The specific description is as follows:

[0131] 1. Turbo codec:

[0132] The Turbo code encoding process consists of four parts: component code encoder, interleaver, return-to-zero (RZ) processing, and pruning matrix. Each part affects the code's performance. The component code encoder generates the system information and check information needed for the next step of the system's operation. To ensure the excellent characteristics of Turbo codes, recursive systematic convolutional codes are used as component codes. The interleaver rearranges the original information sequence, reducing the correlation between computational data and widening the minimum Hamming distance between output bits, truly achieving free random coding. The RZ processing sets each shift register in the encoding system to its initial all-zero state. The pruning process feeds the final check sequence into the pruner, removing some check bits according to internal rules to reduce information redundancy and improve encoding efficiency. The following section combines... Figure 3 This section explains the principles of Turbo encoding and decoding. Figure 3 This is a schematic diagram of the encoder principle of Turbo code provided in one embodiment of this application.

[0133] Note: Generally, RSC1 and RSC2 have the same structure.

[0134] like Figure 3 As shown: Information sequence d k ={d1, d2, d3, ..., d k The sequence is first sent to the interleaver to obtain a new sequence d′. k ={d′1,d′2,d′3,...,d′ k}, and then with the unprocessed original information d k The data is transmitted together to RSC1 and RSC2 to generate sequence X. 1k and X 2k x 1k and X 2k Simultaneously, it is sent to the pruning matrix, where pruning is performed to form a new verification information Y. k X k With the original sequence X k After multiplexing, a key sequence Y (different from the aforementioned target sequence Y) was generated.

[0135] Note: The interleaver used in encoders and decoders is identical in structure, performance, and function.

[0136] Let Q be the “new message”, which is defined as a part of the likelihood information related to the input bits; where U is the likelihood information related to the input bits; and let P be the “external information”, which is defined as the likelihood information related to the sequence output after the interleaver.

[0137] Please see below. Figure 4 , Figure 4 This is a schematic diagram illustrating the structural principle of a Turbo code decoder according to an embodiment of this application. For example... Figure 4 As shown: In the decoding structure, the component code decoders employ a soft input / output algorithm to exchange soft information between component decoders during iterative decoding. Component decoder 1 decodes RSC1 to obtain information U, and a portion of this information Q is sent to the interleaver. After a series of operations within the interleaver, this portion of Q serves as prior information for decoding RSC2 in component decoder 2, outputting likelihood information related to the interleaved output sequence. This information is then sent as P to the deinterleaver and then to component decoder 1 for further decoding. This process is repeated until both parts of the system information converge to a specific feature. Finally, a hard decision is made on the decoded information to obtain the best likelihood estimate of the information sequence.

[0138] 2. Multi-dimensional negotiation agreement:

[0139] Existing key negotiation schemes exist, but this application utilizes a reverse multidimensional negotiation technique based on error-correcting codes. Multidimensional negotiation is a negotiation protocol for CVQKD, also known as side-information key negotiation, which is implemented through a classical channel. Let the original sequence be X, and the side information be XU, where U is a randomly selected subset of codewords from X, and the received information be Y. The specific idea of ​​multidimensional negotiation is as follows: Alice sends X to Bob using a quantum channel, combines X with U to generate the side information XU, and sends XU back to Bob using a public channel. The receiver uses this information to recover the original information X from the previously received information Y. Since multidimensional negotiation also uses a classical channel, to ensure that eavesdroppers cannot intercept useful information in the public channel, it is necessary to construct side information that follows a uniform distribution.

[0140] 3. Applications of Turbo codes:

[0141] According to the GG02 protocol description in the CVQKD system, the key information received by Bob is not the final key information and cannot be used directly. To obtain the final encryption key, a multi-dimensional negotiation process is required.

[0142] Please see below. Figure 5 , Figure 5 This is a summary process for multi-dimensional negotiation based on Turbo codes provided in one embodiment of this application. Figure 5 Let the dimension of the key used in this negotiation be d. The continuous keys held by Alice and Bob are divided into several groups consisting of d vectors. That is, after grouping the key sequence of length N, N / d key groups consisting of d d-dimensional vectors are obtained. The d-dimensional vectors in these N / d groups are then transformed into an additive white Gaussian noise channel for multidimensional negotiation error correction. The multidimensional negotiation and Turbo code error correction modules are described below.

[0143] With reference to the quantum secure communication negotiation scheme provided in the embodiments of this application, please refer to the following: Figure 6 , Figure 6 This is a flowchart of a multi-dimensional negotiation module provided in an embodiment of this application. Figure 6 In the diagram, X corresponds to the original sequence, Y corresponds to the target sequence, x corresponds to the second Gaussian sequence, and y corresponds to the first Gaussian sequence.

[0144] according to Figure 6 The description assumes that Alice and Bob hold d-dimensional vectors X and Y, respectively, where X ~ (0, ε). 2 ) d Alice has a signal variance of ε 2 Suppose that signals X and Y have the following relationship: X = Y + Z, where Z is a frequency response with variance σ. 2 The noise satisfies Z ~ (0, σ 2 ) d Then we can deduce that Y ~ (0, ε) 2 +σ 2 ) d After normalization and spherization operations in the multidimensional negotiation, each set of continuous variables X and Y will be transformed into input x and output y on an additive white Gaussian noise channel.

[0145] In CVQKD, the coherent states prepared by the transmitter all exhibit a Gaussian distribution, while the keys X and Y obtained by Alice and Bob are non-uniformly distributed Gaussian variables. Using processing operations in multidimensional negotiation, these non-uniformly distributed continuous variables can be transformed into uniformly distributed Gaussian continuous variables.

[0146] Depend on Figure 6 The multidimensional negotiation model shown reveals the following specific steps in multidimensional negotiation:

[0147] (1) Normalization: Normalize the keys X and Y obtained by Alice and Bob respectively:

[0148] Where ||X|| and ||Y|| are their respective moduli;

[0149] (2) Bob selects d points on a certain sphere to obtain a shape like {b1, b2, ..., b...}. d The binary bit string of}, b d The value can be either 0 or 1, thus obtaining a d-dimensional vector y. This transforms the unevenly distributed key on Bob's end into a uniformly distributed key; the same operation needs to be performed on Alice's end to achieve a uniform key transformation. A matrix represents the uniformly distributed sequence after the transformation on Bob's end, and Alice uses this matrix to perform a uniform transformation on key X.

[0150] (3) Rotation Transformation: Bob rotates the key from y′ to y using a rotation matrix denoted as M. He then sends matrix M to Alice via a classical channel. Alice operates on key x with reference to matrix M. If there is an error of magnitude ε between key y and the original key after rotation, then x = y + ε.

[0151] After the above operations, keys X and Y have been transformed into uniformly distributed Gaussian sequences. The next step is to use Turbo codes to correct erroneous bits in the binary keys.

[0152] Turbo code negotiation error correction

[0153] Since reverse negotiation can avoid the 3dB limitation of quantum channels, this application employs reverse negotiation using Turbo codes to negotiate and correct errors in keys x and y.

[0154] ① Coding in negotiation

[0155] In the reverse negotiation method, the Turbo code needs to be constructed at Bob's end. As explained in the aforementioned Turbo code encoding and decoding principles, the selection of component codes and interleaver significantly affects the performance of the Turbo code sequence during its construction. This application chooses a single parity check code to simplify the encoding process. At the end of the encoding, a pruning unit is used to obtain the checked sequence, thus avoiding sequence redundancy. After the Turbo code encoding is complete, its interleaver and component codes are determined. This shared system information serves as the basis for the final key obtained by both communicating parties. Bob can use key Y to find the correlation between the two keys. These correlations can be found in the final check sequence m. Therefore, in the CVQKD negotiation protocol of this application, the check sequence is used as the negotiation information for coordinating key error correction between the two parties. That is, Bob transmits the check sequence m to Alice on a public classical channel. Alice performs key error correction by referring to the check sequence through iterative decoding, while discarding a portion of the keys.

[0156] ② Decoding algorithm in negotiation

[0157] Bob decodes sequence y to recover sequence x using the check sequence m. An iterative soft-decision decoding algorithm is employed to decode the output information sequence. To reduce computational complexity, the operating domain of all devices in the decoding structure is set in the logarithmic domain, and each component decoder is a posterior probability decoder. A brief introduction to the decoding algorithm in the negotiation process follows.

[0158] At Bob's end, the channel information for the relevant sequence x and the channel information for the check sequence m can be calculated based on the key y and the original key rate ε. Then, after interleaving and multiplexing, the channel information of the input information in each component decoder can be obtained. All "external information" is set to 0, and the maximum number of iterations is set.

[0159] The key was previously divided into equal-length blocks. The k-th component decoder was operated on according to the block length. The input information was used to find the channel information and the prior information corresponding to each component code, and to calculate the extrinsic information. The posterior information was calculated based on the channel information, prior information, and extrinsic information, and the result was fed into the next component decoder.

[0160] Based on the decoding process provided in the foregoing embodiments, each component decoder is iteratively decoded. Then, based on the input-output relationship of each decoder, iterative decoding is performed again, and the above operation is repeated until the set maximum number of iterations is reached.

[0161] The posterior information of the decoded output sequence x is compared with "0" to make a decision. Since the key sequences X and Y have been converted into binary sequences, the decoded output obtained from the decision is a string of "0" and "1".

[0162] Following the steps outlined above, Alice and Bob can obtain a usable encryption key by deleting portions of the key. At this point, all steps of the key negotiation process are complete.

[0163] Based on the quantum secure communication negotiation method applied to the first communication terminal provided in the above embodiments, and for the same inventive concept, this application also provides a quantum secure communication negotiation device corresponding to the above quantum secure communication negotiation method. The following describes... Figure 7 A detailed introduction to quantum secure communication negotiation devices is provided.

[0164] Figure 7 A schematic diagram of the structure of a quantum secure communication negotiation device provided in an embodiment of this application is shown, which is applied to the first communication terminal. Figure 7 The quantum secure communication negotiation device 700 shown includes:

[0165] Based on the same inventive concept, in a third aspect, embodiments of this application provide a quantum secure communication negotiation device applied to a first communication terminal, the quantum secure communication negotiation device comprising:

[0166] The first receiving module 710 is used to receive the target sequence transmitted by the second communication end based on the original sequence through the quantum channel;

[0167] The first conversion module 720 is used to convert the target sequence into a uniformly distributed first Gaussian sequence.

[0168] The first sending module 730 is used to encode the first Gaussian sequence using parallel concatenated recursive system convolutional codes to obtain a verification sequence, and send the verification sequence to the second communication terminal so that the second communication terminal can determine the key information corresponding to the original sequence by decoding the second Gaussian sequence corresponding to the verification sequence and the original sequence through parallel concatenated recursive system convolutional codes.

[0169] The first decoding module 740 is used to determine the key information by decoding the convolutional code of a parallel concatenated recursive system based on the first Gaussian sequence and the check sequence.

[0170] As described above, a quantum secure communication negotiation device according to an embodiment of this application is applied to a first communication terminal. This first communication terminal can receive a target sequence transmitted by a second communication terminal based on an original sequence via a quantum channel, and then convert the target sequence into a uniformly distributed first Gaussian sequence. The first communication terminal encodes the first Gaussian sequence using a parallel concatenated recursive system convolutional code Turbo code to obtain a verification sequence, and sends the verification sequence to the second communication terminal. After receiving the verification sequence, the second communication terminal can determine the key information corresponding to the original sequence using Turbo code based on the verification sequence and the corresponding second Gaussian sequence. The first communication terminal can then determine the key information using Turbo code decoding based on the first Gaussian sequence and the verification sequence. Thus, the quantum secure communication negotiation and decoding error correction between the first and second communication terminals are ultimately achieved accurately and efficiently. The quantum secure communication negotiation device provided in this application uses parallel concatenated recursive system convolutional codes for relevant encoding and decoding during the quantum key negotiation and error correction process. It has good negotiation performance in the quantum secure communication negotiation scenario and can realize quantum secure communication negotiation and key error correction more securely and efficiently, thereby effectively improving the overall quantum secure communication negotiation efficiency and error correction accuracy.

[0171] According to some embodiments of this application, optionally, the first conversion module 720, which converts the target sequence into a uniformly distributed first Gaussian sequence, may include:

[0172] The first processing submodule can be used to normalize the target sequence;

[0173] The second processing submodule can be used to perform spherization processing on the normalized target sequence to obtain the first Gaussian sequence.

[0174] According to some embodiments of this application, optionally, after spherizing the normalized target sequence to obtain a first Gaussian sequence, the quantum secure communication negotiation device may further include:

[0175] The second determining module can be used to determine the target rotation matrix based on the normalized target sequence and the first Gaussian sequence.

[0176] The second transmission module can be used to transmit the target rotation matrix to the second communication terminal, so that the second communication terminal can convert the original sequence into a second Gaussian sequence based on the target rotation matrix.

[0177] Optionally, according to some embodiments of this application, the first decoding module 740, which determines the key information based on the first Gaussian sequence and the check sequence through parallel concatenated recursive system convolutional code decoding, may include:

[0178] The first restoration submodule can be used to restore the second Gaussian sequence based on the first Gaussian sequence and the check sequence;

[0179] The first determination submodule can be used to determine key information based on the second Gaussian sequence and the check sequence by decoding convolutional codes in a parallel concatenated recursive system.

[0180] Optionally, according to some embodiments of this application, the first determining submodule, which reconstructs the second Gaussian sequence based on the first Gaussian sequence and the check sequence, may include:

[0181] The second Gaussian sequence is obtained by reconstructing the first Gaussian sequence, the check sequence, and the original key rate.

[0182] Optionally, according to some embodiments of this application, sending the verification sequence to the second communication terminal may include:

[0183] The verification sequence is sent to the second communication terminal through a common channel.

[0184] Based on the quantum secure communication negotiation method applied to the second communication terminal provided in the above embodiments, and for the same inventive concept, this application also provides a quantum secure communication negotiation device corresponding to the above quantum secure communication negotiation method. The following describes... Figure 8 A detailed introduction to quantum secure communication negotiation devices is provided.

[0185] Figure 8 A schematic diagram of a quantum secure communication negotiation device provided in another embodiment of this application is shown, which is applied to a second communication terminal. Figure 8 The quantum secure communication negotiation device 800 shown includes:

[0186] The first transmission module 810 is used to transmit the original sequence to the first communication terminal through a quantum channel, so that the first communication terminal receives the target sequence corresponding to the original sequence.

[0187] The second conversion module 820 is used to convert the original sequence into a uniformly distributed second Gaussian sequence.

[0188] The second receiving module 830 is used to receive the verification sequence sent by the first communication end. The verification sequence is obtained by the first communication end encoding the first Gaussian sequence using a parallel concatenated recursive system convolutional code. The first Gaussian sequence corresponds to the target sequence.

[0189] The first determining module 840 is used to determine the key information corresponding to the original sequence based on the second Gaussian sequence and the check sequence by decoding the convolutional code of a parallel concatenated recursive system.

[0190] This application provides a quantum secure communication negotiation device applied to a second communication terminal. It transmits the original sequence to a first communication terminal via a quantum channel, enabling the first communication terminal to receive a target sequence corresponding to the original sequence. The second communication terminal converts the original sequence into a uniformly distributed second Gaussian sequence. It also receives a verification sequence sent by the first communication terminal, which is obtained by encoding the first Gaussian sequence using parallel concatenated recursive system convolutional codes. The first Gaussian sequence corresponds to the target sequence. Thus, the second communication terminal can determine the key information corresponding to the original sequence based on the second Gaussian sequence and the received verification sequence using Turbo code decoding. This quantum secure communication negotiation device, by employing parallel concatenated recursive system convolutional codes for encoding and decoding during quantum key negotiation and error correction, exhibits excellent negotiation performance in quantum secure communication negotiation scenarios. It can more securely and efficiently achieve quantum secure communication negotiation and key error correction, thereby effectively improving the overall quantum secure communication negotiation efficiency and error correction accuracy.

[0191] According to some embodiments of this application, optionally, the second conversion module 820, which converts the original sequence into a uniformly distributed second Gaussian sequence, may include:

[0192] The first receiving submodule can be used to receive the target rotation matrix sent by the first communication terminal. The target rotation matrix is ​​the rotation matrix from the normalized target sequence to the first Gaussian sequence.

[0193] The second determination submodule can be used to determine the second Gaussian sequence based on the target rotation matrix and the original sequence.

[0194] Optionally, according to some embodiments of this application, before determining the second Gaussian sequence based on the target rotation matrix and the original sequence, the quantum secure communication negotiation device may further include:

[0195] The normalization module can be used to normalize the original sequence;

[0196] The above method of determining the second Gaussian sequence based on the target rotation matrix and the original sequence can include:

[0197] The second Gaussian sequence is determined based on the target rotation matrix and the original sequence after normalization.

[0198] Optionally, according to some embodiments of this application, receiving the verification sequence sent by the first communication terminal may include:

[0199] The verification sequence sent by the first communication terminal is received through a common channel.

[0200] Based on the quantum secure communication negotiation method provided in the above embodiments, and with the same inventive concept, this application also provides a quantum secure communication negotiation device corresponding to the above quantum secure communication negotiation method. The following describes... Figure 9 A detailed introduction to quantum secure communication negotiation equipment is provided.

[0201] Please see below. Figure 9 , Figure 9 This is a schematic diagram of the structure of a quantum secure communication negotiation device provided in an embodiment of this application.

[0202] The quantum secure communication negotiation device may include a processor 901 and a memory 902 storing computer program instructions.

[0203] Specifically, the processor 901 may include a central processing unit (CPU), an application-specific integrated circuit (ASIC), or one or more integrated circuits that can be configured to implement the embodiments of this application.

[0204] Memory 902 may include mass storage for data or instructions. For example, and not limitingly, memory 902 may include a hard disk drive (HDD), floppy disk drive, flash memory, optical disk, magneto-optical disk, magnetic tape, or Universal Serial Bus (USB) drive, or a combination of two or more of these. Where appropriate, memory 902 may include removable or non-removable (or fixed) media. Where appropriate, memory 902 may be internal or external to the integrated gateway disaster recovery device. In a particular embodiment, memory 902 is non-volatile solid-state memory.

[0205] Memory may include read-only memory (ROM), random access memory (RAM), disk storage media devices, optical storage media devices, flash memory devices, and electrical, optical, or other physical / tangible memory storage devices. Therefore, typically, memory includes one or more tangible (non-transitory) computer-readable storage media (e.g., memory devices) encoded with software including computer-executable instructions, and when the software is executed (e.g., by one or more processors), it is operable to perform the operations described with reference to the methods according to one aspect of this disclosure.

[0206] The processor 901 reads and executes computer program instructions stored in the memory 902 to implement any of the quantum secure communication negotiation methods in the above embodiments.

[0207] In one example, the data quantum secure communication negotiation device may further include a communication interface 903 and a bus 910. Wherein, as Figure 9 As shown, the processor 901, memory 902, and communication interface 903 are connected through bus 910 and complete communication with each other.

[0208] The communication interface 903 is mainly used to realize communication between various modules, devices, units and / or equipment in the embodiments of this application.

[0209] Bus 910 includes hardware, software, or both, that couples components of a quantum secure communication negotiation device together. For example, and not limitingly, the bus may include an Accelerated Graphics Port (AGP) or other graphics bus, an Enhanced Industry Standard Architecture (EISA) bus, a Front Side Bus (FSB), HyperTransport (HT) interconnect, an Industry Standard Architecture (ISA) bus, an Infinite Bandwidth Interconnect, a Low Pin Count (LPC) bus, a memory bus, a Microchannel Architecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a Serial Advanced Technology Attachment (SATA) bus, a Video Electronics Standards Association Local (VLB) bus, or other suitable buses, or combinations of two or more of these. Where appropriate, bus 910 may include one or more buses. Although specific buses are described and illustrated in embodiments of this application, any suitable bus or interconnect is contemplated herein.

[0210] The quantum secure communication negotiation device executes the quantum secure communication negotiation method in the embodiments of this application, thereby realizing the quantum secure communication negotiation method described in the embodiments of this application.

[0211] Furthermore, in conjunction with the quantum secure communication negotiation method in the above embodiments, this application embodiment can provide a computer storage medium for implementation. The computer storage medium stores computer program instructions; when these computer program instructions are executed by a processor, they implement any of the quantum secure communication negotiation methods in the above embodiments.

[0212] Based on the quantum secure communication negotiation method in the above embodiments, this application provides a computer program product. When the instructions in the computer program product are executed by the processor of an electronic device, the electronic device performs the quantum secure communication negotiation method provided in any of the above embodiments of this application.

[0213] It should be clarified that this application is not limited to the specific configurations and processes described above and shown in the figures. For the sake of brevity, detailed descriptions of known methods are omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method process of this application is not limited to the specific steps described and shown. Those skilled in the art can make various changes, modifications, and additions, or change the order of steps, after understanding the spirit of this application.

[0214] The functional blocks shown in the above-described structural diagram can be implemented as hardware, software, firmware, or a combination thereof. When implemented in hardware, they can be, for example, electronic circuits, application-specific integrated circuits (ASICs), appropriate firmware, plug-ins, function cards, etc. When implemented in software, the elements of this application are programs or code segments used to perform the required tasks. Programs or code segments can be stored on a machine-readable medium or transmitted over a transmission medium or communication link via data signals carried on a carrier wave. "Machine-readable medium" can include any medium capable of storing or transmitting information. Examples of machine-readable media include electronic circuits, semiconductor memory devices, ROM, flash memory, erasable ROM (EROM), floppy disks, CD-ROMs, optical disks, hard disks, fiber optic media, radio frequency (RF) links, etc. Code segments can be downloaded via computer networks such as the Internet, intranets, etc.

[0215] It should also be noted that the exemplary embodiments mentioned in this application describe methods or systems based on a series of steps or apparatus. However, this application is not limited to the order of the above steps; that is, the steps can be performed in the order mentioned in the embodiments, or in a different order, or several steps can be performed simultaneously.

[0216] The aspects of this disclosure have been described above with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this disclosure. It should be understood that each block in the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing apparatus to produce a machine such that these instructions, executable via the processor of the computer or other programmable data processing apparatus, enable the implementation of the functions / actions specified in one or more blocks of the flowchart illustrations and / or block diagrams. Such a processor can be, but is not limited to, a general-purpose processor, a special-purpose processor, a special application processor, or a field-programmable logic circuit. It is also understood that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can also be implemented by special-purpose hardware performing the specified functions or actions, or can be implemented by a combination of special-purpose hardware and computer instructions.

[0217] The above description is merely a specific implementation of this application. Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, modules, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here. It should be understood that the protection scope of this application is not limited thereto. Any person skilled in the art can easily conceive of various equivalent modifications or substitutions within the technical scope disclosed in this application, and these modifications or substitutions should all be covered within the protection scope of this application.

Claims

1. A quantum secure communication negotiation method, characterized in that, Applied to a first communication terminal, the method includes: The target sequence transmitted by the second communication terminal based on the original sequence is received via a quantum channel; The target sequence is converted into a uniformly distributed first Gaussian sequence; The first Gaussian sequence is encoded using parallel concatenated recursive system convolutional codes to obtain a check sequence. The check sequence is then sent to the second communication terminal so that the second communication terminal can determine the key information corresponding to the original sequence by decoding the check sequence with the second Gaussian sequence corresponding to the original sequence using parallel concatenated recursive system convolutional codes. The key information is determined by parallel concatenated recursive system convolutional code decoding based on the first Gaussian sequence and the check sequence.

2. The method according to claim 1, characterized in that, The step of converting the target sequence into a uniformly distributed first Gaussian sequence includes: The target sequence is normalized. The normalized target sequence is spherized to obtain the first Gaussian sequence.

3. The method according to claim 2, characterized in that, After performing spherization processing on the normalized target sequence to obtain the first Gaussian sequence, the method further includes: Based on the normalized target sequence and the first Gaussian sequence, the target rotation matrix is ​​determined; The target rotation matrix is ​​transmitted to the second communication terminal so that the second communication terminal can convert the original sequence into the second Gaussian sequence based on the target rotation matrix.

4. The method according to claim 1, characterized in that, The step of determining the key information based on the first Gaussian sequence and the check sequence through parallel concatenated recursive system convolutional code decoding includes: Based on the first Gaussian sequence and the check sequence, the second Gaussian sequence is obtained by reconstruction; The key information is determined by parallel concatenated recursive system convolutional code decoding based on the second Gaussian sequence and the verification sequence.

5. The method according to claim 4, characterized in that, The process of reconstructing the second Gaussian sequence based on the first Gaussian sequence and the check sequence includes: The second Gaussian sequence is obtained by restoring the first Gaussian sequence, the verification sequence, and the original key rate.

6. The method according to claim 1, characterized in that, Sending the verification sequence to the second communication terminal includes: The verification sequence is sent to the second communication terminal through a common channel.

7. A quantum secure communication negotiation method, characterized in that, Applied to a second communication terminal, the method includes: The original sequence is transmitted to the first communication terminal through a quantum channel, so that the first communication terminal receives the target sequence corresponding to the original sequence; The original sequence is converted into a uniformly distributed second Gaussian sequence; The system receives a verification sequence sent by the first communication terminal. The verification sequence is obtained by the first communication terminal encoding a first Gaussian sequence using a parallel concatenated recursive system convolutional code. The first Gaussian sequence corresponds to the target sequence. Based on the second Gaussian sequence and the verification sequence, the key information corresponding to the original sequence is determined by parallel concatenated recursive system convolutional code decoding.

8. The method according to claim 7, characterized in that, The step of converting the original sequence into a uniformly distributed second Gaussian sequence includes: Receive the target rotation matrix sent by the first communication terminal, wherein the target rotation matrix is ​​the rotation matrix from the normalized target sequence to the first Gaussian sequence; The second Gaussian sequence is determined based on the target rotation matrix and the original sequence.

9. The method according to claim 8, characterized in that, Before determining the second Gaussian sequence based on the target rotation matrix and the original sequence, the method further includes: The original sequence is normalized. Determining the second Gaussian sequence based on the target rotation matrix and the original sequence includes: The second Gaussian sequence is determined based on the target rotation matrix and the normalized original sequence.

10. The method according to claim 7, characterized in that, The step of receiving the verification sequence sent by the first communication terminal includes: The verification sequence sent by the first communication terminal is received through a public channel.

11. A quantum secure communication protocol device, characterized in that, Applied to a first communication terminal, the device includes: The first receiving module is used to receive the target sequence transmitted by the second communication end based on the original sequence through a quantum channel; The first conversion module is used to convert the target sequence into a uniformly distributed first Gaussian sequence; The first sending module is used to encode the first Gaussian sequence using parallel concatenated recursive system convolutional codes to obtain a verification sequence, and send the verification sequence to the second communication terminal, so that the second communication terminal can determine the key information corresponding to the original sequence by decoding the second Gaussian sequence corresponding to the original sequence using parallel concatenated recursive system convolutional codes based on the verification sequence and the second Gaussian sequence corresponding to the original sequence. The first decoding module is used to determine the key information based on the first Gaussian sequence and the check sequence by using parallel concatenated recursive system convolutional code decoding.

12. A quantum secure communication protocol device, characterized in that, The device, applied to a second communication terminal, includes: The first transmission module is used to transmit the original sequence to the first communication terminal through a quantum channel, so that the first communication terminal receives the target sequence corresponding to the original sequence. The second conversion module is used to convert the original sequence into a uniformly distributed second Gaussian sequence. The second receiving module is used to receive the verification sequence sent by the first communication terminal. The verification sequence is obtained by the first communication terminal encoding the first Gaussian sequence using a parallel concatenated recursive system convolutional code. The first Gaussian sequence corresponds to the target sequence. The first determining module is used to determine the key information corresponding to the original sequence based on the second Gaussian sequence and the verification sequence by using a parallel concatenated recursive system convolutional code decoding.

13. A quantum secure communication negotiation device, characterized in that, The device includes: a processor and a memory storing computer program instructions; When the processor executes the computer program instructions, it implements the quantum secure communication negotiation method as described in any one of claims 1-10.

14. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer program instructions, which, when executed by a processor, implement the quantum secure communication negotiation method as described in any one of claims 1-10.

15. A computer program product, characterized in that, When the instructions in the computer program product are executed by the processor of the electronic device, the electronic device performs the quantum secure communication negotiation method as described in any one of claims 1-10.

Images