TW201445902A - Method for quantum communication - Google Patents

Abstract

This invention discloses a method for quantum communication to solve the problem of the communication data unable to provide authentication and encryption functions in the same time. The method comprises two steps. The first step performs a first hash value from a first plaintext based on a hash function, and then edits the first plaintext and the first hash value to form a first compiling text base on a merging rule, and then encrypts the first compiling text to form a first ciphertext based on a value key, and then transforms the first ciphertext to a quantum based on a format key, and then transmits the quantum to a receiver by a transmitter. The second step measures the quantum to obtain a second ciphertext based on the format key, and then decrypts the second ciphertext to obtain a second compiling text based the value key, and then obtains a second plaintext from the second compiling text based on the merging rule by the receiver. Thus, it can actually resolve the said problems.

Description

Quantum communication method

The present invention relates to a communication method; in particular, to a quantum communication method combining communication and authentication functions.

With the advancement of information communication technology (ICT), the dependence on information transmission in human life is increasing day by day, such as e-mail or electronic transactions. The use of cryptography in the transmission process can improve the security and privacy of information transmission. . In traditional information technology, in addition to one-time pad or proven method of security, most conventional ciphers can operate based on the principle of "computational security" to ensure information security. Due to the huge computing power of quantum parallel computing, the conventional cryptographer will face the crisis of password cracking, resulting in the interception of information that was originally confidential. Therefore, countries all over the world have invested in the field of quantum information research, such as quantum communication systems and methods, and look forward to providing more effective and secure methods of confidentiality for the information transmission process.

Conventional quantum communication systems usually include a "transmitter (or Alice)" and a "receiver (or Bob)", wherein the "transmitter" contains a computer and a polarized photon is randomly generated. An optical quantum random number generator, the "receiving end" includes another computer and a plurality of single photon detectors, and the "transmitting end" and the "receiving end" can pass through an optical fiber (or channel) , channel) are connected to transfer information.

In the operational flow of the conventional quantum communication method, when the user wants to transmit information to the "receiver" via the "sender", the "transmitter" polarized photon product The device will transmit a "pulse-polarized photon" to the single-photon detector of the "receiving end" via the channel, and then the computer of the "transmitting end" and the "receiving end" will openly discuss via the channel (public discussion) ), as well as a complicated judging process to check whether photons have been eavesdropped or modified, for example, to generate and transmit mutually recognized passwords. When the "sender" information is encrypted with this password, it can be transmitted via a communication network (eg : Internet, etc.) to transmit, and the "receiver" restores the information.

However, in the information transmission process of most conventional quantum communication methods, the encryption and authentication processes of the two communication parties usually have to be performed separately (that is, the encryption and authentication functions cannot be achieved at the same time), resulting in an increase in the number of data transmissions, which will cause "transmission efficiency is reduced." In addition to "increased communication burden", etc., it will increase the risk of "information being attacked, intercepted or tampered with". The "receiver" can also be authenticated by a "fair third party (eg, authentication server, etc.)" to authenticate the password and the "sender". However, the "receiver" and "sender" There is still a need to use traditional channels and quantum channels to transmit different information. It will also face the above-mentioned "reduction in transmission efficiency", "improvement of communication burden" and "increased risk of information attack, interception or tampering". And the "fair third party" is required to be on-line at any time. If the "fair third party" is unable to provide the service for any reason, the above certification process will not function properly, resulting in the "receiving end" and Communication between the "senders" is not possible.

In view of this, the above-mentioned conventional quantum communication method will cause "impossibility to achieve encryption and authentication functions" at the same time, and will result in "reduce transmission efficiency", "improve communication burden" and "information attack and interception". Doubts such as tampering, and more limitations and shortcomings in actual use, there are inconveniences, and further improvements are needed to enhance their practicality.

The main object of the present invention is to provide a quantum communication method capable of simultaneously providing encryption and authentication functions in a communication process to improve transmission efficiency.

A second object of the present invention is to provide a quantum communication method capable of simultaneously providing encryption and authentication functions in a communication process to reduce communication load.

