Data quantum transmission methods and devices, electronic devices and storage media

By processing data using quantum coding and multi-layer encryption, the security issues of key encryption algorithms under the improvement of computing power are solved, and the anti-tampering and anti-decryption effects are achieved in the data transmission process.

CN119995866BActive Publication Date: 2025-10-28SHENZHEN UNIV
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202510163717.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2025-02-14
Publication Date
2025-10-28
Estimated Expiration
2045-02-14

AI Technical Summary

Technical Problem

Existing key encryption algorithms are at risk of being deciphered and tampered with during data transmission when faced with increased computing power, leading to a decrease in data security.

Method used

Quantum coding technology is used to encode the initial transmitted data to form a digital signature, and combined with symmetric and asymmetric encryption methods to ensure the security of the data during transmission.

Benefits of technology

By employing quantum coding and multi-layered encryption, data can be prevented from being tampered with or deciphered during transmission, thus improving the security of data transmission.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119995866B_ABST
    Figure CN119995866B_ABST
Patent Text Reader

Abstract

This application provides a data quantum transmission method, apparatus, electronic device, and storage medium, belonging to the field of data transmission technology. The method includes: acquiring initial transmission data; quantum encoding the initial transmission data according to a preset quantum-encoded random number to obtain quantum transmission data; encrypting the initial transmission data, quantum transmission data, and quantum-encoded random number to obtain target transmission data; and transmitting data to a preset data receiving end according to the target transmission data. This application embodiment can improve data security during transmission.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This application relates to the field of data transmission technology, and in particular to a data quantum transmission method and apparatus, electronic device and storage medium. Background Technology

[0002] Data transmission refers to the transfer of data from one data node to another. To ensure security during transmission, data is usually encrypted to prevent theft or tampering. Currently, traditional key encryption algorithms are widely used for data encryption. However, with the improvement of computing power, data encrypted by key encryption algorithms faces the risk of being deciphered, making it possible for the data to be stolen and tampered with during transmission, thus reducing data security during data transmission. Therefore, how to improve data security during transmission has become an urgent problem to be solved. Summary of the Invention

[0003] The main objective of this application is to propose a data quantum transmission method and apparatus, electronic device and storage medium, which aims to improve the security of data during transmission.

[0004] To achieve the above objectives, a first aspect of this application proposes a data quantum transmission method, the method comprising:

[0005] Obtain initial transmission data;

[0006] The initial transmitted data is quantum encoded according to a preset quantum encoding random number to obtain quantum transmitted data;

[0007] The initial transmission data, the quantum transmission data, and the quantum-encoded random number are encrypted to obtain the target transmission data.

[0008] Data is transmitted to a preset data receiving end according to the target transmission data.

[0009] In some embodiments, the step of quantum encoding the initial transmitted data according to a preset quantum-encoded random number to obtain quantum transmitted data includes:

[0010] The initial transmitted data is binary encoded to obtain an initial binary data string;

[0011] The initial encoding base is obtained by mapping the initial binary data string to the quantum-encoded random number;

[0012] The initial binary data string is quantum encoded according to the initial encoding basis to obtain the quantum transmission data.

[0013] In some embodiments, the step of mapping the initial binary data string to a coding basis based on the quantum-coded random number to obtain an initial coding basis includes:

[0014] Obtain the number of bits in the initial binary data string to get the encoding base number;

[0015] Based on the number of encoding base bits, an encoding base is created to obtain candidate encoding bases;

[0016] The candidate encoding base is obtained by mapping the data based on the initial binary data string and the quantum encoded random number.

[0017] In some embodiments, the step of quantum encoding the initial binary data string according to the initial encoding basis to obtain the quantum transmission data includes:

[0018] The position information of the bits of the initial encoding base is filtered according to the value of the bits of the initial encoding base and the preset calculation base value to obtain the bit position data of the calculation base.

[0019] The position information of the bits of the initial encoding base is filtered based on the calculated base bit position data to obtain the Hadamard base bit position data;

[0020] The initial binary data string is quantum encoded based on the calculated base bit position data and the Hadamard base bit position data to obtain the quantum transmission data.

[0021] In some embodiments, the step of quantum encoding the initial binary data string based on the calculated base bit position data and the Hadamard base bit position data to obtain the quantum transmission data includes:

[0022] The initial binary data string is encoded using computational basis bit position data to obtain at least one computational basis quantum code and bit position data of the computational basis quantum code;

[0023] The initial binary data string is encoded using the Hadamard bit position data to obtain at least one Hadamard quantum code and the bit position data of the Hadamard quantum code.

[0024] The quantum transmission data is obtained by performing tensor calculations based on the computational basis quantum encoding, the bit position data of the computational basis quantum encoding, the Hadamard quantum encoding, and the bit position data of the Hadamard quantum encoding.

[0025] In some embodiments, encrypting the initial transmission data, the quantum transmission data, and the quantum-encoded random number to obtain the target transmission data includes:

[0026] The initial transmitted data is symmetrically encrypted to obtain symmetric transmitted data;

[0027] The target transmission data is obtained by performing asymmetric encryption on the quantum transmission data, the quantum-encoded random number, and the symmetric transmission data.

