Story perspectives

Shor's Algorithm Reveals Quantum Threat to RSA Encryption

4/12/2026

Summary

Story summary

In 1994, American mathematician Peter Shor proposed a quantum algorithm that could undermine major cryptography systems, signaling a threat to Rivest–Shamir–Adleman (RSA) encryption.
This milestone, known as 'Q-day,' signals quantum computing's threat to encryption, including RSA.
Quantum computers are expected to surpass classical computers in solving the mathematical problems that secure these algorithms, including integer factorization and discrete logarithm problems.
The link between Shor's algorithm and RSA's vulnerability becomes clearer.

1 of 1

Story summary

In 1994, American mathematician Peter Shor proposed a quantum algorithm that could undermine major cryptography systems, signaling a threat to Rivest–Shamir–Adleman (RSA) encryption.
This milestone, known as 'Q-day,' signals quantum computing's threat to encryption, including RSA.
Quantum computers are expected to surpass classical computers in solving the mathematical problems that secure these algorithms, including integer factorization and discrete logarithm problems.
The link between Shor's algorithm and RSA's vulnerability becomes clearer.