The quantum communication method of the present invention is coupled to each other by a transmitting end and a receiving end, so that the transmitting end and the receiving end can communicate with each other. The method comprises the following steps: the first clear text according to the transmitting end is based on a hash The function operation generates a first hash value, and then the first plaintext and the first hash value are edited into a first album according to a merge rule, and then the first album is encrypted according to a numerical key to generate a a first ciphertext, the first ciphertext is converted into a quantum according to a base key, and the quantum is transmitted to the receiving end; and the receiving end obtains a quantum according to the base key measurement The second ciphertext, the second ciphertext is decrypted according to the numerical value key to obtain a second essay, and a second plaintext is obtained from the second essay according to the merging rule.

Preferably, the receiving end obtains a second hash value from the second series according to the combining rule, generates a third hash value according to the second plaintext and the hash function operation, and determines the third hash value and the Whether the second hash value is the same, if the determination is yes, the receiving end approves the second plaintext, and if the determination is no, the receiving end discards the second plaintext.

Preferably, if the receiving end determines that the third hash value is the same as the second hash value, the receiving end transmits a response message to the sending end, otherwise, the receiving end transmits a resending message to the sending end.

Preferably, the base key, the first ciphertext and the quantum respectively comprise n bits, and if the i-th bit of the base key is 0, the transmitting end is the i-th bit of the first ciphertext The element is converted into the i-th bit of the quantum by the Z-substrate, and the receiving end measures the i-th bit of the quantum by the Z-base; if the i-th bit of the base key is 1, the transmitting end is the first The i-th bit of the ciphertext is converted into the i-th bit of the quantum by the X-substrate, and the receiving end measures the i-th bit of the quantum by the X-base; 0≦i<n.

Preferably, the ith bit of the quantum is as follows: Wherein B _i is the i-th bit of the base key, C _i is the i-th bit of the first ciphertext and the second ciphertext, and Q _i is the i-th bit of the quantum.

Preferably, the first album has the same number of bits as the numerical key, and the transmitting end mutually exclusive or logically operates the first album and the numerical key to generate the first ciphertext. The receiving end mutually exclusive or logically operates the second ciphertext and the numerical key to generate the second essay.

Preferably, the first album has the same number of bits as the numerical key, and the transmitting end encrypts the first album and the numerical key to generate the first ciphertext, and the receiving end The second ciphertext is decrypted by the second ciphertext to generate the second essay.

Preferably, the first plaintext and the first hash value are concatenated into the first album according to the merge rule, and the second album includes the second plaintext and the second hash value, and the second hash value is based on The merge rule concatenates the second plaintext.

Preferably, the first hash value is inserted into the first plaintext according to the merge rule to form the first album, and the second album includes the second plaintext and the second hash value, and the second hash value is based on The merge rule is inserted into the second plaintext.

〔this invention〕

A‧‧‧ merger rules

C‧‧‧First ciphertext

C’‧‧‧Second ciphertext

H(‧)‧‧‧ hash function

H(m)‧‧‧ first hash value

H(m)’‧‧‧ second hash value

H(m)”‧‧‧ third hash value

K _B ‧‧‧Base Key

K _V ‧‧‧Numeric Key

M‧‧‧ first series

M’‧‧‧Second

N‧‧‧ channel

R‧‧‧ Receiver

T‧‧‧Send

S1‧‧‧Transfer steps

S2‧‧‧ receiving steps

S3‧‧‧ Certification Steps

| Q _M 〉‧‧‧ Quantum

a‧‧‧Response message

r‧‧‧Resend message

m‧‧‧First plaintext

m’‧‧‧Second plaintext

BRIEF DESCRIPTION OF THE DRAWINGS Figure 1 is a system architecture diagram of a preferred embodiment of the quantum communication method of the present invention.

Figure 2 is a flow chart showing the operation of the preferred embodiment of the quantum communication method of the present invention.