[0028] In some embodiments, the step of performing asymmetric encryption on the quantum transmission data, the quantum-coded random number, and the symmetric transmission data to obtain the target transmission data includes:

[0029] The quantum transmission data, the quantum-encoded random number, and the symmetric transmission data are encapsulated to obtain encapsulated transmission data.

[0030] The encapsulated transmission data is encrypted using a preset public key to obtain the target transmission data.

[0031] To achieve the above objectives, a second aspect of this application provides a data quantum transmission device, the device comprising:

[0032] The data acquisition module is used to acquire the initial transmission data;

[0033] A quantum encoding module is used to quantum encode the initial transmission data according to a preset quantum encoding random number to obtain quantum transmission data;

[0034] The data encryption module is used to encrypt the initial transmission data, the quantum transmission data, and the quantum-encoded random number to obtain the target transmission data;

[0035] The data transmission module is used to transmit data to a preset data receiving end according to the target transmission data.

[0036] To achieve the above objectives, a third aspect of this application provides an electronic device, which includes a memory and a processor. The memory stores a computer program, and the processor executes the computer program to implement the method described in the first aspect.

[0037] To achieve the above objectives, a fourth aspect of the present application provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the method described in the first aspect.

[0038] This application proposes a data quantum transmission method, apparatus, electronic device, and storage medium. First, it acquires initial transmission data. Then, it quantum-encodes the initial transmission data according to a preset quantum-encoded random number to obtain quantum transmission data, thus forming a digital signature on the initial transmission data based on quantum encoding. This prevents data tampering during transmission and improves data security. Further, it encrypts the initial transmission data, quantum transmission data, and quantum-encoded random number to obtain target transmission data, preventing data decryption during transmission. Finally, it transmits the target transmission data to a preset data receiving end, achieving secure data transmission that prevents both decryption and tampering. Attached Figure Description

[0039] Figure 1 This is a flowchart of the data quantum transmission method provided in the embodiments of this application;

[0040] Figure 2 yes Figure 1 The flowchart of step S102 in the document;

[0041] Figure 3 yes Figure 2 The flowchart of step S202 in the document;

[0042] Figure 4 yes Figure 2 The flowchart of step S203 in the process;

[0043] Figure 5 yes Figure 4 The flowchart of step S403 in the process;

[0044] Figure 6 yes Figure 1 The flowchart of step S103 in the process;

[0045] Figure 7 yes Figure 6 The flowchart of step S602 in the document;

[0046] Figure 8 This is a schematic diagram of the data quantum transmission device provided in the embodiments of this application;

[0047] Figure 9 This is a schematic diagram of the hardware structure of the electronic device provided in the embodiments of this application. Detailed Implementation

[0048] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.

[0049] It should be noted that although functional modules are divided in the device schematic diagram and a logical order is shown in the flowchart, in some cases, the steps shown or described may be performed in a different order than the module division in the device or the order in the flowchart. The terms "first," "second," etc., in the specification, claims, and the aforementioned drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence.

[0050] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein is for the purpose of describing embodiments of this application only and is not intended to limit this application.

[0051] First, let's analyze some of the terms used in this application:

[0052] Reed-Muller codes are linear error correction codes widely used for error detection and correction in communication and storage systems. Developed by David E. Muller and Irving S. Reed in the 1950s, this coding technique belongs to the polynomial coding family. Reed-Muller codes primarily construct the coding matrix using generator polynomials, exhibiting excellent minimum distance characteristics and effectively handling multiple random errors. Applications include wireless communication, satellite communication, data storage, and digital broadcasting. In the field of artificial intelligence, Reed-Muller codes can be used to protect data integrity during machine learning data transmission, especially reducing error rates when transmitting large amounts of data. By using advanced encoding and decoding algorithms, Reed-Muller codes not only improve the reliability of data transmission but also enhance the data processing capabilities of information systems, providing more stable data support for artificial intelligence systems.

[0053] Hadamard Matrix: A Hadamard matrix is ​​a square matrix consisting of +1 and -1, where any two rows or columns are orthogonal. This matrix has important applications in mathematics and engineering, particularly in information theory, signal processing, image processing, and data compression. The properties of Hadamard matrices make them especially useful in constructing error correction codes and performing fast data transformations. In artificial intelligence, Hadamard matrices can be used to optimize the weight initialization of neural networks, improving the efficiency and stability of learning algorithms. Furthermore, the Hadamard transform, a mathematical transformation based on Hadamard matrices, is widely used in digital signal processing, such as image analysis and compression, and in implementing quantum logic gates in quantum computing. Hadamard matrices not only improve the efficiency of signal and image processing but also expand the application capabilities of artificial intelligence systems in complex data analysis and processing.

