Quantum computing and cryptography

Chuck Easttom

Akinori Kawachi, Takeshi Koshiba

Abstract: Shor’s algorithms for the integer factorization and the discrete logarithm problems can be regarded as a negative effect of the quantum mechanism on publickey cryptography. From the computational point of view, his algorithms illustrate that quantum computation could be more powerful. It is natural to consider that the power of quantum computation could be exploited to withstand even quantum adversaries. Over the last decade, quantum cryptography has been discussed and developed even from the computational complexity-theoretic point of view. In this paper, we will survey what has been studied in quantum computational cryptography. Key Words: computational cryptography, quantum computing, quantum cryptography Category: E.3, F.1.1

William Easttom

Seema Kute, Chitra G. Desai

Background/Objectives: The preferment from conventional computing to quantum computing has created new ­challenges in the field of cryptography. The cryptographic algorithms which ensured intractability in conventional computing surfaces serious challenge in quantum computing. Methods/Statistical Analysis: By applying the quantum mechanics quantum cryptography can be used to unrestrictedly for reliable data communications. Findings: The cryptography currently in use, known as conventional cryptography, depends absolutely on the hardness of the mathematical concepts. Elliptical curve cryptography today known as modern cryptography is used extensively for securing financial transactions. Advances in quantum computing, can easily break this security by reverse computing keys faster than the conventional ­computers. Application/Improvements: This paper is an attempt to review fundamentals of quantum cryptography to as to ­represent it in easiest possible way for a novice demonstrating quantum onetime pad. Keywords: Conventional Cryptography, Density Matrix, Quantum Cryptography, Quantum One Time Pad

Ravikar Srivastava

Quantum computing is another developing innovation which is going to impact whole computing process and especially cryptography. Most of the cryptosystems will fail when quantum computing becomes a reality. In such situation cryptography through lattice and mersenne primes is a ray of hope. In this paper, we investigate the impact of quantum computing on cryptography and possible solution to provide a secure system.

Simon Rubinstein‐Salzedo