a quantum computing algorithm for factoring integers in polynomial time, which an exponential speed-up over the best known classical algorithm. Shor’s algorithm exploits both quantum Fourier transformation and modular arithmetic in order to give a solution that is one factor of the input integer.