[0054] Computational Basis: A computational basis is a set of ground states used in quantum computing, typically consisting of all possible binary sequences of states, such as |0> and |1>, or their Cartesian products like |00>, |01>, |10>, and |11>. These ground states represent the standard states of qubits and are used to describe the complete state space of a quantum system. In quantum computer science, computational basis is fundamental for performing quantum algorithms and quantum logic operations because it allows quantum computers to efficiently represent and manipulate information. The concept of computational basis is central to understanding quantum computing, quantum coding, and quantum error correction. These techniques belong to advanced research in the field of artificial intelligence, aiming to use the principles of quantum mechanics to simulate, extend, and expand computational power, enabling quantum computers to handle problems that are extremely complex for conventional computers. By developing quantum algorithms based on computational basis, researchers are able to explore new computational paradigms, thereby advancing the development of artificial intelligence technologies.

[0055] Tensor Product: The tensor product is a mathematical operation used to create a new, higher-dimensional vector space between multiple vector spaces. In linear algebra and multidimensional data processing, the tensor product allows data of different dimensions to be combined to form new structures with composite features. In physics and engineering, the tensor product is a key tool for describing the state of complex systems, especially in quantum mechanics and relativity. In artificial intelligence, the tensor product is often used to represent and process multidimensional arrays of data, such as image, sound, and video data in multi-layer neural networks. Furthermore, the tensor product is used in machine learning models to construct and optimize parameter spaces, particularly in deep learning algorithms when dealing with complex models, providing a powerful way to represent nonlinear relationships in learning algorithms. In this way, the tensor product extends the processing power of artificial intelligence systems, enabling them to simulate and analyze the various complex functions of human intelligence at higher dimensions.

[0056] Data transmission refers to the transfer of data from one data node to another. To ensure security during transmission, data is usually encrypted to prevent theft or tampering. Currently, traditional key encryption algorithms are widely used for data encryption. However, with the improvement of computing power, data encrypted by key encryption algorithms faces the risk of being deciphered, making it possible for the data to be stolen and tampered with during transmission, thus reducing data security during data transmission. Therefore, how to improve data security during transmission has become an urgent problem to be solved.

[0057] Based on this, embodiments of this application provide a data quantum transmission method and apparatus, electronic device and storage medium, aiming to improve the security of data during transmission.

[0058] This application provides a data quantum transmission method, apparatus, electronic device, and storage medium, which are specifically described through the following embodiments. First, the data quantum transmission method in this application is described.

[0059] The data quantum transmission method provided in this application relates to the field of data transmission technology. The data quantum transmission method provided in this application can be applied to a terminal, a server, or software running on either a terminal or a server. In some embodiments, the terminal can be a smartphone, tablet, laptop, desktop computer, etc.; the server can be configured as an independent physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server providing basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDN, and big data and artificial intelligence platforms; the software can be an application implementing the data quantum transmission method, but is not limited to the above forms.

[0060] This application can be used in a wide variety of general-purpose or special-purpose computer system environments or configurations. Examples include: personal computers, server computers, handheld or portable devices, tablet devices, multiprocessor systems, microprocessor-based systems, set-top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, and distributed computing environments including any of the above systems or devices. This application can be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc., that perform specific tasks or implement specific abstract data types. This application can also be practiced in distributed computing environments where tasks are performed by remote processing devices connected via a communication network. In distributed computing environments, program modules can reside in local and remote computer storage media, including storage devices.

[0061] It should be noted that in all specific embodiments of this application, when processing data related to user identity or characteristics, such as user information, user behavior data, user historical data, and user location information, user permission or consent is obtained first. Furthermore, the collection, use, and processing of this data comply with relevant laws, regulations, and standards. In addition, when embodiments of this application require access to sensitive personal information of users, separate permission or consent from the user is obtained through pop-ups or redirection to confirmation pages. Only after obtaining the user's separate permission or consent is the necessary user-related data required for the proper functioning of these embodiments acquired.

[0062] Figure 1 This is an optional flowchart of the data quantum transmission method provided in the embodiments of this application. Figure 1 The method may include, but is not limited to, steps S101 to S104.

[0063] Step S101: Obtain initial transmission data;

[0064] Step S102: Quantum encoding is performed on the initial transmission data according to the preset quantum encoding random number to obtain quantum transmission data;

[0065] Step S103: Encrypt the initial transmission data, quantum transmission data, and quantum-encoded random number to obtain the target transmission data;

[0066] Step S104: Data is transmitted to the preset data receiving end according to the target transmission data.

[0067] Steps S101 to S104 as shown in the embodiments of this application first obtain initial transmission data, then perform quantum encoding on the initial transmission data according to a preset quantum encoding random number to obtain quantum transmission data, thereby realizing the formation of a digital signature on the initial transmission data based on quantum encoding, thus preventing the data from being tampered with during transmission and improving the security of data transmission; furthermore, the initial transmission data, quantum transmission data, and quantum encoding random number are encrypted to obtain target transmission data, preventing the data from being deciphered during transmission, and obtaining encrypted target transmission data, and finally transmitting the target transmission data to a preset data receiving end, thereby realizing secure data transmission that can prevent data from being deciphered and tampered with.

[0068] In step S101 of some embodiments, the initial transmission data refers to the original information or dataset to be transmitted at the beginning of the data transmission process; that is, the initial transmission data contains all the original content that needs to be securely transmitted. For example, on a registration website, the user's identity registration information sent from the user's client to the data receiving client can be the initial transmission data.

