MilestoneTheory & algorithmsConfirmed

Proos and Zalka detail a quantum attack on elliptic-curve keys

Jan 25, 2003

John Proos and Christof Zalka describe how to implement Shor's discrete-logarithm algorithm for elliptic curves over prime fields and estimate its quantum resources. This is an algorithm design, not a hardware attack.

Why it matters

The analysis makes the quantum threat to elliptic-curve cryptography concrete, extending resource estimates beyond RSA factoring.

John Proos · Christof Zalka

See it on the timeline

Related

• Peter Shor shows a quantum computer could factor large numbers quickly (Nov 1994)
• Google says elliptic-curve encryption could be broken with under 500,000 qubits (Mar 31, 2026)