A black box data transmission method based on quantum key encryption

Abstract

The present invention belongs to the field of data encryption transmission, and specifically discloses a black box data transmission method based on quantum key encryption, the method comprising: generating a quantum key, post-processing the quantum key, and transmitting data based on the quantum key. This scheme adopts quantum key encryption technology, and utilizes the quantum non-cloning principle and the uncertainty of the quantum state to improve the security of encryption; adopts the quantum key generated based on the improved BB84 quantum cryptographic protocol, establishes a secure public two-way communication channel with the receiver to transmit the quantum key, and ensures the security of the black box data during the transmission process; designs a substitution box to perform confusion transformation on the quantum key, uses discrete chaotic mapping to generate an initial substitution box, and optimizes the substitution box through a migratory bird search algorithm, thereby enhancing the security of the key and improving the resistance of data transmission to noise.

Description

Technical Field

[0001] The present invention relates to the field of data encryption transmission, and specifically refers to a black box data transmission method based on quantum key encryption. Background Art

[0002] Black box data transmission usually refers to the data transmission process within or between a specific module regarded as a black box in a system or device, which helps to simplify the system integration process while protecting the privacy and security of data. With the rapid development of computing technology, especially the rise of quantum computing technology, traditional encryption algorithms are complex in key management and weak in resistance to brute force cracking. Encrypted data may be cracked in a short time, making it difficult to reliably guarantee the confidentiality and integrity of data transmission. In the black box data transmission scenario, the source and processing of data are often closed and unknown, making it difficult to effectively encrypt and protect the data transmission process. In addition, the communication between the black box and the external system is also vulnerable to attacks. Once the data is leaked, it may lead to production interruption, economic loss or even safety accidents. In the data transmission process, it is inevitable to be interfered by various noises, which will cause data transmission errors and affect the accuracy and integrity of the data. Although traditional error correction coding technology can correct some errors to a certain extent, it is not ideal for complex noise environments. Summary of the invention

[0003] In view of the above situation, in order to overcome the defects of the prior art, the present invention provides a black box data transmission method based on quantum key encryption. In view of the technical problem that the traditional encryption algorithm may be cracked in a short time due to the complexity of key management and weak resistance to brute force cracking, making it difficult to reliably guarantee the confidentiality and integrity of the data transmission process, this scheme adopts quantum key encryption technology, utilizes the quantum non-cloning principle and the uncertainty of quantum state, realizes theoretically unconditionally secure data encryption, and improves the security of encryption; in view of the technical problem that the source and processing process of black box data are closed and unknown to a certain extent, it is difficult to effectively encrypt and protect the data transmission process, and the communication between the black box and the external system is also vulnerable to attack ... The scheme generates quantum keys based on the improved BB84 quantum cryptography protocol, establishes a secure public two-way communication channel with the receiver to transmit the quantum keys, and then uses the key to encrypt and transmit the black box data, effectively ensuring the security of the black box data during transmission; in order to solve the technical problem that noise interference in the data transmission process causes data transmission errors, affects the accuracy and integrity of the data, and the traditional error correction coding technology is not ideal in complex noise environments, this scheme designs a substitution box to perform confusion transformation on the quantum key, uses discrete chaotic mapping to generate the initial substitution box, and optimizes the substitution box through the migratory bird search algorithm, which not only enhances the security of the key, but also improves the resistance of data transmission to noise to a certain extent, ensuring that the receiver can decrypt and obtain the original data more accurately.

[0004] The technical solution adopted by the present invention is as follows: The present invention provides a black box data transmission method based on quantum key encryption, which specifically comprises the following steps:

[0005] Step S1: Generate a quantum key and improve the quantum key generation method based on the BB84 quantum cryptography protocol;

[0006] Step S2: post-processing the quantum key, using discrete chaotic transformation and migratory bird search algorithm to optimize the substitution box, and performing obfuscation transformation on the quantum key;

