Fundamental Structure of Shor’s Quantum Algorithm for Factoring Integers

Abstract

One of the most well known mathematically hard problems in number theory is the integer factorizationproblem, roughly stated that decomposition of a composite number into its prime factors. In modern cryptography,RSA encryption algorithm whose security is based on integer factorization problem is highly practical, widespreadand up to date no classical algorithm having polynomial running time for the factorization of large numbers isknown. In 1994, Peter Shor proposed an efficient algorithm on quantum computer. In this paper, we mention aboutthe fundamentals of Shor’s quantum algorithm illustrating a concrete example.