Quantum Cryptography

The secret of quantum cryptography and the transmission of undiscovered information has long been a goal of cryptographers. This code is destroyed after it is written, and the cryptanalyst can retrieve constantly unreadable code. Until recently, it seemed impossible to achieve this goal, but it seemed that the solution to the problem that was previously impossible has come to surface. Quantum cryptography has been a new way to build cryptography and has dug down the world of very small particles. ("Inbound" 2) Quantum cryptography is a relatively new discovery in the field of cryptography and still being tested by the government on distance and usefulness.

In this review, we will cover a wide range of topics, including the impact of the emergence of classical cryptography, quantum computers, quantum cryptography, and quantum computers on short-term and long-term bit coin security. This is a very interdisciplinary field including mathematics, computer science, physics, quantum information theory and nanotechnology. Each of these fields has a full range of research related to it. Therefore, we have made every effort to provide references for more detailed work to help readers explore more deeply.

Post quantum cryptography is a new field of cryptography that is interested in a series of algorithms, thought to be safe even with quantum computers. Do not confuse this with quantum key distribution or quantum cryptography that uses quantum mechanics to protect communications. It is based on a more complex cryptographic hash function, not prime number decomposition, but using post quantum cryptography is very important in the field of mathematical functions.

Quantum cryptography should not be confused with post quantum cryptography. The former uses quantum mechanics to encrypt things (that is, a quantum computer is needed to encrypt information). The latter refers to an algorithm that requires only one classic computer to be secure against multiple computers. Although researchers are studying this problem, at the present time the major post-quantum algorithms can actually be defeated by a sufficiently large quantum computer. First, for a permitted gate, the matrix that represents it must be singular. If matrix U is multiplied by the Hermitian matrix of the original matrix to I (identity matrix), the matrix is ​​a single matrix.