Transformer area data encryption transmission method and system based on quantum communication

Abstract

The invention provides a zone area data encryption transmission method based on quantum communication technology, which comprises the following steps: S1, establishing a communication channel between a node A and a node B, and verifying the channel security; s2, carrying out mutual authentication on identities of the node A and the node B; and S3, information transmission is carried out by adopting a dynamic encryption mode based on the quantum key. According to the method, safe and efficient transmission of the transformer area data is achieved through the quantum superposition state and the entanglement effect.

Description

Technical Field

[0001] The present invention relates to communication technology, and in particular to a method for encrypting and transmitting data in a station area based on quantum communication. Background Art

[0002] With the rapid development of the Internet, the security of data transmission has received increasing attention. Although traditional encryption methods such as symmetric encryption algorithms and public key encryption algorithms have ensured the security of data transmission to a certain extent, they still face the risk of being cracked. Quantum communication, based on the uncertainty, measurement collapse and non-cloning principles in quantum mechanics, provides absolute security that cannot be eavesdropped or cracked by calculation.

[0003] At present, quantum communication technology has made significant progress in quantum key distribution (QKD) and quantum teleportation, but its application in data encryption transmission in the distribution area needs further exploration. The distribution network area data includes the safe operation control data, fault alarm data, power consumption data, etc. These data have the characteristics of many nodes, wide distribution, and high security requirements. Efficient and reliable communication methods are the basis for the operation of distribution network areas.

[0004] At present, data communication in distribution network areas is mainly transmitted through wired networks (cables, optical fibers), wireless networks (using 2G, 4G, 5G and other technologies), and some areas also use satellite communications and other technologies. These transmission methods have the disadvantages of information leakage, tampering, and inability to verify node status. The present invention introduces quantum communication into data transmission in the area to ensure efficient and reliable communication, while having good economy and practicality. Summary of the invention

[0005] The purpose of the present invention is to solve the problems existing in the above-mentioned prior art and to provide a method for encrypting and transmitting data in an area combined with quantum communication technology, aiming to achieve safe and efficient transmission of data in the area through quantum superposition and entanglement effects.

[0006] In order to achieve the above object, the present invention provides a method for transmitting encrypted data in a quantum communication technology, comprising:

[0007] Step S1: Establish a communication channel between node A and node B, and verify the security of the channel;

[0008] Step S2: Mutual authentication between the node A and the node B;

[0009] Step S3: Use dynamic encryption based on quantum key to transmit information.

[0010] Preferably, before step S1, the following steps are also included:

[0011] Share a bit string matrix K among communication nodes AB As a secret key matrix and a basic encryption matrix, this matrix can be updated regularly

[0012]

[0013] Meanwhile, share a one-way hash function H: {0, 1} * →{0, 1} d , and output a hash value of length d for the data string;

[0014] The quantum key server sends a set of quantum keys to the node A and the node B through a quantum channel. After the node A and the node B measure according to the agreed measurement method, the obtained quantum secrets are respectively

[0015] Preferably, the step S1 further includes:

[0016] Step S1.1: Randomly generate a channel check string and determine an encryption key;