[0069] Please see Figure 2 In some embodiments, step S102 may include, but is not limited to, steps S201 to S203:

[0070] Step S201: Encode the initial transmitted data into binary to obtain an initial binary data string;

[0071] Step S202: Map the initial binary data string to the encoding base according to the quantum encoded random number to obtain the initial encoding base;

[0072] Step S203: Quantum encoding is performed on the initial binary data string according to the initial encoding basis to obtain quantum transmission data.

[0073] Steps S201 to S203 as shown in the embodiments of this application involve binary encoding the initial transmission data to obtain an initial binary data string, mapping the initial binary data string to an encoding base based on a quantum-encoded random number to obtain an initial encoding base, and finally quantum encoding the initial binary data string based on the initial encoding base to obtain quantum transmission data. This achieves the formation of a digital signature for the initial transmission data based on quantum encoding, thereby preventing data from being tampered with during transmission and improving the security of data during data transmission.

[0074] In step S201 of some embodiments, binary encoding converts the original data into binary form, that is, a bit sequence composed of 0s and 1s. The initial binary data string refers to the bit sequence after binary encoding, which consists of a series of 0s and 1s. The binary encoding method may include, but is not limited to, converting the initial transmitted data into ASCII encoding or UTF-8 binary encoding. For example, ASCII encoding the string "Hello" yields the binary string "01001000 0110010101101100 01101100 01101100 01101111".

[0075] Please see Figure 3 In some embodiments, step S202 may include, but is not limited to, steps S301 to S303:

[0076] Step S301: Obtain the number of bits in the initial binary data string to get the encoding base number;

[0077] Step S302: Create a coding base based on the number of coding base bits to obtain candidate coding bases;

[0078] Step S303: Map the candidate coding bases to the initial coding bases based on the initial binary data string and the quantum-coded random number to obtain the initial coding base.

[0079] In the embodiments of this application, steps S301 to S303 are performed to obtain the number of bits in the initial binary data string, thus obtaining the number of encoding base bits. Then, an encoding base is created based on the number of encoding base bits to obtain candidate encoding bases. Finally, the candidate encoding bases are mapped to the initial binary data string and the quantum encoding random number to obtain the initial encoding base. This determines the encoding base corresponding to the initial binary data string, which is the initial encoding base, and provides a data foundation for subsequent quantum encoding of the initial binary data string.

[0080] In step S301 of some embodiments, the number of bits in the initial binary data string refers to the total number of individual bits constituting the initial binary data string. For example, if the initial binary data string is 1101010, then the number of bits in the initial binary data string, i.e., the encoding base number, is 7.

[0081] In step S302 of some embodiments, the coding base creation is based on Reed-Muller codes (RM). Constructing the RM code involves two parameters: order r and dimension m. The code length of the RM code is 2^n. m Power of 1.

[0082] When creating the encoding base, set the code length of the RM encoding to 2. m Consistent with the base number n of the encoding, i.e., determining the dimension m of the RM encoding, and then letting r = m / 2, i.e., determining the dimension m in the RM encoding as log₂n, the order of the RM encoding is determined as... This leads to the determination of the RM encoding, which in turn yields the candidate encoding base.

[0083] It should be noted that when the order of the RM encoding is half the dimension, that is, when RM(m / 2,m), the minimum Hamming distance between any codeword in the RM is: At this point, any two different initial binary data strings corresponding to different alternative encoding bases have collision resistance, as shown in equation (1):

[0084]

[0085] Where x1 is the first initial binary data string, x2 is the second initial binary data string, and x1 and x2 are different; b1 is the candidate encoding base corresponding to the first initial binary data string, b2 is the candidate encoding base corresponding to the second initial binary data string; H(x1,x2) is the Hamming distance between the first initial binary data string and the second initial binary data string; and H(b1,b2) is the Hamming distance between the candidate encoding base corresponding to the first initial binary data string and the candidate encoding base corresponding to the second initial binary data string.

[0086] It should be noted that when the different candidate encoding bases corresponding to any two different initial binary data strings are collision-resistant, the probability of different quantum encodings being misjudged as the same is reduced. For example, given a first initial binary data string and a second initial binary data string, the first initial binary data string corresponds to the first initial encoding base, and the second initial binary data string corresponds to the second initial encoding base. Then, the first initial binary data string is quantum encoded according to the first initial encoding base to obtain the first quantum transmission data, and simultaneously, the second initial binary data string is quantum encoded according to the second initial encoding base to obtain the second quantum transmission data. In this case, since the minimum Hamming distance between the first initial encoding base and the second initial encoding base is greater than or equal to... Therefore, the sum of the Hamming distance between the first initial binary data string and the second initial binary data string, and the Hamming distance between the first initial coding base and the second initial coding base, is greater than or equal to 1. This ensures that the difference in the number of bits between the first and second quantum transmitted data is greater than a preset difference threshold, thereby reducing the likelihood of the first and second quantum transmitted data being mistakenly identified as the same quantum data. In other words, the first and second quantum transmitted data will not be considered the same quantum data. Based on this, the quantum transmitted data formed by an initial binary data string is ultimately unique. That is, the quantum transmitted data corresponding to one initial binary data string is different from that corresponding to another initial binary data string. Therefore, the quantum transmitted data can be used as a digital signature of the initial binary data string.

