Susan Landau
Cybersecurity Mathematician & Pioneer of Radical Solvability Algorithms
Susan Landau
Cybersecurity Mathematician & Pioneer of Radical Solvability Algorithms
Biographical Overview
Developed Landau's algorithm, the first polynomial-time test for determining whether the roots of an algebraic polynomial can be expressed using radicals. A leading mathematician and cybersecurity policy authority at Tufts University, Landau established the cryptographic imperative of end-to-end encryption for national infrastructure and privacy.
"Strong cryptography is the fundamental security mechanism for digital commerce, personal privacy, and national critical infrastructure."
— Susan Landau
Historical Context & Impact
In 1989, Susan Landau solved an open problem in Galois theory that had baffled mathematicians for more than a century. She developed an efficient polynomial-time algorithm to determine whether nested radical equations can be simplified, before pivoting to write the definitive technical defense of unbreakable consumer cryptography before Congress.