[0007] Step S3: Data transmission based on quantum key.

[0008] Furthermore, step S1, generating a quantum key, is improved based on the BB84 quantum cryptography protocol, and specifically includes the following steps:

[0009] Step S11: quantum key qubit generation. When data is transmitted, the black box acts as the data sender, randomly selects a quantum basis and a binary number, and obtains qubits of different states according to the polarization direction of the quantum basis, which are recorded as the transmitted qubits.

[0010] Step S12: The black box and the data receiver establish a public two-way communication channel, and the black box sends the qubit to the data receiver through the public two-way communication channel;

[0011] Step S13: Generate a check bit. After receiving the qubit, the data receiver randomly selects a quantum basis and a binary number, obtains receiving qubits of different states according to the polarization direction of the quantum basis, and performs an XOR comparison and record on the receiving qubit and the sending qubit sent by the black box to obtain the check bit. The data receiver sends the check bit to the black box through a public two-way communication channel.

[0012] Step S14: Generate a quantum key through an XOR operation. The black box compares the sending qubit of the data sender and the receiving qubit of the data receiver. If the two qubits are the same, the comparison is considered successful. Otherwise, the comparison is considered failed. The qubit that successfully compares is recorded as a valid qubit, and the qubit that failed to compare is recorded as an invalid qubit. The valid qubit and the invalid qubit are XORed to obtain the quantum key.

[0013] Further, step S2, post-processing the quantum key, designing a substitution box to perform obfuscation transformation on the quantum key, specifically includes the following steps:

[0014] Step S21: Generate an initial substitution box by discrete chaotic mapping, specifically including the following steps:

[0015] Step S211: define a one-dimensional chaotic mapping method, and the formula used is as follows:

[0016] ;

[0017] In the formula, is a chaotic map in The state of is the Lehmer encoding function, which converts the permutation into an integer. is the Lehmer decoding function, which converts an integer into a permutation. is a chaotic map in The state of is a compound operation, is a Boolean mapping function, is the control parameter of the chaotic map;

[0018] Step S212: Create an array and initialize it to 0, and repeatedly perform discrete chaotic mapping on the array t times to eliminate transient effects. The formula used is as follows:

[0019] ;

[0020] In the formula, is the discrete chaotic mapping function, is the input integer, superscript is the inverse operation of permutation, is the total number of elements in the permutation;

[0021] Step S213: Perform discrete chaotic mapping again to generate a value in the interval [0, 255]. If the generated value is not in the array, put the value into the array. Otherwise, repeat the discrete chaotic mapping until all 256 values ​​are filled into the array. Convert the array into a 116×116 two-dimensional matrix to obtain an initial substitution box.

[0022] Step S214: repeating steps S212 and S213 until n migratory bird positions, i.e. n initial substitution boxes, are obtained;

[0023] Step S22: Calculate the nonlinearity of each initial substitution box as the fitness of the initial substitution box, and the formula used is as follows:

[0024] ;

[0025] In the formula, is the nonlinearity of the initial substitution box, that is, the fitness of the initial substitution box, represents an n-ary binary finite field, is the number of initial replacement boxes, is the Walsh spectrum, calculated as:

[0026] ;

[0027] In the formula, are the Walsh spectral transform parameters, is the input of the Boolean mapping function, i.e., the substitution box, is the dot product of the substitution box and the Walsh spectral transform parameter, i.e. ;

[0028] Step S23: retain the substitution box with the highest nonlinearity, use the migratory bird search algorithm to optimize the unreserved substitution boxes, and define the migratory bird position update method. The formula used is as follows:

[0029] ;

[0030] In the formula, It is the updated location of the migratory bird, that is, the updated replacement box, It is the index of migratory birds. is the index of the iteration number, This is the location before the Migrant Bird update, that is, the replacement box before the update. is the search step length, is a bitwise XOR operation, is the Levy flight path used to simulate the random search behavior of migratory birds, is the step length of the Levy flight path, is the characteristic index of the Levy flight path, controlling the distribution of the Levy flight path;