[0087] It should be noted that when creating the encoding base, the code length of RM encoding is set to 2. m Consistent with the base number n of the encoding, i.e., determining the dimension m of the RM encoding, and then letting r = m / 2, i.e., determining the dimension m in the RM encoding as log₂n, the order of the RM encoding is determined as... Therefore, given the premise of RM encoding, the code length of RM encoding must be the same as the number of bits in the initial binary data string. For example, if the initial binary data string has 8 bits, then the code length of RM encoding must be 8.

[0088] It should be noted that when the initial transmitted data is binary encoded to obtain the initial binary data string, a preset binary encoding algorithm is used to ensure that the number of bits in the initial binary data string is always 2. k The length of the RM code is determined by k, where k is a natural number greater than or equal to 1. This ensures that the code length of the subsequent RM encoding remains consistent with the number of bits in the initial binary data string.

[0089] In step S303 of some embodiments, mapping the candidate encoding base according to the initial binary data string and the quantum-encoded random number specifically involves mapping the initial binary data string according to the quantum-encoded random number based on a preset mapping rule. The mapping rule can be addition, multiplication, or other mapping rules that ensure that an initial binary data string uniquely corresponds to an initial encoding base. For example, if the initial binary data string is "1010", the mapping rule is addition, the quantum-encoded random number is 6, and the corresponding binary string is "0110", then the data string after binary addition, i.e., the initial encoding base, is "1100".

[0090] Please see Figure 4 In some embodiments, step S203 may include, but is not limited to, steps S401 to S403:

[0091] Step S401: Filter the bit position information of the initial coding base according to the bit value of the initial coding base and the preset calculation base value to obtain the calculation base bit position data.

[0092] Step S402: Filter the bit position information of the initial encoding base according to the calculated base bit position data to obtain the Hadamard base bit position data;

[0093] Step S403: The initial binary data string is quantum encoded based on the calculated base bit position data and the Hadamard base bit position data to obtain quantum transmission data.

[0094] Steps S401 to S403 of this embodiment involve filtering the position information of the bits in the initial encoding base based on the bit values ​​of the initial encoding base and the preset computational base values ​​to obtain computational base bit position data. Then, the position information of the bits in the initial encoding base is filtered based on the computational base bit position data to obtain Hadamard bit position data. Finally, the initial binary data string is quantum-encoded based on the computational base bit position data and the Hadamard bit position data to obtain quantum transmission data. This determines which bit in the initial encoding base needs to be quantum-encoded based on computational base and which bit in the initial encoding base needs to be quantum-encoded based on Hadamard. By performing different quantum encodings on different positions, the complexity of the quantum transmission data is increased, ultimately achieving the characteristic that the data cannot be tampered with during transmission.

[0095] In step S401 of some embodiments, the positions of the bits are filtered according to the values ​​of each bit in the initial encoding base and the preset computational base values. Specifically, when the value of a bit is 0, the bit is determined to be used for computational base quantum encoding.

[0096] It should be noted that this application does not impose any limitation on the value of the computational basis; the computational basis can be either 0 or 1. Therefore, even when the value of a bit is 1, it is still possible to choose to perform computational basis quantum encoding on that bit. Specific restrictions can be set according to the actual scenario.

[0097] In step S402 of some embodiments, the data for calculating the base bit positions determines which bits in the initial encoding base need to be quantum encoded using the computational base, while the bit positions not determined by the data for calculating the base bit positions are quantum encoded using the Hadamardi base.

[0098] Please see Figure 5 In some embodiments, step S403 includes, but is not limited to, steps S501 to S503:

[0099] Step S501: Perform computational basis encoding on the initial binary data string based on the computational basis bit position data to obtain at least one computational basis quantum code and the bit position data of the computational basis quantum code;

[0100] Step S502: Perform Hadamard encoding on the initial binary data string based on the Hadamard bit position data to obtain at least one Hadamard quantum code and Hadamard quantum code bit position data;

[0101] Step S503: Perform tensor calculations based on the computational basis quantum encoding, the bit position data of the computational basis quantum encoding, the Hadamard quantum encoding, and the bit position data of the Hadamard quantum encoding to obtain quantum transmission data.

[0102] Steps S501 to S503, as illustrated in the embodiments of this application, involve computational basis encoding of the initial binary data string based on the computational basis bit position data to obtain at least one computational basis quantum code and bit position data of the computational basis quantum code. Then, Hadamard encoding is performed on the initial binary data string based on the Hadamard bit position data to obtain at least one Hadamard quantum code and bit position data of the Hadamard quantum code. Finally, tensor calculations are performed based on the computational basis quantum code, the computational basis quantum code, the Hadamard quantum code, and the Hadamard quantum code to obtain quantum transmission data. This achieves quantum encoding of the initial binary data string, forming an immutable and highly complex digital signature, thereby improving the security of data during data transmission.