[0017] The node A randomly generates a string S = [s1, s 2, …, s L , with a length of L. The node A selects an encryption key from the secret key matrix to encrypt this string;

[0018] The encryption method is determined from the first r bits of the quantum key, where r < M, that is, through determine the selected encryption key;

[0019] The selected secret key serial number value is ind, ind ∈ {1, 2, …, V}, and the calculation method is as follows:

[0020]

[0021] In the formula, the Val(·) function represents the value of the string, and the mod(·) function represents taking the remainder; V represents the number of secrets in the shared secret key matrix; represents rounding down. Generally, when the string value is 0, the secret key sequence value is usually selected as 1, but there is a risk of leakage. Therefore, the middle secret key is selected in this article, and this value is related to the total number of secret keys.

[0022] Preferably, the step S1 further includes:

[0023] Step S1.2: Send encrypted verification data;

[0024] Merge the quantum key Q (A) and the random string S to form a new string Use the hash function to calculate the hash value of the string H = [h1,h2,…,h d ];

[0025] Using the selected secret key K ind,B =[k ind,1 ,k ind,2, …,k ind,N ], for S = [s1,s 2, …,s L ] to encrypt, and the encrypted string is

[0026] Through the traditional channel, the A node sends the hash value H and the encrypted string S * Transmitted to the Node B.

[0027] Preferably, the step S1 further comprises:

[0028] Step S1.3: Encrypted data verification;

[0029] The node B receives the hash value H and the encrypted string S * , according to its own quantum key According to the quantum properties of the entangled state, we can get The selected serial number is determined by the method of step S1.1 as ind key K ind,B =[k ind,1 ,k ind,2, …,k ind,N ];

[0030] After determining the encryption key, the encrypted string S * Decryption is performed to obtain the random string S = [s1,s 2, …,s L ];

[0031] The calculated Combine it with the random string obtained by decryption, that is The local hash value H1 is calculated. If the hash value H received through the traditional channel is exactly the same as the hash value H1 calculated locally, then the quantum key is combined with the random string S to obtain Calculate its hash value H2 and send H2 to the node A through the traditional channel. After receiving it, the node A compares it with the local calculation If the hash values ​​of the two are consistent, the two establish communication;

[0032] If the information verification of both parties fails, it means that the communication channel is not secure and communication will not be carried out.

[0033] Preferably, the step S2 further comprises:

[0034] Encode the identity node information and encrypt it. Let the identity information be encoded as To ensure the secure transmission of node identity information, the node information is combined with the quantum key Perform an "AND" operation to obtain the identity code sequence ID (A)0 ;

[0035] If the length of the identity information code is greater than the quantum key value, the quantum key is repeated, that is, Until the length meets the requirement;

[0036] ID (A)0 Calculate its d-bit hash value H (A)0 (such as MD5 code), transmitted to node B through the traditional channel, and node B uses the quantum key Sure According to the node data dictionary to be communicated, find the identity information of node A, which is encoded as Then with Q (A) Perform an "AND" operation and calculate the hash value H of the sequence (A)1 If the two are consistent, it means that the identity of node A has been authenticated by node B;

[0037] The node B sends information to be authenticated by the node A in the same way. After the two authenticate each other, the node identity authentication is passed.

[0038] Preferably, the step S3 further comprises:

[0039] Step S3.1: Assume that the data to be transmitted from the node A to the node B is X = {x1, x2, ..., x G}, communication is based on the secret key matrix KAB, KAB is dynamically updated according to the set rules, and the secret key matrix of the current time node is as follows,

[0040]

[0041] The quantum keys distributed by the quantum key server are

[0042] Preferably, the step S3 further comprises:

[0043] Step S3.2: Set the data X = {x1, x2, ..., x G} is divided into T segments of equal length. If the last line is not long enough, it will be padded with the default value 0;

[0044]

[0045] Take the i-th row data Xi =[x i1 ,x i2 ,…,x iE ] as an example, first calculate the selected secret key ind, the calculation is similar to the previous one, first i takes the remainder of the quantum key length M, and obtains f, f = mod(i, V);

[0046] Select r-bit encryption key If the subscripts f+1, f+2, …, f+r-1 are greater than M, the selection is cyclically started from 1, that is, the first digit of the quantum key is M+1, the second digit is M+2, and so on. The specific method of data encryption key based on quantum key is as follows:

[0047]

[0048] In the formula, Val(·) function represents the value of the string, mod(·) function represents the remainder, V represents the number of keys in the shared key matrix, means rounding down, then the encryption key selected for the i-th row of data is

[0049] K ind,B =[k ind,1 ,k ind,2 ,…,k ind,N ];

[0050] Encrypt the data in X i =[x i1 ,x i2, …,x iE ] After the position is mod(ind,E), the sequence to be transmitted is recorded as

[0051] Preferably, the step S3 further comprises:

[0052] Step S3.3: Data encryption transmission;

[0053] The sequence to be transmitted is denoted as Through the secret key K ind,B =[k ind,1 ,k ind,2 ,…,k ind,N ] to encrypt and obtain the sequence X′ i *, transmission through traditional channels;

[0054] Step S3.4: data decryption and verification;

[0055] Node B receives sequence X′ i *Finally, the quantum key of node A is determined based on its own quantum encryption key Determine the selected encryption key K according to the method in step S3.2 ind,B =[k ind,1 ,k ind,2, …,k ind,N ], and quantum keys Insertion position mod(ind,E);

[0056] For the obtained sequence X′ i *Decrypt and get Judging from the data The value determined by the quantum key is verified. If they are consistent, it means that the transmission is safe and reliable. Extract [x i1 ,x i2, …,x iE ];

[0057] Follow the above method until all data is transferred.

[0058] On the other hand, the present invention provides a station area data encryption transmission system based on quantum communication technology, which is used to execute the above method.

[0059] Compared with the prior art, the present invention has the following beneficial effects:

[0060] 1) By combining quantum communication with traditional channel communication, we can give full play to the advantages of high security of quantum communication and low cost and convenience of traditional encryption, and improve the efficiency of data security communication in distribution network areas;