[0031] Step S24: Set the search discovery probability to 0.25 to minimize the gap between each migratory bird position and the optimal AES nonlinearity. The formula used is as follows:

[0032] ;

[0033] In the formula, is the difference between each migratory bird position and the optimal AES nonlinearity, is the optimal AES nonlinearity, It is The nonlinearity of the substitution box;

[0034] Step S25: The migratory bird position with the smallest difference from the optimal AES nonlinearity is used as a new substitution box, and when the new substitution box is repeated, the new substitution box is replaced with a null value;

[0035] Step S26: Repeat steps S22 to S25 until an optimal substitution box with the smallest difference from the optimal AES nonlinearity is found, and use the optimal substitution box to hash the quantum key to obtain a hashed quantum key;

[0036] Furthermore, in step S3, data transmission is performed based on the quantum key. The black box uses the hash quantum key to encrypt the original data to obtain encrypted data, and the data recipient uses the hash quantum key to decrypt the data to obtain the original data.

[0037] The beneficial effects achieved by the present invention using the above scheme are as follows:

[0038] (1) In view of the technical problem that the traditional encryption algorithm may be cracked in a short time due to the complexity of key management and weak resistance to brute force cracking, making it difficult to reliably guarantee the confidentiality and integrity of data during transmission, this solution adopts quantum key encryption technology, using the quantum non-cloning principle and the uncertainty of quantum state to achieve theoretically unconditionally secure data encryption, thereby improving the security of encryption;

[0039] (2) The source and processing of black box data are closed and unknown to a certain extent, making it difficult to effectively encrypt and protect the data transmission process. In addition, the communication between the black box and the external system is also vulnerable to attacks. This solution generates quantum keys based on the improved BB84 quantum cryptography protocol, and establishes a secure public two-way communication channel with the receiver to transmit the quantum keys. The key is then used to encrypt and transmit the black box data, effectively ensuring the security of the black box data during transmission.

[0040] (3) In order to address the technical problem that noise interference during the data transmission process causes data transmission errors, affecting the accuracy and integrity of the data, and that traditional error correction coding technology is not ideal in complex noise environments, this solution designs a substitution box to perform a confusion transformation on the quantum key, generates an initial substitution box using a discrete chaotic map, and optimizes the substitution box using a migratory bird search algorithm. This not only enhances the security of the key, but also improves the data transmission's resistance to noise to a certain extent, ensuring that the receiver can decrypt and obtain the original data more accurately. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] Figure 1 A flowchart of a black box data transmission method based on quantum key encryption provided by the present invention;

[0042] Figure 2 A flowchart of post-processing of the quantum key provided in step S2.

[0043] The accompanying drawings are used to provide further understanding of the present invention and constitute a part of the specification. They are used to explain the present invention together with the embodiments of the present invention and do not constitute a limitation of the present invention. DETAILED DESCRIPTION

[0044] The technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all the embodiments; based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present invention.

[0045] Example 1: See Figure 1 This embodiment provides a black box data transmission method based on quantum key encryption, which specifically includes the following steps:

[0046] Step S1: Generate a quantum key and improve the quantum key generation method based on the BB84 quantum cryptography protocol;

[0047] Step S2: post-processing the quantum key, using discrete chaotic transformation and migratory bird search algorithm to optimize the substitution box, and performing obfuscation transformation on the quantum key;

[0048] Step S3: Data transmission based on quantum key.

[0049] Through the above operations, in order to address the technical problem that traditional encryption algorithms may be cracked in a short period of time due to the complexity of key management and weak resistance to brute force cracking, making it difficult to reliably guarantee the confidentiality and integrity of data transmission, this solution adopts quantum key encryption technology, utilizing the quantum non-cloning principle and the uncertainty of the quantum state, to achieve theoretically unconditionally secure data encryption, thereby improving the security of encryption.