[0103] In step S501 of some embodiments, the computational base bit position data indicates which bits in the initial binary data string need to be computationally encoded using base quantum mechanics. Then, the corresponding bits are quantum encoded according to these specified positions to generate at least one computational base quantum code and its corresponding bit position data. For example, if the initial binary data string is 1101, the computational base bit position data indicates that the 2nd and 4th bits need to be computationally encoded using base quantum mechanics. The 2nd bit (1) is computationally encoded using base quantum mechanics to obtain the quantum state |1>, which is the computational base quantum code |1> and the computational base quantum code bit position data 2. The 4th bit (1) is computationally encoded using base quantum mechanics to obtain the quantum state |1>, which is the computational base quantum code |1> and the computational base quantum code bit position data 4.

[0104] In step S502 of some embodiments, the Hadamard bit position data indicates which bits in the initial binary data string need to be Hadamard quantum encoded. Then, the corresponding bits are quantum encoded according to these specified positions to generate at least one Hadamard quantum code and its corresponding bit position data. For example, if the initial binary data string is 1101, the Hadamard bit position data indicates that the 1st and 3rd bits need to be computed to the basis quantum code. Hadamard quantum encoding is performed on the 1st bit (1) to obtain the quantum state |->, that is, the Hadamard quantum code is |-> and the Hadamard quantum encoded bit position data is 1. Hadamard quantum encoding is performed on the 3rd bit (0) to obtain the quantum state 1+>, the Hadamard quantum code is |+>, and the Hadamard quantum encoded bit position data is 3.

[0105] In step S503 of some embodiments, the bit position data of the computational basis quantum code and the Hadamard quantum code are sorted from smallest to largest. Then, a tensor product is performed on the computational basis quantum code and the Hadamard quantum code at the corresponding positions to obtain the quantum transmission data. For example, the first Hadamard quantum code is |->, the second computational basis quantum code is |1>, the third Hadamard quantum code is |+>, and the fourth computational basis quantum code is |1>. Tensor products are performed on each quantum state from the first to the fourth bit in the order of the bits to obtain the entire quantum transmission data.

[0106] Please see Figure 6 In some embodiments, step S103 includes, but is not limited to, steps S601 to S602:

[0107] Step S601: Perform symmetric encryption on the initial transmitted data to obtain symmetric transmitted data;

[0108] Step S602: Perform asymmetric encryption on the quantum transmission data, quantum-coded random number, and symmetric transmission data to obtain the target transmission data.

[0109] Steps S601 to S602, as shown in the embodiments of this application, involve symmetric encryption of the initial transmission data to obtain symmetric transmission data, followed by asymmetric encryption of the quantum transmission data, quantum-encoded random numbers, and symmetric transmission data to obtain the target transmission data. This prevents the data from being deciphered during transmission and improves the security of the data during transmission.

[0110] In step S601 of some embodiments, symmetric encryption is an encryption method that uses the same key in both encryption and decryption. The sender uses this key to convert the initial transmitted data into symmetric transmitted data. The receiver then uses the same key to convert the symmetric transmitted data back into the initial transmitted data. The symmetric encryption can be Advanced Encryption Standard (AES), Data Encryption Standard (DES), or 3DES (Triple Data Encryption Standard), and this application does not impose any specific limitations.

[0111] Please see Figure 7 In some embodiments, step S602 may include, but is not limited to, steps S701 to S702:

[0112] Step S701: Encapsulate the quantum transmission data, quantum-encoded random numbers, and symmetric transmission data to obtain encapsulated transmission data;

[0113] Step S702: Encrypt the encapsulated transmission data according to the preset public key to obtain the target transmission data.

[0114] Steps S701 to S702, as shown in the embodiments of this application, encapsulate quantum transmission data, quantum encoded random numbers, and symmetric transmission data to obtain encapsulated transmission data. Then, the encapsulated transmission data is encrypted according to a preset public key to obtain the target transmission data, thereby further improving the security of the data and enhancing the security of the data during transmission.

[0115] In step S701 of some embodiments, data encapsulation refers to combining multiple different types of data units, namely quantum transmission data, quantum-coded random numbers, and symmetric transmission data, into a unified, structured data packet. For example, JSON format is used to encapsulate quantum transmission data, quantum-coded random numbers, and symmetric transmission data. For example, ZIP compression format is used to encapsulate quantum transmission data, quantum-coded random numbers, and symmetric transmission data.

[0116] In step S702 of some embodiments, the asymmetric encryption algorithm includes a public key and a private key. Data can be encrypted using the public key, and only the private key can decrypt the data encrypted with the public key. In this embodiment, the data sending end includes a preset public key. The data sending end encrypts the encapsulated transmission data using the public key to obtain the target transmission data. The target transmission data can only be decrypted by the end possessing the private key, thereby ensuring that the data is not stolen during data transmission. The data encryption method can be an RSA algorithm or an ECC algorithm; this application does not impose specific limitations.

[0117] In step S104 of some embodiments, the preset data receiving end is the data receiver, and the data sender transmits the target data to the data receiver. The data transmission method can be RPC, HTTP or HTTPS, and this application does not impose specific limitations.

