Shor's Algorithm

Shor’s Algorithm is a quantum algorithm for factoring large integers efficiently—something classical computers can only do very slowly. It works by using quantum parallelism and the Quantum Fourier Transform to find the period of a modular exponentiation function, which reveals the factors. Its efficiency threatens current cryptographic systems like RSA that rely on the hardness of factoring.