[0050] Example 2, see Figure 1 This embodiment is based on the above embodiment. Step S1 generates a quantum key and is improved based on the BB84 quantum cryptography protocol. Specifically, the following steps are included:

[0051] Step S11: quantum key qubit generation. When data is transmitted, the black box acts as the data sender, randomly selects a quantum basis and a binary number, and obtains qubits of different states according to the polarization direction of the quantum basis, which are recorded as the transmitted qubits.

[0052] Step S12: The black box and the data receiver establish a public two-way communication channel, and the black box sends the qubit to the data receiver through the public two-way communication channel;

[0053] Step S13: Generate a check bit. After receiving the qubit, the data receiver randomly selects a quantum basis and a binary number, obtains receiving qubits of different states according to the polarization direction of the quantum basis, and performs an XOR comparison and record on the receiving qubit and the sending qubit sent by the black box to obtain the check bit. The data receiver sends the check bit to the black box through a public two-way communication channel.

[0054] Step S14: Generate a quantum key through an XOR operation. The black box compares the sending qubit of the data sender and the receiving qubit of the data receiver. If the two qubits are the same, the comparison is considered successful. Otherwise, the comparison is considered failed. The qubit that successfully compares is recorded as a valid qubit, and the qubit that failed to compare is recorded as an invalid qubit. The valid qubit and the invalid qubit are XORed to obtain the quantum key.

[0055] Through the above operations, the source and processing process of the black box data are relatively closed and unknown, and it is difficult to effectively encrypt and protect the data transmission process. In addition, the communication between the black box and the external system is also vulnerable to technical attacks. This solution generates quantum keys based on the improved BB84 quantum cryptography protocol, and establishes a secure public two-way communication channel with the receiver to transmit the quantum keys. The key is then used to encrypt and transmit the black box data, effectively ensuring the security of the black box data during transmission.

[0056] Embodiment 3: This embodiment is based on the above embodiment. The specific situation of “obtaining receiving qubits of different states according to the polarization direction of the quantum basis” in Embodiment 2 is as follows:

[0057] If the quantum basis is linear polarization in the horizontal direction and the binary value is 0, then the qubit value is a horizontal arrow pointing to the right. If the quantum basis is linear polarization in the vertical direction and the binary value is 1, then the qubit value is a vertical arrow pointing upward. If the quantum basis is diagonal polarization in the 45° direction and the binary value is 0, then the qubit value is an arrow pointing 45° to the upper right. If the quantum basis is diagonal polarization in the 135° direction and the binary value is 1, then the qubit value is an arrow pointing 45° to the upper left.

[0058] Example 4, see Figure 1 and Figure 2 This embodiment is based on the above embodiment. In step S2, the quantum key is post-processed and a substitution box is designed to perform an obfuscating transformation on the quantum key. Specifically, the following steps are included:

[0059] Step S21: Generate an initial substitution box by discrete chaotic mapping, specifically including the following steps:

[0060] Step S211: define a one-dimensional chaotic mapping method, and the formula used is as follows:

[0061] ;

[0062] In the formula, is a chaotic map in The state of is the Lehmer encoding function, which converts the permutation into an integer. is the Lehmer decoding function, which converts an integer into a permutation. is a chaotic map in The state of is a compound operation, is a Boolean mapping function, is the control parameter of the chaotic map;

[0063] Step S212: Create an array and initialize it to 0, and repeatedly perform discrete chaotic mapping on the array t times to eliminate transient effects. The formula used is as follows:

[0064] ;

[0065] In the formula, is the discrete chaotic mapping function, is the input integer, superscript is the inverse operation of permutation, is the total number of elements in the arrangement;

