elliptic curves

elliptic curves
Tos · Public domain · source
Name	Elliptic curves
Type	Algebraic curve
Field	Algebraic geometry

elliptic curves are smooth projective algebraic curves of genus one equipped with a specified rational point. They arise in diverse contexts including Wiles's proof of Fermat's Last Theorem, the Modularity Theorem, and practical protocols such as ECC standards adopted by NIST, IETF, and commercial vendors. These objects link the work of classical figures like Bernhard Riemann, Niels Henrik Abel, Carl Gustav Jacob Jacobi, and Srinivasa Ramanujan to modern developments by Gerd Faltings, John Tate, Barry Mazur, and Andrew Wiles.

Definition and basic properties

An elliptic curve over a field K is commonly given by a smooth cubic equation in projective coordinates, typically a Weierstrass form y^2 + a1 xy + a3 y = x^3 + a2 x^2 + a4 x + a6, with coefficients in K; equivalently one uses a short Weierstrass form y^2 = x^3 + ax + b when char(K) ≠ 2,3. The discriminant Δ and j-invariant classify singular vs smooth models and isomorphism classes; these invariants appear in the work of Évariste Galois and the formulation of moduli by David Mumford and Alexander Grothendieck. Over complex numbers an elliptic curve is analytically isomorphic to C/Λ for a lattice Λ, connecting to the theory of modular functions studied by Karl Pearson and Hermann Minkowski. The duality between algebraic and analytic descriptions influenced research by André Weil and Harvard mathematicians such as John Tate.

Group law and elliptic curve arithmetic

An elliptic curve carries a natural abelian group law with the specified point as identity; geometrically the sum of three collinear points is zero. This group structure enables explicit formulas for point addition and doubling used in algorithms by Victor Miller and standards committees like NIST and IETF for key agreement and signature schemes. Efficient arithmetic employs coordinate systems such as affine, projective, Jacobian, and Montgomery coordinates developed in part by researchers at MIT and Berkeley. Scalar multiplication algorithms—double-and-add, windowed methods, Montgomery ladder—are central in protocol implementations by RSA, Sony, and Microsoft. Techniques from Hensel's lemma and Tate pairing computations connect to pairings used by teams at IBM and Certicom.

Complex and algebraic descriptions

Over C an elliptic curve is complex-analytically a torus C/Λ; the Weierstrass ℘-function and Eisenstein series provide explicit maps, developed by Karl Weierstrass and Bernhard Riemann. Algebraically, elliptic curves are proper smooth genus-one curves with a K-rational point; this perspective underpins scheme-theoretic treatments by Alexander Grothendieck in the EGA and the formulation of the moduli stack by Pierre Deligne and David Mumford. Periods, Néron models, and the theory of complex multiplication connect to work by Heegner, Kummer, and Shimura and lead to explicit class field theory results attributed to Kronecker and Hilbert.

Rational points and Mordell–Weil theorem

The Mordell–Weil theorem asserts that the group of K-rational points on an elliptic curve over a number field K is finitely generated; this theorem was proven by Louis Mordell and extended by André Weil. The rank, torsion subgroup, and conjectures of Birch and Swinnerton-Dyer govern Diophantine properties and are subjects of research by John Tate, Barry Mazur, Kolyvagin, and V. A. Kolyvagin. Techniques involve descent, Heegner point constructions by Gross and Zagier, Iwasawa theory by Kenkichi Iwasawa, and works of Gerd Faltings including his finiteness theorems. Explicit computations of ranks and rational points feature in databases and collaborations such as LMFDB and projects led by Cremona and Stefan Edixhoven.

Reduction, local properties, and Galois representations

Reduction of elliptic curves mod primes yields notions of good, multiplicative, and additive reduction analyzed by Serre and Tate; conductors and local factors appear in the study of L-functions by Atkin, Lehner, and Apostol. The action of the absolute Galois group Gal(Q̄/Q) on torsion points gives rise to l-adic Galois representations studied by Jean-Pierre Serre, Andrew Wiles, and Richard Taylor; these representations are central in proofs of modularity and reciprocity laws pursued by Breuil, Conrad, Diamond, and Taylor. Néron–Ogg–Shafarevich criteria, Fontaine's p-adic Hodge theory, and crystalline representations developed by Jean-Marc Fontaine relate local behavior to global arithmetic invariants used in the proof of the Modularity Theorem.

Applications in number theory and cryptography

Elliptic curves underpin modern results in arithmetic geometry, notably Wiles's proof of Fermat's Last Theorem via the Modularity Theorem connecting elliptic curves to modular objects studied by Atkin and Lehner. In computational number theory they enable integer factorization and primality testing methods, and in cryptography they provide discrete-logarithm-based systems standardized by NIST, integrated into protocols by IETF, and implemented by companies like RSA Laboratories, Microsoft Corporation, and Google LLC. Pairing-based cryptography originates from work by A. J. Menezes and Victor Miller and has been applied in identity-based encryption by researchers at SRI International and Stanford. Quantum algorithms by Peter Shor pose threats to current ECC, motivating post-quantum research at institutions including NIST and ETSI.

Category:Algebraic curves