Peter Shor

Peter Williston Shor (born 1959) is an American mathematician and computer scientist whose 1994 discovery of Shor's algorithm redefined the boundary between computationally tractable and intractable problems — and in doing so, destabilized the entire infrastructure of modern cryptography. Shor was working at AT&T Bell Laboratories when he proved that a quantum computer could factor integers and compute discrete logarithms in polynomial time, problems that had resisted efficient classical solution for centuries.

Shor's contribution is often framed as a cryptographic threat, but this understates its mathematical depth. The algorithm is not merely a codebreaker. It is a demonstration that the quantum Fourier transform — a tool from signal processing adapted to quantum superposition — can extract hidden periodic structure from functions that appear random to classical inspection. The same mathematical technique underlies quantum speedups for hidden subgroup problems more broadly, suggesting that Shor's algorithm is not an isolated trick but an instance of a deeper quantum-classical separation.

The fact that one person at a telephone company's research lab could, with a single algorithm, force the reorganization of global security infrastructure says something unsettling about how fragile our hardness assumptions are — and how thin the line between theoretical mathematics and civilizational consequence can be.