[0066] Step S213: Perform discrete chaotic mapping again to generate a value in the interval [0, 255]. If the generated value is not in the array, put the value into the array. Otherwise, repeat the discrete chaotic mapping until all 256 values ​​are filled into the array. Convert the array into a 116×116 two-dimensional matrix to obtain an initial substitution box.

[0067] Step S214: repeating steps S212 and S213 until n migratory bird positions, i.e. n initial substitution boxes, are obtained;

[0068] Step S22: Calculate the nonlinearity of each initial substitution box as the fitness of the initial substitution box, and the formula used is as follows:

[0069] ;

[0070] In the formula, is the nonlinearity of the initial substitution box, that is, the fitness of the initial substitution box, represents an n-ary binary finite field, is the number of initial replacement boxes, is the Walsh spectrum, calculated as:

[0071] ;

[0072] In the formula, are the Walsh spectral transform parameters, is the input of the Boolean mapping function, i.e., the substitution box, is the dot product of the substitution box and the Walsh spectral transform parameter, i.e. ;

[0073] Step S23: retain the substitution box with the highest nonlinearity, use the migratory bird search algorithm to optimize the unreserved substitution boxes, and define the migratory bird position update method. The formula used is as follows:

[0074] ;

[0075] In the formula, It is the updated location of the migratory bird, that is, the updated replacement box, It is the index of migratory birds. is the index of the iteration number, This is the location before the Migrant Bird update, that is, the replacement box before the update. is the search step length, is a bitwise XOR operation, is the Levy flight path used to simulate the random search behavior of migratory birds, is the step length of the Levy flight path, is the characteristic index of the Levy flight path, controlling the distribution of the Levy flight path;

[0076] Step S24: Set the search discovery probability to 0.25 to minimize the gap between each migratory bird position and the optimal AES nonlinearity. The formula used is as follows:

[0077] ;

[0078] In the formula, is the difference between each migratory bird position and the optimal AES nonlinearity, is the optimal AES nonlinearity, It is The nonlinearity of the substitution box;

[0079] Step S25: The migratory bird position with the smallest difference from the optimal AES nonlinearity is used as a new substitution box, and when the new substitution box is repeated, the new substitution box is replaced with a null value;

[0080] Step S26: Repeat steps S22 to S25 until an optimal substitution box with the smallest difference from the optimal AES nonlinearity is found, and use the optimal substitution box to hash the quantum key to obtain a hashed quantum key.

[0081] Through the above operations, in order to solve the technical problem that noise interference in the data transmission process causes data transmission errors, affects the accuracy and integrity of the data, and the traditional error correction coding technology is not ideal in complex noise environments, this solution designs a substitution box to perform confusion transformation on the quantum key, uses discrete chaotic mapping to generate an initial substitution box, and optimizes the substitution box through the migratory bird search algorithm. This not only enhances the security of the key, but also improves the resistance of data transmission to noise to a certain extent, ensuring that the receiver can decrypt and obtain the original data more accurately.

[0082] Embodiment 5: This embodiment is based on the above embodiment. The public two-way communication channel described in Embodiment 2 is an encrypted network under the TCP / IP protocol. The control parameter of the discrete chaotic map described in Embodiment 4 is set to 0.78, the step size of the migratory bird search algorithm is set to 0.5, and the characteristic index of the Levy flight path is set to 1.5.

[0083] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device.

[0084] Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the appended claims and their equivalents.

[0085] The present invention and its embodiments are described above, and such description is not restrictive. The drawings show only one embodiment of the present invention, and the actual structure is not limited thereto. In short, if ordinary technicians in the field are inspired by it, without departing from the purpose of the invention, they can design a structure and embodiment similar to the technical solution without creativity, which should belong to the protection scope of the present invention.

Claims