The above and other objects, features and advantages of the present invention will become more <RTIgt; """"""""""""""""""""""""""""""""""""""" Those with ordinary knowledge can understand.

The "receiver" as used throughout the present invention refers to a hardware for receiving information in a quantum communication system, and the transmitting end may include a computer and a plurality of single photon detectors, etc., and the detailed situation thereof is the present invention. Those of ordinary skill in the art will understand.

The term "coupling" as used throughout the present invention means that two devices (eg, a transmitting end and a receiving end) are connected to each other, for example, by connecting physical lines (eg, optical fibers, etc.) to each other. A carrier (e.g., photon, etc.) that can represent a qubit is transmitted, and the details thereof can be understood by those of ordinary skill in the art to which the present invention pertains.

The term "plaintext" as used throughout the text of the present invention refers to a message to be circulated between two communication devices (eg, a transmitting end and a receiving end), such as a text or video message, etc., the detailed case of which is the technology of the present invention. Those with ordinary knowledge in the field can understand.

The ciphertext of the present invention refers to the result of the encryption process between two communication devices (such as the sender and the receiver), and the detailed situation thereof is the technical field to which the present invention pertains. Those with ordinary knowledge can understand.

The "compiling text" as used throughout the text of the present invention refers to another material that has been edited by a merge rule, for example, the combination of A and B data into C data, etc. It will be understood by those of ordinary skill in the art to which the present invention pertains.

"Measurement" as used throughout the present invention refers to a process for knowing the quantum state, for example, using single photon measurement. The process is known as a process such as a quantum state, and the details thereof can be understood by those having ordinary knowledge in the technical field to which the present invention pertains.

Please refer to FIG. 1 , which is a system architecture diagram of a preferred embodiment of the quantum communication method of the present invention. The system includes a transmitting end T and a receiving end R. The transmitting end T and the receiving end R are coupled to each other for performing a quantum communication operation, so that the transmitting end T and the receiving end R can communicate with each other. The sender T and the receiver R (ie, the two parties) can share a secret information shared by a communication key such as a base key K _B and a numerical key K _V , and the communication parties can publicly agree on a merge rule A and a The information such as the hash function H(‧), the base key K _B and a numerical key K _V are available for the transmitting end T to convert a first plaintext m into a quantum | Q _M 〉 for the receiving The terminal R obtains a second plaintext m' from the quantum | Q _M 〉. In this embodiment, the transmitting end T and the receiving end R are coupled to a channel N (such as an optical fiber, etc.) as an implementation manner, and the transmitting end T is electrically connected to a polarized photon random generator by a computer. The receiving end R is electrically connected to the plurality of single photon detectors by another computer; the two computers can perform data processing functions and jointly store the array security data (ie, the base key K _B , the numerical key K _V ) and the above-mentioned merger rule A hash function H (‧), etc., so that the two computers can replace different security data in each communication process as a basis for ensuring information security, for example, according to the serial number of the security data, etc. The sequence is not limited thereto; the polarized photon random generator and the single photon detector are coupled to each other via the channel N, and the polarized photon random generator can be controlled by the computer of the transmitting terminal T, and the The first plaintext m is converted to the quantum | Q _M 〉 to transmit the quantum | Q _M 〉 to the single photon detector, and the second plaintext m′ is obtained by the computer of the receiving end R; wherein the quantum communication process in Using hardware-based device in the art having ordinary knowledge will be appreciated, this capacity is not repeated here.

Please refer to FIG. 2, which is a flowchart of the operation of the preferred embodiment of the quantum communication method of the present invention. Referring to FIG. 1 together, the preferred embodiment of the quantum communication method mainly includes a transmitting step S1 and a receiving step S2, respectively, as described later.

In the transmitting step S1, the first plaintext m is generated by the transmitting end T according to the hash function H(‧) to generate a first hash value H(m), and then the first plaintext m and the The first hash value H(m) is edited into a first album M according to the above merge rule A, and then the first album M is encrypted according to the numerical key K _V to generate a first ciphertext C, and then the first ciphertext C is generated. The first ciphertext C is converted into the quantum | Q _M 〉 according to the base key K _B , and the quantum | Q _M 〉 is transmitted to the receiving end R. In detail, the transmitting end T may use the hash function H(‧) to calculate the first plaintext m (eg, a text message represented by a binary, etc.) to generate the first hash value H(m). The first plaintext m and the first hash value H(m) comprise at least one bit, the number of the bits may be different preset values, and the definition of the hash function H(‧) may be considered as "Damgard," A design principle for "Hash functions", Advances in Cryptology: Proceedings of CRYPTO '89, Santa Barbara, California, USA, pp. 416-427, 20-24 Aug, 1989", which is understood by those of ordinary skill in the art to which the present invention pertains. I will not repeat them here. Wherein, since the first plaintext m has been converted according to the hash function H(‧), the first plaintext m is converted into the first hash value H(m), so the hash function H(‧) can be used as the The receiving end R authenticates or obtains the basis of the first plaintext m.

Then, the transmitting end T can edit the first plaintext m and the first hash value H(m) into the first album M according to the merge rule A, and make the first album M and the numerical key K _V The number of bits included is the same. For example, if the first plaintext m is 〝110〞, and the first hash value H(m) is 〝0〞, then “concatenate (||)” can be used for merging. Rule A, the first plaintext m and the first hash value H(m) are concatenated to form the first album M, such as: 〝110〞 is connected to 〞0〞 to form 〝1100〞; or, "Insert" merge rule A, inserting the first hash value H(m) into the first plaintext m to form the first album M, such as: inserting the bit 〝11〞 in the 〝110〞 〝0〞 and constitute 〝1010〞, etc., but not limited to this. The first plaintext m and the first hash value H(m) have been converted according to the merge rule A, so that the first plaintext m is dispersed in the first edit M. Therefore, the merge rule A can be As the basis for the receiving end R to authenticate or obtain the first plaintext m.

Then, the first ciphertext M is encrypted according to the numerical key K _V to generate the first ciphertext C, for example, using the first essay M and the numerical key K _{V to} perform an encryption operation, such as a logical operation ( Such as: mutual exclusion or XOR) or AES, DES, 3-DES encryption algorithm, etc., but not limited to, the first ciphertext C, the base key K _B and the quantum | Q _M 〉 respectively include n One bit, n is a positive integer. For example, if the n bits of the first ciphertext C are 〝0101〞, then the i-th (i=0~3) bits are 〝0〞, 〝1〞, respectively. , 〝0〞, 〝1〞. Wherein, since the first album M has been encrypted according to the numerical key K _V , the first album M is hidden in the first ciphertext C, and therefore, the numerical key K _V can be used as the receiving The terminal R decrypts the basis of the first album M.

Then, the transmitting end T can convert the i-th bit of the first ciphertext C according to the i-th bit of the base key K _B to form a difference that can represent the bit value of the first ciphertext C. The base value (for example, Z substrate or X substrate, etc.), and the converted base value is used as the i-th bit of the quantum | Q _M 〉. In this embodiment, the implementation of the i-th bit of the quantum | Q _M 〉 is described by the Z substrate and the X substrate, but not limited thereto, any bit value of the first ciphertext C can be represented. The different bases are included in the scope of the present disclosure, and the i-th bit of the quantum | Q _M 〉 is as shown in the following list 1: Where Q _i is the i-th bit of the quantum | Q _M 〉, B _{i is} the i-th bit of the base key K _B , and C _i is the _ith of the ciphertext (eg, the first ciphertext C) Bit, if B _i is 〝0〞, then "Q _i can use Z base {|0>, |1>} to indicate i0〞 and 〝1〞 of C _i , that is, the first ciphertext C The i-th bit is converted into the i-th bit of the quantum | Q _M 〉 by the Z-substrate, so that the receiving end R can measure the i-th bit of the quantum | Q _M 〉 by using the Z-base; otherwise, if B _i is 〝1〞, then "Q _i can use X base {|+>, |->} to indicate i0〞 and 〝1〞 of C _i , that is, the i-th bit of the first ciphertext C The X-substrate is converted into the i-th bit of the quantum | Q _M 〉, so that the receiving end R can measure the i-th bit of the quantum | Q _M 〉 by using the X-base, but not limited thereto. Wherein, since the first ciphertext C has been converted according to the base key K _B , the first ciphertext C is converted into the quantum | Q _M 〉, therefore, the base key K _B can be used as the receiving end. R decrypts the basis of the first ciphertext C.

For example, if the base key K _B , the numerical key K _V , the first plaintext m, and the first hash value H(m) are 〝0101〞, 〝0011〞, 〝110〞, and 〝0〞, respectively, The transmitting end T may first concatenate the first plaintext m and the first hash value H(m), and obtain the first album M as 〝1100〞, and then the numeric key K _V and the first series The text M performs an XOR operation, and obtains the first ciphertext C as 〝1111〞, and then converts the value of the first ciphertext C by using the base key K _B to generate the quantum | Q _M 〉 is 〝| 1>|->|1>|->〞, after that, the transmitting end T can transmit the quantum | Q _M 〉 to the receiving end R via the channel N, and the receiving end R performs the receiving step S2 .

Referring to FIGS. 1 and 2 again, in the receiving step S2, the receiving end R measures the quantum | Q _M 〉 according to the base key K _B to obtain a second ciphertext C′, and then the first The second ciphertext C' is decrypted according to the numerical value key K _V to obtain a second album M', and the second plaintext m' is obtained from the second album M' according to the merge rule A. For example, as shown in Table 1 above, the receiving end R can measure the above quantum | Q _M 〉 by using the base key K _B (eg, 〝0101〞) shared by both parties (eg: 〝|1>|->| 1>|->〞), for example, if the i-th bit of the base key is 0, the receiving end measures the i-th bit of the quantum | Q _M 〉 by the Z base; if the base key is The i bit is 1, and the receiving end measures the i-th bit of the quantum | Q _M 〉 by the X base. Further obtaining the second ciphertext C' (eg, 〝1111〞), and then decrypting the second ciphertext C′ according to the numerical key K _V shared by the two parties, for example, adopting the receiving end R and the transmitting end T agree The second ciphertext and the numerical key are decrypted, for example, by using a logical operation or a decryption algorithm corresponding to the encryption operation method, to further obtain a second album M' (eg: 〝1100〞), and then according to the “connected” or “inserted” merge rule A agreed by both the receiving end R and the transmitting end T (eg, the first plaintext m and the first hash value H(m) In the second series M', the second plaintext m' (eg: 〝110〞) is obtained, wherein an error correction code may be added during the transmission of the quantum | Q _M 〉 The bit of the quantum | Q _M 〉, for example, a classical error correction code such as a Hamming Code, or a paper such as "Phys. Rev. Lett. 78, 405-408 (1997) Quantum Error Correction and Orthogonal Geometry" The quantum error correction code, etc., but not limited thereto, to avoid noise interference, , During the addition of error correction code system known in the art may be appreciated, this capacity is not repeated here. Therefore, only the quantum | Q _M 〉 needs to be transmitted between the transmitting end T and the receiving end R, and the transmitting end T and the receiving end R can be securely mutually exchanged without providing an authentication service through the “fair third party”. Communication, compared with the conventional quantum communication method, the preferred embodiment of the quantum communication method of the present invention only needs to transmit the quantum | Q _M 〉, and does not need to use the traditional channel to transmit the authentication data, that is, the receiving end R can verify the received Whether the message is valid and whether the identity of the sender T is legal, and the functions of message encryption and source authentication are combined to achieve the functions of "improving transmission efficiency" and "reducing communication burden".

Referring to FIGS. 1 and 2, the preferred embodiment of the quantum communication method of the present invention may further include an authentication step S3 for verifying whether the second plaintext m' has been tampered with. In the authentication step S3, the receiving end R obtains a second hash value H(m)' from the second set of texts M' according to the merge rule A, according to the second plaintext m' and the hash function H(‧ Calculating to generate a third hash value H(m)", determining whether the third hash value H(m)" is the same as the second hash value H(m)', and if the determination is yes, the second plaintext is recognized m', if the judgment is no, the second plaintext m' is discarded. In detail, since the second album M' (eg: 〝1100〞) contains the second plaintext m' (eg: 〝110〞) and the second hash value H(m)' (eg: 〝0〞) Therefore, the second hash value H(m)' can be used to verify whether the second plaintext m' has been measured or tampered with. Therefore, the receiving end R may first calculate the third hash value H(m) by the second plaintext m' and the hash function H(‧), if the third hash value H(m)" and the second If the hash value H(m)' is the same, it means that the quantum | Q _M > is not measured or falsified, and the receiving end R can "accept" the second plaintext m' and transmit a response message (ack) a to the above The sending end T is used to notify the sending end T to end the communication. On the other hand, if the quantum | Q _M 〉 has been measured or tampered, it means that the third hash value H(m)” and the second hash value H(m)′ should be different, so the receiving end R can “ The second plaintext m' is discarded, and a resend message (res) r is transmitted to the transmitting end T to notify the transmitting end T to retransmit the first plaintext m. Thereby, the transmitting end T and the receiving end R can communicate with each other, and the receiving end R can verify whether the quantum | Q _M 〉 has been measured or tampered by a third party to ensure that the first plaintext m can be Transfer correctly.

Wherein, if the quantum | Q _M 〉 is measured darkly by a third party during transmission, since the third party does not know the base key K _B used in the transmission of the first plaintext m, when the third party When the first plaintext m is attempted, if the base key K _B or the numerical key K _V is incorrect, for example, if the base key K _B has a 1-bit error, the measurement result is affected, causing an avalanche effect. (avalanche effect), etc., therefore, the third party cannot pass the public inspection. Moreover, in the case where the numerical key K _V is not known, the third party cannot know the first plaintext m, and ensures that the first plaintext m does not leak.

The main features of the preferred embodiment of the quantum communication method of the present invention are as follows: since the transmitting end and the receiving end share the base key and the numerical key, and publicly agree to the merge rule and the hash function, Therefore, when the transmitting end and the receiving end want to communicate with each other, the transmitting end may generate the first hash value according to the hash function operation, and then combine the first plaintext with the first hash value according to the foregoing. The rule editing becomes the first series of texts, and then the first series is encrypted according to the numerical key to generate the first ciphertext, and then the first ciphertext is converted into the quantum according to the base key, so as to Transfer to the above receiving end. Afterwards, the receiving end may obtain the second ciphertext according to the base key, and then decrypt the second ciphertext according to the numerical key to obtain the second essay, and then according to the merging rule. The second plaintext is obtained in the second series. Therefore, only one quantum needs to be transmitted between the transmitting end and the receiving end, so that the message encryption and source authentication functions can be simultaneously performed in the communication process, and communication can be performed without providing an authentication service through an "fair third party". Further improve transmission efficiency and reduce communication burden.

Furthermore, the receiving end may further verify whether the second plaintext obtained by the receiving end has been measured or falsified, and obtain the second hash value from the second series according to the combining rule, and then according to the second plaintext and the foregoing The hash function generates the third hash value, and then determines whether the third hash value is the same as the second hash value. If the determination is yes, the receiving end approves the second plaintext, and if the determination is no, the receiving end gives up the first Second, the text can be sent to the sender to retransmit the first plaintext. In this way, the message source authentication function in the communication process can be enhanced to ensure that the first plaintext is not leaked or tampered with.

In the preferred embodiment of the quantum communication method of the present invention, the transmitting end and the receiving end share the base key and the numerical key, and publicly agree to the combining rule and the hash function, so that the transmitting end can generate the quantum according to the The quantum also has the function of message encryption and source authentication. When the quantum reaches the receiving end through a transmission process, the receiving end can obtain the message to be transmitted by the transmitting end, and confirm whether the message has been tampered with. In order to achieve the correct communication content, achieve "improving transmission efficiency", "reducing communication burden", "no need for third-party certification", "reducing channel setup cost" and "avoiding message interception or tampering".

While the invention has been described in connection with the preferred embodiments described above, it is not intended to limit the scope of the invention. The technical scope of the invention is protected, and therefore the scope of the invention is defined by the scope of the appended claims.

A‧‧‧ merger rules

C‧‧‧First ciphertext

C’‧‧‧Second ciphertext

H(‧)‧‧‧ hash function

H(m)‧‧‧ first hash value

H(m)’‧‧‧ second hash value

H(m)”‧‧‧ third hash value

K _B ‧‧‧Base Key

K _V ‧‧‧Numeric Key

M‧‧‧ first series

M’‧‧‧Second

R‧‧‧ Receiver

S1‧‧‧Transfer steps

S2‧‧‧ receiving steps

S3‧‧‧ Certification Steps

T‧‧‧Send

| Q _M 〉‧‧‧ Quantum

a‧‧‧Response message

r‧‧‧Resend message

m‧‧‧First plaintext

m’‧‧‧Second plaintext

Claims (9)

A quantum communication method is characterized in that a transmitting end and a receiving end are coupled to each other to enable the transmitting end and the receiving end to communicate with each other. The method comprises the following steps: the sending end of the first plaintext according to a hash function The operation generates a first hash value, and then edits the first plaintext and the first hash value into a first series according to a merge rule, and then encrypts the first album according to a numerical key to generate a first a ciphertext, the first ciphertext is converted into a quantum according to a base key, and the quantum is transmitted to the receiving end; and the receiving end obtains a second by measuring the quantum according to the base key. The ciphertext, the second ciphertext is decrypted according to the numerical value key to obtain a second essay, and a second plaintext is obtained from the second essay according to the merging rule. According to the quantum communication method of claim 1, wherein the receiving end obtains a second hash value from the second series according to the combining rule, and generates a third according to the second plaintext and the hash function operation. The hash value determines whether the third hash value is the same as the second hash value. If the determination is yes, the receiving end approves the second plaintext. If the determination is no, the receiving end discards the second plaintext. According to the quantum communication method of claim 2, wherein the receiving end determines that the third hash value is the same as the second hash value, the receiving end transmits a response message to the transmitting end, otherwise, the receiving end Send a resend message to the sender. The quantum communication method according to claim 1 or 2, wherein the base key, the first ciphertext, and the quantum respectively comprise n bits, and if the i-th bit of the base key is 0, The transmitting end converts the i-th bit of the first ciphertext into the i-th bit of the quantum by the Z-substrate, and the receiving end measures the i-th bit of the quantum by the Z-base; if the base key is The i bit is 1, and the transmitting end converts the i-th bit of the first ciphertext into an ith bit of the quantum by the X base, and the receiving end is based on the X base. The bottom measures the i-th bit of the quantum; 0≦i<n. According to the quantum communication method described in claim 4, wherein the ith bit of the quantum is as follows: Wherein B _i is the i-th bit of the base key, C _i is the i-th bit of the first ciphertext and the second ciphertext, and Q _i is the i-th bit of the quantum. The quantum communication method according to claim 1 or 2, wherein the first album and the numerical key include the same number of bits, and the transmitting end performs the first album and the numerical key. The first ciphertext is generated by mutual exclusion or logical operation, and the receiving end mutually exclusive or logically operates the second ciphertext and the numerical key to generate the second corpus. The quantum communication method according to claim 1 or 2, wherein the first album and the numerical key include the same number of bits, and the transmitting end performs the first album and the numerical key. The first ciphertext is generated by an encryption operation, and the receiving end decrypts the second ciphertext and the numerical key to generate the second album. According to the quantum communication method of claim 1, wherein the first plaintext and the first hash value are concatenated into the first album according to the merge rule, and the second album includes the second plaintext and one a second hash value, the second hash value concatenating the second plaintext according to the merge rule. According to the quantum communication method of claim 1, wherein the first hash value is inserted into the first plaintext according to the merge rule to form the first series. The second album includes the second plaintext and a second hash value, and the second hash value is inserted into the second plaintext according to the merge rule.