Concept
A nonsingular cubic curve whose points carry a group law. Elliptic curves connect ancient questions about rational solutions, nineteenth-century elliptic functions, modern number theory, and selected cryptographic systems.
Understand it in one breath
Add a point at infinity to a nonsingular cubic curve and its points form an abelian group. Rational points lead to deep questions in number theory, and modularity for semistable elliptic curves supplied the bridge to Fermat's Last Theorem. Curves over finite fields support selected key-agreement and signature systems; security depends on the curve, parameters, protocol, and implementation together.
At a glance
Curve | Application | Rank (degree of infinitude) |
|---|---|---|
y² = x³ − x | Mathematical example | 0 (only 4 points) |
y² = x³ − 25x | Example for the BSD conjecture | 1 (generates infinitely many points) |
secp256k1 (Bitcoin) | Bitcoin signatures | 256-bit key |
Curve25519 and Ed25519 families | Selected key-agreement and signature protocols | Roughly a 128-bit classical-security target |
Elliptic curves (Wiles, 1995) | Bridge to the proof of FLT | Modular forms ↔ Galois representations |
The addition operation on points forms a group structure — the difficulty of the discrete logarithm problem underpins ECC security.
Key formula
Key moments
Diophantus — an early appearance
Diophantus studied cubic equations with rational solutions, unaware that related curves would become a foundation of cryptography nearly two millennia later.
The 19th century — elliptic functions and algebraic curves
Abel, Jacobi, Weierstrass, and others developed inverse elliptic integrals and the theory of cubic curves, preparing the ground for the modern group law on their points.
Koblitz and Miller — elliptic-curve cryptography
Neal Koblitz and Victor Miller independently proposed using addition of points on elliptic curves to obtain strong security with smaller keys than RSA.
Wiles and Taylor — the bridge to Fermat
Wiles and Taylor established the modularity needed for semistable elliptic curves, completing the bridge that implied Fermat’s Last Theorem. The full modularity theorem followed through later joint work.
Bitcoin adopts secp256k1
Satoshi Nakamoto chose ECDSA over the secp256k1 elliptic curve to authorize Bitcoin transactions, bringing elliptic-curve signatures into a global payment network.
Modern applications
Wallet keys for Bitcoin and Ethereum, ECDSA signatures used on the web, end-to-end messaging cryptography, and the proof of Fermat’s Last Theorem.
Beyond MathVoyage
Loading…