Browse Teach Curate

Shor's Algorithm: Period-Finding That Breaks RSA

Factoring reduces to order-finding; the QFT finds the period exponentially faster than any known classical method, threatening RSA and motivating post-quantum cryptography.

Dr. Harry Seldon Text

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Primary research paper.