[0061] 2) The method of the present invention not only verifies the security of the channel, but also verifies the communication nodes against each other to prevent the occurrence of node identity forgery and ensure the absolute security of data transmission in the distribution network area.

[0062] 3) The method of the present invention only requires one quantum key distribution, that is, quantum encryption secure communication between two nodes can be realized, which is cost-effective and practical.

[0063] 4) During the channel security detection and identity authentication process, quantum key information and other important information are not transmitted in the channel, ensuring that the quantum key information can be used multiple times during channel detection and identity authentication, without information leakage or identity tampering.

[0064] 5) During information transmission, a dynamic key mechanism is used for segmented encryption and transmission, and the data content is verified to prevent key cracking during communication, as well as information deception, forgery and other transmission risks. BRIEF DESCRIPTION OF THE DRAWINGS

[0065] Figure 1 This is a schematic diagram of quantum key distribution of the present invention.

[0066] Figure 2 Schematic diagram of a method for encrypting and transmitting data in a metropolitan area in combination with quantum communication technology according to an embodiment of the present invention. DETAILED DESCRIPTION

[0067] The present invention is further described in detail below in conjunction with the accompanying drawings:

[0068] In order to better understand the present invention, the embodiments of the present invention are explained in detail below with reference to the accompanying drawings.

[0069] Attached Figure 1 A schematic diagram of quantum key distribution is provided, in which quantum encryption communication is mainly based on traditional channels for data transmission, and quantum channels are mainly used for key transmission. Generally speaking, quantum key distribution has the inherent property of being untamperable and tamper-proof, but when transmitting between two nodes, a third party may steal the key in other ways. For example, forging the identity of a node and tricking the power grid control center into issuing erroneous control instructions, thereby disrupting the operation of the power grid. Therefore, although the quantum key transmission process has extremely strong security, it is still necessary to design a method to continuously verify whether there is any theft or tampering during the communication process.

[0070] Attached Figure 2 This is a method for encrypting and transmitting data in a station area in combination with quantum communication technology according to an embodiment of the present invention.

[0071] Specifically, taking the data communication between the station node A and the node B as an example, the quantum encryption communication method is explained:

[0072] The communication nodes share a bit string matrix K AB As a key matrix, as a basic encryption matrix, this matrix can be updated regularly:

[0073]

[0074] At the same time, they share a one-way hash function H:{0,1} * →{0,1} d , the hash value of the data string can be output with a length of d.

[0075] The quantum key server sends a set of quantum keys to nodes A and B through the quantum channel. After nodes A and B measure according to the agreed measurement method, they can obtain the quantum keys respectively. According to the properties of the entangled quantum state, when node A obtains the secret key Q (A)After that, the secret key information of node B can be automatically deduced, and vice versa. When communicating between nodes in a distribution network substation area, both the security of the communication channel and the security of the node identity need to be ensured. To prevent the identity of the communication node from being imitated and then confidential information being stolen, it is necessary to authenticate the node identity. Since the secret key is distributed between the secret key server and the responding communication node through a quantum channel, the quantum secret key channel has high security, and identity authentication is carried out based on this.

[0076] Step S1: Establish a communication channel between nodes A and B and verify the channel security.

[0077] Step S1.1 Randomly generate a channel check string and determine the encryption secret key;

