Quantum Information Security Protocols and Quantum Coding Theory

Abstract

Quantum computation has important impacts on information security and modern cryptography. In 1994, Shor demonstrated that the problem of finding the prim factors of an integer, and the so called "discrete logarithm problem" could be solved efficiently on a quantum computer. Quantum information can also be proved to devise unconditionally secure cryptography protocols. In this paper, we introduce the most recent research progress in quantum information security and quantum coding theory and review several quantum quantum cryptography protocols that we have proposed.