
An elliptic curve is a smooth, projective algebraic curve of genus one with a specified base point.An elliptic curve is defined by the equation y² = x³ + ax + b. Its graph is a smooth, symmetric curve without self-intersections. On the set of its points (including the point at infinity) one can define an addition operation, turning the curve into a commutative group. This means addition follows the same laws as ordinary numbers: there is a 'zero', an inverse element, and associativity. But the geometry of addition is unusual: to add two points, we draw a secant line through them, find the third intersection with the curve, and reflect it across the x-axis. In cryptography (e.g., the Diffie–Hellman protocol on elliptic curves), security relies on the difficulty of the discrete logarithm problem: given an initial point P and an endpoint Q = n·P, computing the number n is virtually impossible.
The study of elliptic curves began with elliptic integrals in the works of Abel and Jacobi in the first half of the 19th century. The term 'elliptic' arose from their connection to computing the arc length of an ellipse. Henri Poincaré contributed to the study of algebraic curves and their groups. In 1985, Neal Koblitz and Victor Miller independently proposed using elliptic curves in cryptography, leading to the widespread ECC systems used today. The link to modular forms, established by Wiles and Taylor, resolved Fermat's Last Theorem.
The group law on an elliptic curve forms an abelian group. For a curve over a finite field F_p, this group has order about p+1, and the difficulty of the discrete logarithm problem in this group underpins cryptographic security. In protocols like ECDSA, a message is signed using a secret key—a multiplier n—and verified with the public key Q = n·P. Computing n from Q and P is the ECDLP, for which no subexponential algorithms are known in general. Additionally, elliptic curves over the rationals carry a rich structure: by the Mordell–Weil theorem the group of rational points is finitely generated, and its rank and regulator are linked to the L-function of the curve via the Birch and Swinnerton-Dyer conjecture. Thus, the mathematical lock of a smooth curve guards our digital borders.
HTTPS protocols, cryptocurrency wallets, digital signatures—anywhere a fast and secure digital lock is needed.
Perhaps the most famous elliptic curve is the one connected to Fermat's equation. Andrew Wiles proved Fermat's Last Theorem by establishing a link between elliptic curves and modular forms.
| ε | variable | ellipticity — ellipticity |
| I_xx | variable | moment of inertia about x-axis — moment of inertia kilogram metre squared |
| I_yy | variable | moment of inertia about y-axis — moment of inertia kilogram metre squared |
| I_zz | variable | moment of inertia about z-axis — moment of inertia kilogram metre squared |
| x | variable | x-coordinate of a point on the line — x coordinate metre |
| y | variable | y-coordinate of a point on the line — y coordinate metre |
| \phi | variable | angle of the normal to the line with respect to the x-axis — angle radian |
| p | variable | perpendicular distance from the origin to the line — distance metre |
| \cos | operator | computes the cosine of an angle — cosine |
| \sin | operator | computes the sine of an angle — sine |