[0078] A randomly generates a string S = [s1, s 2, …, s L , with a length of L. A selects an encryption secret key from the secret key matrix to encrypt this string.

[0079] The encryption method is determined from the first r bits of the quantum secret key, where r < M, that is, through to further determine the selected encryption secret key.

[0080] The selected secret key serial number value is ind, ind ∈ {1, 2, …, V}, and the calculation method is as follows:

[0081]

[0082] In the formula, the Val(·) function represents the value of the string, and the mod(·) function represents taking the remainder. V represents the number of secret keys in the shared secret key matrix. represents rounding down. Generally, when the string value is 0, the secret key sequence value is usually selected as 1, but there is a risk of leakage. Therefore, in this paper, the middle secret key is selected, and this value is related to the total number of secret keys.

[0083] Step S1.2 Send the encrypted verification data.

[0084] Combine the quantum secret key Q (A) and the random string S to form a new string Use the hash function to calculate the hash value H = [h1, h 2, …, h d of this string. Then, use the selected secret key K ind,B = [k ind,1 , k ind,2, …, k ind,N to encrypt S = [s1, s 2, …, s L , and record the encrypted string as

[0085] Through the traditional channel, node A sends the hash value H and the encrypted string S * Transmit value node B.

[0086] Step S1.3 Encrypted data verification.

[0087] Node B receives the hash value H and the encrypted string S * , according to its own quantum key According to the quantum properties of the entangled state, we can determine Determine the selected serial number as ind key K by the method of step S1.1 ind,B =[k ind,1 ,k ind,2, …,k ind,N After the encryption key is determined, the encrypted string S * Decrypt and get the random string S = [s1,s 2, …,s L Then the calculated Combine it with the random string obtained by decryption, that is The local hash value H1 is calculated. If the hash value H received through the traditional channel is exactly the same as the hash value H1 calculated locally, the local quantum key is combined with the random string S to obtain Calculate its hash value H2 and send H2 to node A through the traditional channel. After receiving it, node A compares it with the local calculation If the two are consistent, the two establish communication. If the information verification of both parties fails, it means that the communication channel is not secure and communication is not recommended.

[0088] In the above process, the information transmitted through traditional channels is only hash values ​​and randomly generated strings. No additional valuable information is transmitted, ensuring that there is no risk of information leakage during the communication process.

[0089] Step S2: Mutual authentication between nodes A and B.

[0090] After ensuring the security of the communication channel, it is also necessary to ensure the security of the communication node identity. Encode the identity node information and encrypt it. Suppose the identity information is encoded as To ensure the secure transmission of node identity information, the node information is combined with the quantum key Perform an "AND" operation to obtain the identity code sequence ID (A)0 If the length of the identity information code is greater than the quantum key value, the quantum key is repeated, i.e. Until the length meets the requirement.

[0091] ID(A)0 Calculate its d-bit hash value H (A)0 (such as MD5 code), transmitted to node B through the traditional channel, and node B uses the quantum key Sure According to the node data dictionary to be communicated, find the identity information of node A, which is encoded as Then with Q (A) Perform an "AND" operation and calculate the hash value H of the sequence (A)1 If the two are consistent, it means that the identity of node A has been authenticated by node B. Node B follows the same method and sends information to node A for authentication. After the two authenticate each other, the node identity authentication is successful.

[0092] Step S3: Transmit information using dynamic encryption based on quantum key.

[0093] Dynamic encryption based on quantum keys can give full play to the security advantages of quantum encryption in the case of limited quantum keys, and reduce communication costs through encrypted transmission of traditional channels. After the communication channel and node identity information are authenticated, data transmission is carried out.

[0094] Step S3.1: Assume that the data to be transmitted from node A to node B is X = {x1, x2, ..., x G}, communication is based on the secret key matrix KAB, KAB is dynamically updated according to the set rules, and the secret key matrix of the current time node is as follows.

[0095]

[0096] The quantum keys distributed by the quantum key server are

[0097] Step S3.2: Data X = {x1, x2, ..., x G} is divided into T segments of equal length. If the last line is not long enough, it will be padded with the default value 0.

[0098]

[0099] Take the i-th row data X i =[x i1 ,x i2, …,x iE ] as an example, first calculate the selected secret key ind, the calculation is similar to the previous one, first i takes the remainder of the quantum key length M, and obtains f, f = mod(i, V). Select r-bit encryption key If the subscripts f+1, f+2, ..., f+r-1 are greater than M, the selection will be cyclically started from 1, that is, the first digit of the quantum key is M+1, the second digit is M+2, and so on. The specific method of data encryption key based on quantum key is as follows:

[0100]

[0101] Where, Val(·) function represents the value of the string, mod(·) function represents the remainder, and V represents the number of keys in the shared key matrix. Indicates rounding down. Then the encryption key selected for the i-th row of data is K ind,B =[k ind,1 ,k ind,2, …,k ind,N ]. Encrypt the data and i =[x i1 ,x i2, …,x iE ] After the position is mod(ind,E), the sequence to be transmitted is recorded as

[0102] Step S3.3: Data encryption transmission.

[0103] The sequence to be transmitted is denoted as Through the secret key K ind,B =[k ind,1 ,k ind,2, …,k ind,N ] to encrypt and obtain the sequence X′ i *, transmitted via conventional channels.

[0104] Step S3.4: Data decryption and verification.

[0105] Node B receives sequence X′ i *Finally, the quantum key of node A is determined based on its own quantum encryption key Determine the selected encryption key K according to the method in step S3.2 ind,B =[k ind,1 ,k ind,2 ,…,k ind,N ], and quantum keys The insertion position mod(ind,E). For the resulting sequence X′ i *Decrypt and get Judging from the data Verify with the value determined by its own quantum key. If they are consistent, it means that the transmission is safe and reliable. Extract [x i1 ,x i2,…,x iE ].

[0106] Follow the above method until all data is transferred.

[0107] In the description of the present invention, it should be noted that, unless otherwise clearly specified and limited, the terms "connected" and "connection" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection or an indirect connection through an intermediate medium. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0108] In the description of the present invention, unless otherwise specified, the terms "upper", "lower", "left", "right", "inside", "outside", etc. indicate directions or positional relationships based on the directions or positional relationships shown in the accompanying drawings. They are only for the convenience of describing the present invention and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific direction, be constructed and operated in a specific direction. Therefore, they cannot be understood as limitations on the present invention.

[0109] Finally, it should be explained that the above technical solution is only one implementation method of the present invention. For those skilled in the art, it is easy to make various types of improvements or modifications based on the application methods and principles disclosed in the present invention, and it is not limited to the method described in the above specific implementation method of the present invention. Therefore, the method described above is only preferred and does not have a restrictive meaning.

Claims

1. A method for encrypted transmission of data in a station area using quantum communication technology, characterized in that: Step S1: Establish a communication channel between node A and node B, and verify the security of the channel; Step S2: Mutual authentication between the node A and the node B; Step S3: Use dynamic encryption based on quantum key to transmit information.

2. The method according to claim 1, characterized in that Before step S1, the method further includes the following steps: The communication nodes share a bit string matrix K AB As a key matrix, as a basic encryption matrix, the matrix can be updated regularly At the same time, they share a one-way hash function H:{0,1} * →{0,1} d , output the hash value of the data string with a length of d; The quantum key server sends a set of quantum keys to the node A and the node B through the quantum channel. After the node A and the node B are measured according to the agreed measurement method, the quantum keys are 3. The method according to claim 2, characterized in that The step S1 further comprises: Step S1.1: Randomly generate a channel verification string and determine the encryption key; The node A randomly generates a string S = [s1, s2, ..., s L ], the length is L, the node A selects an encryption key from the key matrix to encrypt the string; The encryption method is determined from the first r bits of the quantum secret key, where r < M, that is, by determining the selected encryption secret key; The selected secret key serial number is ind, ind∈{1,2,…,V}, and the calculation method is as follows: Where, Val(·) function represents the value of the string, mod(·) function represents the remainder; V represents the number of keys in the shared key matrix; Indicates rounding down. The general method is to select a key sequence value of 1 when the string value is 0, but there is a risk of leakage. Therefore, this article selects the middle key, which is related to the total number of keys.

4. The method according to claim 3, characterized in that The step S1 further comprises: Step S1.2 sends encrypted verification data; The quantum key Q (A) Combined with the random string S to form a new string Use the hash function to calculate the hash value of the string H = [h1,h2,…,h d ]; Using the selected secret key K ind,B =[k ind,1 ,k ind,2 ,…,k ind,N ], for S = [s1,s2,…,s L ] to encrypt, and the encrypted string is Through the traditional channel, the A node sends the hash value H and the encrypted string S * Transmitted to the Node B.

5. The method according to claim 4, characterized in that The step S1 further comprises: Step S1.3: Encrypted data verification; The node B receives the hash value H and the encrypted string S * , according to their own quantum key According to the quantum properties of the entangled state, we can get The selected serial number is determined by the method of step S1.1 as ind key K ind,B =[k ind,1 ,k ind,2 ,…,k ind,N ]; After determining the encryption key, the encrypted string S * Decryption is performed to obtain the random string S = [s1, s2, ..., s L ]; The calculated Combine it with the random string obtained by decryption, that is The local hash value H1 is calculated. If the hash value H received through the traditional channel is exactly the same as the hash value H1 calculated locally, then the quantum key is combined with the random string S to obtain Calculate its hash value H2 and send H2 to the node A through the traditional channel. After receiving it, the node A compares it with the local calculation If the hash values ​​of the two are consistent, the two establish communication; If the information verification of both parties fails, it means that the communication channel is not secure and communication will not be carried out.

6. The method according to claim 5, characterized in that The step S2 further comprises: Encode the identity node information and encrypt it. Let the identity information be encoded as To ensure the secure transmission of node identity information, the node information is combined with the quantum key Perform an "AND" operation to obtain the identity code sequence ID (A)0 ; If the length of the identity information code is greater than the quantum key value, the quantum key is repeated, that is, Until the length meets the requirement; ID (A)0 Calculate its d-bit hash value H (A)0 (such as MD5 code), transmitted to node B through the traditional channel, and node B uses the quantum key Sure According to the node data dictionary to be communicated, find the identity information of node A, which is encoded as Then with Q (A) Perform an "AND" operation and calculate the hash value H of the sequence (A)1 If the two are consistent, it means that the identity of node A has been authenticated by node B; The node B sends information to be authenticated by the node A in the same way. After the two authenticate each other, the node identity authentication is passed.

7. The method according to claim 6, characterized in that The step S3 further comprises: Step S3.1: Assume that the data to be transmitted from the node A to the node B is X = {x1, x2, ..., x G }, communication is based on the secret key matrix KAB, KAB is dynamically updated according to the set rules, and the secret key matrix of the current time node is as follows, The quantum keys distributed by the quantum key server are 8. The method according to claim 7, characterized in that The step S3 further comprises: Step S3.2: Set the data X = {x1, x2, ..., x G } is divided into T segments of equal length. If the last line is not long enough, it will be padded with the default value 0; Take the i-th row data X i =[x i1 ,x i2 ,…,x iE ] as an example, first calculate the selected secret key ind, the calculation is similar to the previous one, first i takes the remainder of the quantum key length M, and obtains f, f = mod(i, V); Select r-bit encryption key If the subscripts f+1, f+2, …, f+r-1 are greater than M, the selection is cyclically started from 1, that is, the first digit of the quantum key is M+1, the second digit is M+2, and so on. The specific method of data encryption key based on quantum key is as follows: In the formula, Val(·) function represents the value of the string, mod(·) function represents the remainder, V represents the number of keys in the shared key matrix, means rounding down, then the encryption key selected for the i-th row of data is K ind,B =[k ind,1 ,k ind,2 ,…,k ind,N ]; Encrypt the data in X i =[x i1 ,x i2 ,…,x iE ] After the position is mod(ind,E), the sequence to be transmitted is recorded as 9. The method according to claim 8, characterized in that The step S3 further comprises: Step S3.3: Data encryption transmission; The sequence to be transmitted is denoted as Through the secret key K ind,B =[k ind,1 ,k ind,2 ,…,k ind,N ] to encrypt and get the sequence Transmission via conventional channels; Step S3.4: data decryption and verification; Node B receives the sequence After that, the quantum key of node A is determined based on its own quantum encryption key. Determine the selected encryption key K according to the method in step S3.2 ind,B =[k ind,1 ,k ind,2 ,…,k ind,N ], and quantum keys Insertion position mod(ind,E); For the obtained sequence X i ′* is decrypted to obtain Judging from the data The value determined by the quantum key is verified. If they are consistent, it means that the transmission is safe and reliable. Extract [x i1 ,x i2 ,…,x iE ]; Follow the above method until all data is transferred.

10. A data encryption transmission system for a station area using quantum communication technology, characterized in that Used to execute the method according to any one of claims 1 to 9.

Images