[0118] In one embodiment, the data transmitter performs random number generation to obtain a quantum-encoded random number. Then, it quantum-encodes the initial transmitted data using this random number to obtain quantum transmitted data. Next, it performs symmetric encryption on the initial transmitted data to obtain symmetric transmitted data. Finally, it encapsulates the quantum transmitted data, the quantum-encoded random number, and the symmetric transmitted data to obtain encapsulated transmitted data. Finally, it encrypts the encapsulated transmitted data using a preset public key to obtain the target transmitted data. The target transmitted data is then transmitted to the data receiver.

[0119] After acquiring the target transmission data, the data receiver decrypts the target transmission data using a preset private key to obtain encapsulated transmission data. Then, it parses the encapsulated transmission data to obtain quantum transmission data, quantum-encoded random numbers, and symmetric transmission data. The data receiver then performs symmetric decryption on the symmetric transmission data to obtain the initial transmission data. Next, it quantum-encodes the initial transmission data using the quantum-encoded random numbers to obtain verification transmission data. The verification transmission data and the quantum transmission data are then compared. Because the quantum encoding process ensures collision resistance, if the data is tampered with mid-transmission, the verification transmission data and the quantum transmission data will not be considered identical. In other words, if the verification transmission data and the quantum transmission data are determined to be identical, the data has not been modified during transmission. If the verification transmission data and the quantum transmission data are identical, the data receiver determines that the decrypted initial transmission data is consistent with the initial transmission data sent by the data sender.

[0120] Please see Figure 8 This application also provides a data quantum transmission device that can implement the above-described data quantum transmission method. The device includes:

[0121] The data acquisition module 801 is used to acquire the initial transmission data;

[0122] The quantum encoding module 802 is used to quantum encode the initial transmission data according to a preset quantum encoding random number to obtain quantum transmission data;

[0123] The data encryption module 803 is used to encrypt the initial transmission data, quantum transmission data, and quantum-encoded random numbers to obtain the target transmission data.

[0124] The data transmission module 804 is used to transmit data to a preset data receiving end according to the target data to be transmitted.

[0125] The specific implementation of this data quantum transmission device is basically the same as the specific implementation of the data quantum transmission method described above, and will not be repeated here.

[0126] This application also provides an electronic device, which includes a memory and a processor. The memory stores a computer program, and the processor executes the computer program to implement the above-described quantum data transmission method. This electronic device can be any smart terminal, including tablet computers, in-vehicle computers, etc.

[0127] Please see Figure 9 , Figure 9 The hardware structure of an electronic device according to another embodiment is illustrated. The electronic device includes:

[0128] The processor 901 can be implemented using a general-purpose CPU (Central Processing Unit), microprocessor, application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this application.

[0129] The memory 902 can be implemented as a read-only memory (ROM), a static storage device, a dynamic storage device, or a random access memory (RAM). The memory 902 can store the operating system and other application programs. When the technical solutions provided in the embodiments of this specification are implemented through software or firmware, the relevant program code is stored in the memory 902 and is called and executed by the processor 901 using the data quantum transmission method of the embodiments of this application.

[0130] The input / output interface 903 is used to implement information input and output;

[0131] The communication interface 904 is used to enable communication and interaction between this device and other devices. Communication can be achieved through wired means (such as USB, Ethernet cable, etc.) or wireless means (such as mobile network, WIFI, Bluetooth, etc.).

[0132] Bus 905 transmits information between various components of the device (e.g., processor 901, memory 902, input / output interface 903, and communication interface 904);

[0133] The processor 901, memory 902, input / output interface 903, and communication interface 904 are connected to each other within the device via bus 905.

[0134] This application also provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the above-described data quantum transmission method.

[0135] Memory, as a non-transitory computer-readable storage medium, can be used to store non-transitory software programs and non-transitory computer-executable programs. Furthermore, memory may include high-speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid-state storage device. In some embodiments, memory may optionally include memory remotely located relative to the processor, and these remote memories can be connected to the processor via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

[0136] The data quantum transmission method, data quantum transmission device, electronic device, and storage medium provided in this application first acquire initial transmission data, then quantum encode the initial transmission data according to a preset quantum-encoded random number to obtain quantum transmission data, thereby forming a digital signature on the initial transmission data based on quantum encoding, thus preventing data from being tampered with during transmission and improving data security during data transmission; furthermore, the initial transmission data, quantum transmission data, and quantum-encoded random number are encrypted to obtain target transmission data, preventing data from being deciphered during transmission, and obtaining encrypted target transmission data, and finally transmitting the target transmission data to a preset data receiving end, thereby achieving secure data transmission that can prevent data from being deciphered and tampered with.

[0137] The embodiments described in this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided by the embodiments of this application. As those skilled in the art will know, with the evolution of technology and the emergence of new application scenarios, the technical solutions provided by the embodiments of this application are also applicable to similar technical problems.

[0138] Those skilled in the art will understand that the technical solutions shown in the figures do not constitute a limitation on the embodiments of this application, and may include more or fewer steps than shown, or combine certain steps, or different steps.

[0139] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs.

