Shor (1994/1997)

Shor's algorithm shows that integer factorization and discrete-logarithm problems can be solved in polynomial time on quantum computers. By affecting widely used systems such as RSA and elliptic-curve cryptography, this result triggered post-quantum cryptography research.