Quantum Algorithms for Integer Factorization

Abstract

It is well-known that the most famous and widely used cryptographic system RSA relies its security on the intractability of the integer Factorization Problem (IFP), for which the inventor of RSA received the year 2002 Turing award, consider as the equivalent Nobel Prize in Computer Science. If IFP can be solved in polynomial-time, then RSA and many other cryptographic systems can be broken completely and efficiently.