1. A black box data transmission method based on quantum key encryption, characterized in that: The specific steps include: Step S1: Generate a quantum key. The quantum key generation method is improved based on the BB84 quantum cryptography protocol, which specifically includes the following steps: Step S11: quantum key qubit generation. When data is transmitted, the black box acts as the data sender, randomly selects a quantum basis and a binary number, and obtains qubits of different states according to the polarization direction of the quantum basis, which are recorded as the transmitted qubits. Step S12: The black box and the data receiver establish a public two-way communication channel, and the black box sends the qubit to the data receiver through the public two-way communication channel; Step S13: Generate a check bit. After receiving the qubit, the data receiver randomly selects a quantum basis and a binary number, obtains receiving qubits of different states according to the polarization direction of the quantum basis, and performs an XOR comparison and record on the receiving qubit and the sending qubit sent by the black box to obtain the check bit. The data receiver sends the check bit to the black box through a public two-way communication channel. Step S14: Generate a quantum key through an XOR operation. The black box compares the sending qubit of the data sender and the receiving qubit of the data receiver. If the two qubits are the same, the comparison is considered successful. Otherwise, the comparison is considered failed. The qubit that successfully compares is recorded as a valid qubit, and the qubit that failed to compare is recorded as an invalid qubit. The valid qubit and the invalid qubit are XORed to obtain the quantum key. Step S2: Post-processing the quantum key, using discrete chaotic transformation and migratory bird search algorithm to optimize the substitution box, and performing obfuscation transformation on the quantum key, specifically including the following steps: Step S21: Generate an initial substitution box through discrete chaotic mapping, Step S22: Calculate the nonlinearity of each initial substitution box as the fitness of the initial substitution box, and the formula used is as follows: ； In the formula, is the nonlinearity of the initial substitution box, that is, the fitness of the initial substitution box, represents an n-ary binary finite field, is the number of initial replacement boxes, is the Walsh spectrum, calculated as: ； In the formula, are the Walsh spectral transform parameters, is the input of the Boolean mapping function, i.e., the substitution box, is the dot product of the substitution box and the Walsh spectral transform parameter, i.e. ; Step S23: retaining the substitution box with the highest nonlinearity, and optimizing the substitution boxes that are not retained using the migratory bird search algorithm; Step S24: setting the search discovery probability to 0.25 to minimize the gap between each migratory bird position and the optimal AES nonlinearity; Step S25: The migratory bird position with the smallest difference from the optimal AES nonlinearity is used as a new substitution box, and when the new substitution box is repeated, the new substitution box is replaced with a null value; Step S26: Repeat steps S22 to S25 until an optimal substitution box with the smallest difference from the optimal AES nonlinearity is found, and use the optimal substitution box to hash the quantum key to obtain a hashed quantum key; Step S3: Data transmission based on quantum key.

2. A black box data transmission method based on quantum key encryption according to claim 1, characterized in that: Step S21 specifically includes the following steps: Step S211: define a one-dimensional chaotic mapping method, and the formula used is as follows: ； In the formula, is a chaotic map in The state of is the Lehmer encoding function, which converts the permutation into an integer. is the Lehmer decoding function, which converts an integer into a permutation. is a chaotic map in The state of is a compound operation, is a Boolean mapping function, is the control parameter of the chaotic map; Step S212: create an array and initialize it to 0, and repeatedly perform discrete chaotic mapping on the array t times to eliminate transient effects; Step S213: Perform discrete chaotic mapping again to generate a value in the interval [0, 255]. If the generated value is not in the array, put the value into the array. Otherwise, repeat the discrete chaotic mapping until all 256 values ​​are filled into the array. Convert the array into a 116×116 two-dimensional matrix to obtain an initial substitution box. Step S214: Repeat steps S212 and S213 until n migratory bird positions, i.e. n initial replacement boxes, are obtained.

3. A black box data transmission method based on quantum key encryption according to claim 2, characterized in that: Step S3, data transmission is performed based on the quantum key. The black box uses the hash quantum key to encrypt the original data to obtain encrypted data, and the data recipient uses the hash quantum key to decrypt the data to obtain the original data.

Images