Error and noise analysis in a quantum key exchange
Abstract
Over the course of human history the idea of secure communication has motivated different fields of science and one of them reside in both Computer Science and Mathematics. Oxford's English Dictionary defines cryptography as the art or practice of writing in code or cipher; the science of encryption. From the primitive shift ciphers during the time of Caesar to the Enigma in the second world war the race of creating an unbreakable code and then trying to break it continues. With the advent of Quantum Mechanics, interest in Quantum Computers has shown the so far theoretical consequences of a true parallel machine. Many classical ciphers relay on the difficulty of the underlying mathematics. RSA cryptosystem relies on the fact that for a large enough number, it is computationally in-feasible for a classical computer to calculate its prime factors and Diffie Hellman public key exchange relies on the fact that search for a primitive root module large prime is also computationally improbable. However, this is not the case for a theoretical quantum computer. In this paper, we shall look at a proposed quantum key exchange that takes benefits of the Quantum Mechanics itself and try to solve the unaddressed details of noise-error in the process of key exchange.