Elliptic curve cryptography, or how a factoring attack became the internet's key

In 1984, a pre-print from Hendrik Lenstra of the University of Amsterdam reached Neal Koblitz’s office at the University of Washington in Seattle. Lenstra had found a new algorithm for factoring large integers — the hard problem that kept RSA safe — and the key structure in his method was an…