An algorithm that factorizes the product of two prime numbers.

Most of the public-key cryptography as for example RSA relies on the fact that it is as yet hard to factorize the product of two large prime numbers. Peter Shor found an efficient factorizing algorithm for quantum computers. It uses the QFT (Quantum Fourier Transform) on a periodic function to find out its period and thereby computing the factors of the product.