[0140] Those skilled in the art will understand that all or some of the steps in the methods disclosed above, as well as the functional modules / units in the systems and devices, can be implemented as software, firmware, hardware, or suitable combinations thereof.

[0141] The terms "second," "third," "fourth," etc. (if present) in the specification and accompanying drawings of this application are used to distinguish similar objects and are not necessarily used to describe a particular order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of this application described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0142] It should be understood that in this application, "at least one (item)" means one or more, and "more than" means two or more. "And / or" is used to describe the relationship between related objects, indicating that three relationships can exist. For example, "A and / or B" can represent three cases: only A exists, only B exists, and both A and B exist simultaneously, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one (item) of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one (item) of a, b, or c can represent: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be single or multiple.

[0143] In the several embodiments provided in this application, it should be understood that the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of the units described above is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0144] The units described above as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0145] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0146] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes multiple instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods of the various embodiments of this application. The aforementioned storage medium includes various media capable of storing programs, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0147] The preferred embodiments of the present application have been described above with reference to the accompanying drawings, but this does not limit the scope of the claims of the present application. Any modifications, equivalent substitutions, and improvements made by those skilled in the art without departing from the scope and substance of the embodiments of the present application shall be within the scope of the claims of the present application.

Claims

1. A method for quantum data transmission, characterized in that, The method includes: Obtain initial transmission data; The initial transmitted data is binary encoded to obtain an initial binary data string; The initial binary data string is mapped to a coding base using a preset quantum-coded random number to obtain the initial coding base; The position information of the bits of the initial encoding base is filtered according to the value of the bits of the initial encoding base and the preset calculation base value to obtain the bit position data of the calculation base. The position information of the bits of the initial encoding base is filtered based on the calculated base bit position data to obtain the Hadamard base bit position data; The initial binary data string is quantum-encoded based on the calculated base bit position data and the Hadamard base bit position data to obtain quantum transmission data; The initial transmission data, the quantum transmission data, and the quantum-encoded random number are encrypted to obtain the target transmission data. Data is transmitted to a preset data receiving end according to the target transmission data.

2. The method according to claim 1, characterized in that, The step of mapping the initial binary data string to a coding base based on a preset quantum-coded random number to obtain the initial coding base includes: Obtain the number of bits in the initial binary data string to get the encoding base number; Based on the number of encoding base bits, an encoding base is created to obtain candidate encoding bases; The candidate encoding base is obtained by mapping the data based on the initial binary data string and the quantum encoded random number.

3. The method according to claim 1, characterized in that, The step of quantum encoding the initial binary data string based on the calculated base bit position data and the Hadamard base bit position data to obtain the quantum transmission data includes: The initial binary data string is encoded using computational basis bit position data to obtain at least one computational basis quantum code and bit position data of the computational basis quantum code; The initial binary data string is encoded using the Hadamard bit position data to obtain at least one Hadamard quantum code and the bit position data of the Hadamard quantum code. The quantum transmission data is obtained by performing tensor calculations based on the computational basis quantum encoding, the bit position data of the computational basis quantum encoding, the Hadamard quantum encoding, and the bit position data of the Hadamard quantum encoding.

4. The method according to any one of claims 1 to 3, characterized in that, The step of encrypting the initial transmission data, the quantum transmission data, and the quantum-encoded random number to obtain the target transmission data includes: The initial transmitted data is symmetrically encrypted to obtain symmetric transmitted data; The target transmission data is obtained by performing asymmetric encryption on the quantum transmission data, the quantum-encoded random number, and the symmetric transmission data.

5. The method according to claim 4, characterized in that, The step of performing asymmetric encryption on the quantum transmission data, the quantum-coded random number, and the symmetric transmission data to obtain the target transmission data includes: The quantum transmission data, the quantum-encoded random number, and the symmetric transmission data are encapsulated to obtain encapsulated transmission data. The encapsulated transmission data is encrypted using a preset public key to obtain the target transmission data.

6. A data quantum transmission device, characterized in that, The device includes: The data acquisition module is used to acquire the initial transmission data; A quantum encoding module is configured to: encode the initial transmission data into binary form to obtain an initial binary data string; map the initial binary data string to an encoding base according to a preset quantum encoding random number to obtain an initial encoding base; filter the bit position information of the initial encoding base according to the bit values ​​of the initial encoding base and a preset computational base value to obtain computational base bit position data; filter the bit position information of the initial encoding base according to the computational base bit position data to obtain Hadamard bit position data; and quantum encode the initial binary data string according to the computational base bit position data and the Hadamard bit position data to obtain quantum transmission data. The data encryption module is used to encrypt the initial transmission data, the quantum transmission data, and the quantum-encoded random number to obtain the target transmission data; The data transmission module is used to transmit data to a preset data receiving end according to the target transmission data.

7. An electronic device, characterized in that, The electronic device includes a memory and a processor, the memory storing a computer program, and the processor executing the computer program to implement the data quantum transmission method according to any one of claims 1 to 5.

8. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by a processor, it implements the data quantum transmission method according to any one of claims 1 to 5.

Citation Information

Patent Citations

  • Visual quantum computing programming system

    CN116911396A

  • Quantum cryptography with multi-party randomness

    US7697693B1