
In mathematics, an elliptic curve is a smooth, projective, algebraic curve of genus one, on which there is a specified point O. An elliptic curve is defined over a field K and describes points in K2, the Cartesian product of K with itself. If the field's characteristic is different from 2 and 3, then the curve can be described as a plane algebraic curve which consists of solutions (x, y) for:

(For (a, b) = (0, 0) the function is not smooth and therefore not an elliptic curve.)
for some coefficients a and b in K. The curve is required to be non-singular, which means that the curve has no cusps or self-intersections. (This is equivalent to the condition 4a3 + 27b2 ≠ 0, that is, being square-free in x.) It is always understood that the curve is really sitting in the projective plane, with the point O being the unique point at infinity. Many sources define an elliptic curve to be simply a curve given by an equation of this form. (When the coefficient field has characteristic 2 or 3, the above equation is not quite general enough to include all non-singular cubic curves; see § Elliptic curves over a general field below.)
An elliptic curve is an abelian variety – that is, it has a group law defined algebraically, with respect to which it is an abelian group – and O serves as the identity element.
If y2 = P(x), where P is any polynomial of degree three in x with no repeated roots, the solution set is a nonsingular plane curve of genus one, an elliptic curve. If P has degree four and is square-free this equation again describes a plane curve of genus one; however, it has no natural choice of identity element. More generally, any algebraic curve of genus one, for example the intersection of two quadric surfaces embedded in three-dimensional projective space, is called an elliptic curve, provided that it is equipped with a marked point to act as the identity.
Using the theory of elliptic functions, it can be shown that elliptic curves defined over the complex numbers correspond to embeddings of the torus into the complex projective plane. The torus is also an abelian group, and this correspondence is also a group isomorphism.
Elliptic curves are especially important in number theory, and constitute a major area of current research; for example, they were used in Andrew Wiles's proof of Fermat's Last Theorem. They also find applications in elliptic curve cryptography (ECC) and integer factorization.
An elliptic curve is not an ellipse in the sense of a projective conic, which has genus zero: see elliptic integral for the origin of the term. However, there is a natural representation of real elliptic curves with shape invariant j ≥ 1 as ellipses in the hyperbolic plane . Specifically, the intersections of the Minkowski hyperboloid with quadric surfaces characterized by a certain constant-angle property produce the Steiner ellipses in (generated by orientation-preserving collineations). Further, the orthogonal trajectories of these ellipses comprise the elliptic curves with j ≤ 1, and any ellipse in described as a locus relative to two foci is uniquely the elliptic curve sum of two Steiner ellipses, obtained by adding the pairs of intersections on each orthogonal trajectory. Here, the vertex of the hyperboloid serves as the identity on each trajectory curve.
Topologically, a complex elliptic curve is a torus, while a complex ellipse is a sphere.
Elliptic curves over the real numbers
Although the formal definition of an elliptic curve requires some background in algebraic geometry, it is possible to describe some features of elliptic curves over the real numbers using only introductory algebra and geometry.
In this context, an elliptic curve is a plane curve defined by an equation of the form
after a linear change of variables (a and b are real numbers). This type of equation is called a Weierstrass equation, and said to be in Weierstrass form, or Weierstrass normal form.
The definition of elliptic curve also requires that the curve be non-singular. Geometrically, this means that the graph has no cusps, self-intersections, or isolated points. Algebraically, this holds if and only if the discriminant, , is not equal to zero.
The discriminant is zero when .
(Although the factor −16 is irrelevant to whether or not the curve is non-singular, this definition of the discriminant is useful in a more advanced study of elliptic curves.)
The real graph of a non-singular curve has two components if its discriminant is positive, and one component if it is negative. For example, in the graphs shown in figure to the right, the discriminant in the first case is 64, and in the second case is −368. Following the convention at Conic section#Discriminant, elliptic curves require that the discriminant is negative.
The group law
When working in the projective plane, the equation in homogeneous coordinates becomes
This equation is not defined on the line at infinity, but we can multiply by to get one that is:
This resulting equation is defined on the whole projective plane, and the curve it defines projects onto the elliptic curve of interest. To find its intersection with the line at infinity, we can just posit . This implies
, which in a field means
.
on the other hand can take any value, and thus all triplets
satisfy the equation. In projective geometry this set is simply the point
, which is thus the unique intersection of the curve with the line at infinity.
Since the curve is smooth, hence continuous, it can be shown that this point at infinity is the identity element of a group structure whose operation is geometrically described as follows:
Since the curve is symmetric about the x axis, given any point P, we can take −P to be the point opposite it. We then have , as
lies on the XZ plane, so that
is also the symmetrical of
about the origin, and thus represents the same projective point.
If P and Q are two points on the curve, then we can uniquely describe a third point P + Q in the following way. First, draw the line that intersects P and Q. This will generally intersect the cubic at a third point, R. We then take P + Q to be −R, the point opposite R.
This definition for addition works except in a few special cases related to the point at infinity and intersection multiplicity. The first is when one of the points is O. Here, we define P + O = P = O + P, making O the identity of the group. If P = Q, we only have one point, thus we cannot define the line between them. In this case, we use the tangent line to the curve at this point as our line. In most cases, the tangent will intersect a second point R, and we can take its opposite. If P and Q are opposites of each other, we define P + Q = O. Lastly, if P is an inflection point (a point where the concavity of the curve changes), we take R to be P itself, and P + P is simply the point opposite itself, i.e. itself.
Let K be a field over which the curve is defined (that is, the coefficients of the defining equation or equations of the curve are in K) and denote the curve by E. Then the K-rational points of E are the points on E whose coordinates all lie in K, including the point at infinity. The set of K-rational points is denoted by E(K). E(K) is a group, because properties of polynomial equations show that if P is in E(K), then −P is also in E(K), and if two of P, Q, R are in E(K), then so is the third. Additionally, if K is a subfield of L, then E(K) is a subgroup of E(L).
Algebraic interpretation
The above groups can be described algebraically as well as geometrically. Given the curve y2 = x3 + bx + c over the field K (whose characteristic we assume to be neither 2 nor 3), and points P = (xP, yP) and Q = (xQ, yQ) on the curve, assume first that xP ≠ xQ (case 1). Let y = sx + d be the equation of the line that intersects P and Q, which has the following slope:
The line equation and the curve equation intersect at the points xP, xQ, and xR, so the equations have identical y values at these values.
which is equivalent to
Since xP, xQ, and xR are solutions, this equation has its roots at exactly the same x values as
and because both equations are cubics, they must be the same polynomial up to a scalar. Then equating the coefficients of x2 in both equations
and solving for the unknown xR,
yR follows from the line equation
and this is an element of K, because s is.
If xP = xQ, then there are two options: if yP = −yQ (case 3), including the case where yP = yQ = 0 (case 4), then the sum is defined as 0; thus, the inverse of each point on the curve is found by reflecting it across the x axis.
If yP = yQ ≠ 0, then Q = P and R = (xR, yR) = −(P + P) = −2P = −2Q (case 2 using P as R). The slope is given by the tangent to the curve at (xP, yP).
A more general expression for that works in both case 1 and case 2 is
where equality to yP − yQ/xP − xQ relies on P and Q obeying y2 = x3 + bx + c.
Non-Weierstrass curves
For the curve y2 = x3 + ax2 + bx + c (the general form of an elliptic curve with characteristic 3), the formulas are similar, with s = xP2 + xP xQ + xQ2 + axP + axQ + b/yP + yQ and xR = s2 − a − xP − xQ.
For a general cubic curve not in Weierstrass normal form, we can still define a group structure by designating one of its nine inflection points as the identity O. In the projective plane, each line will intersect a cubic at three points when accounting for multiplicity. For a point P, −P is defined as the unique third point on the line passing through O and P. Then, for any P and Q, P + Q is defined as −R where R is the unique third point on the line containing P and Q.
For an example of the group law over a non-Weierstrass curve, see Hessian curves.
Elliptic curves over the rational numbers
A curve E defined over the field of rational numbers is also defined over the field of real numbers. Therefore, the law of addition (of points with real coordinates) by the tangent and secant method can be applied to E. The explicit formulae show that the sum of two points P and Q with rational coordinates has again rational coordinates, since the line joining P and Q has rational coefficients. This way, one shows that the set of rational points of E forms a subgroup of the group of real points of E.
Integral points
This section is concerned with points P = (x, y) of E such that x is an integer.
For example, the equation y2 = x3 + 17 has eight integral solutions with y > 0:
- (x, y) = (−2, 3), (−1, 4), (2, 5), (4, 9), (8, 23), (43, 282), (52, 375), (5234, 378661).
As another example, Ljunggren's equation, a curve whose Weierstrass form is y2 = x3 − 2x, has only four solutions with y ≥ 0 :
- (x, y) = (0, 0), (−1, 1), (2, 2), (338, 6214).
The structure of rational points
Rational points can be constructed by the method of tangents and secants detailed above, starting with a finite number of rational points. More precisely the Mordell–Weil theorem states that the group E(Q) is a finitely generated (abelian) group. By the fundamental theorem of finitely generated abelian groups it is therefore a finite direct sum of copies of Z and finite cyclic groups.
The proof of the theorem involves two parts. The first part shows that for any integer m > 1, the quotient group E(Q)/mE(Q) is finite (this is the weak Mordell–Weil theorem). Second, introducing a height function h on the rational points E(Q) defined by h(P0) = 0 and h(P) = log max(|p|, |q|) if P (unequal to the point at infinity P0) has as abscissa the rational number x = p/q (with coprime p and q). This height function h has the property that h(mP) grows roughly like the square of m. Moreover, only finitely many rational points with height smaller than any constant exist on E.
The proof of the theorem is thus a variant of the method of infinite descent and relies on the repeated application of Euclidean divisions on E: let P ∈ E(Q) be a rational point on the curve, writing P as the sum 2P1 + Q1 where Q1 is a fixed representant of P in E(Q)/2E(Q), the height of P1 is about 1/4 of the one of P (more generally, replacing 2 by any m > 1, and 1/4 by 1/m2). Redoing the same with P1, that is to say P1 = 2P2 + Q2, then P2 = 2P3 + Q3, etc. finally expresses P as an integral linear combination of points Qi and of points whose height is bounded by a fixed constant chosen in advance: by the weak Mordell–Weil theorem and the second property of the height function P is thus expressed as an integral linear combination of a finite number of fixed points.
The theorem however doesn't provide a method to determine any representatives of E(Q)/mE(Q).
The rank of E(Q), that is the number of copies of Z in E(Q) or, equivalently, the number of independent points of infinite order, is called the rank of E. The Birch and Swinnerton-Dyer conjecture is concerned with determining the rank. One conjectures that it can be arbitrarily large, even if only examples with relatively small rank are known. The elliptic curve with the currently largest exactly-known rank is
- y2 + xy + y = x3 − x2 − 244537673336319601463803487168961769270757573821859853707x + 961710182053183034546222979258806817743270682028964434238957830989898438151121499931
It has rank 20, found by Noam Elkies and Zev Klagsbrun in 2020. Curves of rank higher than 20 have been known since 1994, with lower bounds on their ranks ranging from 21 to 29, but their exact ranks are not known and in particular it is not proven which of them have higher rank than the others or which is the true "current champion".
As for the groups constituting the torsion subgroup of E(Q), the following is known: the torsion subgroup of E(Q) is one of the 15 following groups (a theorem due to Barry Mazur): Z/NZ for N = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, or 12, or Z/2Z × Z/2NZ with N = 1, 2, 3, 4. Examples for every case are known. Moreover, elliptic curves whose Mordell–Weil groups over Q have the same torsion groups belong to a parametrized family.
The Birch and Swinnerton-Dyer conjecture
The Birch and Swinnerton-Dyer conjecture (BSD) is one of the Millennium problems of the Clay Mathematics Institute. The conjecture relies on analytic and arithmetic objects defined by the elliptic curve in question.
At the analytic side, an important ingredient is a function of a complex variable, L, the Hasse–Weil zeta function of E over Q. This function is a variant of the Riemann zeta function and Dirichlet L-functions. It is defined as an Euler product, with one factor for every prime number p.
For a curve E over Q given by a minimal equation
with integral coefficients , reducing the coefficients modulo p defines an elliptic curve over the finite field Fp (except for a finite number of primes p, where the reduced curve has a singularity and thus fails to be elliptic, in which case E is said to be of bad reduction at p).
The zeta function of an elliptic curve over a finite field Fp is, in some sense, a generating function assembling the information of the number of points of E with values in the finite field extensions Fpn of Fp. It is given by
The interior sum of the exponential resembles the development of the logarithm and, in fact, the so-defined zeta function is a rational function in T:
where the 'trace of Frobenius' term is defined to be the difference between the 'expected' number
and the number of points on the elliptic curve
over
, viz.
or equivalently,
.
We may define the same quantities and functions over an arbitrary finite field of characteristic , with
replacing
everywhere.
The L-function of E over Q is then defined by collecting this information together, for all primes p. It is defined by
where N is the conductor of E, i.e. the product of primes with bad reduction ), in which case ap is defined differently from the method above: see Silverman (1986) below.
For example has bad reduction at 17, because
has
.
This product converges for Re(s) > 3/2 only. Hasse's conjecture affirms that the L-function admits an analytic continuation to the whole complex plane and satisfies a functional equation relating, for any s, L(E, s) to L(E, 2 − s). In 1999 this was shown to be a consequence of the proof of the Shimura–Taniyama–Weil conjecture, which asserts that every elliptic curve over Q is a modular curve, which implies that its L-function is the L-function of a modular form whose analytic continuation is known. One can therefore speak about the values of L(E, s) at any complex number s.
At s=1 (the conductor product can be discarded as it is finite), the L-function becomes
The Birch and Swinnerton-Dyer conjecture relates the arithmetic of the curve to the behaviour of this L-function at s = 1. It affirms that the vanishing order of the L-function at s = 1 equals the rank of E and predicts the leading term of the Laurent series of L(E, s) at that point in terms of several quantities attached to the elliptic curve.
Much like the Riemann hypothesis, the truth of the BSD conjecture would have multiple consequences, including the following two:
- A congruent number is defined as an odd square-free integer n which is the area of a right triangle with rational side lengths. It is known that n is a congruent number if and only if the elliptic curve
has a rational point of infinite order; assuming BSD, this is equivalent to its L-function having a zero at s = 1. Tunnell has shown a related result: assuming BSD, n is a congruent number if and only if the number of triplets of integers (x, y, z) satisfying
is twice the number of triples satisfying
. The interest in this statement is that the condition is easy to check.
- In a different direction, certain analytic methods allow for an estimation of the order of zero in the center of the critical strip for certain L-functions. Admitting BSD, these estimations correspond to information about the rank of families of the corresponding elliptic curves. For example: assuming the generalized Riemann hypothesis and BSD, the average rank of curves given by
is smaller than 2.
Elliptic curves over finite fields
Let K = Fq be the finite field with q elements and E an elliptic curve defined over K. While the precise number of rational points of an elliptic curve E over K is in general difficult to compute, Hasse's theorem on elliptic curves gives the following inequality:
In other words, the number of points on the curve grows proportionally to the number of elements in the field. This fact can be understood and proven with the help of some general theory; see local zeta function and étale cohomology for example.
The set of points E(Fq) is a finite abelian group. It is always cyclic or the product of two cyclic groups. For example, the curve defined by
over F71 has 72 points (71 affine points including (0,0) and one point at infinity) over this field, whose group structure is given by Z/2Z × Z/36Z. The number of points on a specific curve can be computed with Schoof's algorithm.
Studying the curve over the field extensions of Fq is facilitated by the introduction of the local zeta function of E over Fq, defined by a generating series (also see above)
where the field Kn is the (unique up to isomorphism) extension of K = Fq of degree n (that is, ).
The zeta function is a rational function in T. To see this, consider the integer such that
There is a complex number such that
where is the complex conjugate, and so we have
We choose so that its absolute value is
, that is
, and that
. Note that
.
can then be used in the local zeta function as its values when raised to the various powers of n can be said to reasonably approximate the behaviour of
, in that
Using the Taylor series for the natural logarithm,
Then , so finally
For example, the zeta function of E : y2 + y = x3 over the field F2 is given by
which follows from:
as , then
, so
.
The functional equation is
As we are only interested in the behaviour of , we can use a reduced zeta function
and so
which leads directly to the local L-functions
The Sato–Tate conjecture is a statement about how the error term in Hasse's theorem varies with the different primes q, if an elliptic curve E over Q is reduced modulo q. It was proven (for almost all such curves) in 2006 due to the results of Taylor, Harris and Shepherd-Barron, and says that the error terms are equidistributed.
Elliptic curves over finite fields are notably applied in cryptography and for the factorization of large integers. These algorithms often make use of the group structure on the points of E. Algorithms that are applicable to general groups, for example the group of invertible elements in finite fields, F*q, can thus be applied to the group of points on an elliptic curve. For example, the discrete logarithm is such an algorithm. The interest in this is that choosing an elliptic curve allows for more flexibility than choosing q (and thus the group of units in Fq). Also, the group structure of elliptic curves is generally more complicated.
Elliptic curves over a general field
Elliptic curves can be defined over any field K; the formal definition of an elliptic curve is a non-singular projective algebraic curve over K with genus 1 and endowed with a distinguished point defined over K.
If the characteristic of K is neither 2 nor 3, then every elliptic curve over K can be written in the form
after a linear change of variables. Here p and q are elements of K such that the right hand side polynomial x3 − px − q does not have any double roots. If the characteristic is 2 or 3, then more terms need to be kept: in characteristic 3, the most general equation is of the form
for arbitrary constants b2, b4, b6 such that the polynomial on the right-hand side has distinct roots (the notation is chosen for historical reasons). In characteristic 2, even this much is not possible, and the most general equation is
provided that the variety it defines is non-singular. If characteristic were not an obstruction, each equation would reduce to the previous ones by a suitable linear change of variables.
One typically takes the curve to be the set of all points (x,y) which satisfy the above equation and such that both x and y are elements of the algebraic closure of K. Points of the curve whose coordinates both belong to K are called K-rational points.
Many of the preceding results remain valid when the field of definition of E is a number field K, that is to say, a finite field extension of Q. In particular, the group E(K) of K-rational points of an elliptic curve E defined over K is finitely generated, which generalizes the Mordell–Weil theorem above. A theorem due to Loïc Merel shows that for a given integer d, there are (up to isomorphism) only finitely many groups that can occur as the torsion groups of E(K) for an elliptic curve defined over a number field K of degree d. More precisely, there is a number B(d) such that for any elliptic curve E defined over a number field K of degree d, any torsion point of E(K) is of order less than B(d). The theorem is effective: for d > 1, if a torsion point is of order p, with p prime, then
As for the integral points, Siegel's theorem generalizes to the following: Let E be an elliptic curve defined over a number field K, x and y the Weierstrass coordinates. Then there are only finitely many points of E(K) whose x-coordinate is in the ring of integers OK.
The properties of the Hasse–Weil zeta function and the Birch and Swinnerton-Dyer conjecture can also be extended to this more general situation.
Elliptic curves over the complex numbers
The formulation of elliptic curves as the embedding of a torus in the complex projective plane follows naturally from a curious property of Weierstrass's elliptic functions. These functions and their first derivative are related by the formula
Here, g2 and g3 are constants; ℘(z) is the Weierstrass elliptic function and ℘′(z) its derivative. It should be clear that this relation is in the form of an elliptic curve (over the complex numbers). The Weierstrass functions are doubly periodic; that is, they are periodic with respect to a lattice Λ; in essence, the Weierstrass functions are naturally defined on a torus T = C/Λ. This torus may be embedded in the complex projective plane by means of the map
This map is a group isomorphism of the torus (considered with its natural group structure) with the chord-and-tangent group law on the cubic curve which is the image of this map. It is also an isomorphism of Riemann surfaces from the torus to the cubic curve, so topologically, an elliptic curve is a torus. If the lattice Λ is related by multiplication by a non-zero complex number c to a lattice cΛ, then the corresponding curves are isomorphic. Isomorphism classes of elliptic curves are specified by the j-invariant.
The isomorphism classes can be understood in a simpler way as well. The constants g2 and g3, called the modular invariants, are uniquely determined by the lattice, that is, by the structure of the torus. However, all real polynomials factorize completely into linear factors over the complex numbers, since the field of complex numbers is the algebraic closure of the reals. So, the elliptic curve may be written as
One finds that
and
with j-invariant j(τ) and λ(τ) is sometimes called the modular lambda function. For example, let τ = 2i, then λ(2i) = (−1 + √2)4 which implies g′2, g′3, and therefore g′23
− 27g′32
of the formula above are all algebraic numbers if τ involves an imaginary quadratic field. In fact, it yields the integer j(2i) = 663 = 287496.
In contrast, the modular discriminant
is generally a transcendental number. In particular, the value of the Dedekind eta function η(2i) is
Note that the uniformization theorem implies that every compact Riemann surface of genus one can be represented as a torus. This also allows an easy understanding of the torsion points on an elliptic curve: if the lattice Λ is spanned by the fundamental periods ω1 and ω2, then the n-torsion points are the (equivalence classes of) points of the form
for integers a and b in the range 0 ≤ (a, b) < n.
If
is an elliptic curve over the complex numbers and
then a pair of fundamental periods of E can be calculated very rapidly by
M(w, z) is the arithmetic–geometric mean of w and z. At each step of the arithmetic–geometric mean iteration, the signs of zn arising from the ambiguity of geometric mean iterations are chosen such that |wn − zn| ≤ |wn + zn| where wn and zn denote the individual arithmetic mean and geometric mean iterations of w and z, respectively. When |wn − zn| = |wn + zn|, there is an additional condition that Im(zn/wn) > 0.
Over the complex numbers, every elliptic curve has nine inflection points. Every line through two of these points also passes through a third inflection point; the nine points and 12 lines formed in this way form a realization of the Hesse configuration.
The dual isogeny
Given an isogeny
of elliptic curves of degree , the dual isogeny is an isogeny
of the same degree such that
Here denotes the multiplication-by-
isogeny
which has degree
Construction of the dual isogeny
Often only the existence of a dual isogeny is needed, but it can be explicitly given as the composition
where is the group of divisors of degree 0. To do this, we need maps
given by
where
is the neutral point of
and
given by
To see that , note that the original isogeny
can be written as a composite
and that since is finite of degree
,
is multiplication by
on
Alternatively, we can use the smaller Picard group , a quotient of
The map
descends to an isomorphism,
The dual isogeny is
Note that the relation also implies the conjugate relation
Indeed, let
Then
But
is surjective, so we must have
Algorithms that use elliptic curves
Elliptic curves over finite fields are used in some cryptographic applications as well as for integer factorization. Typically, the general idea in these applications is that a known algorithm which makes use of certain finite groups is rewritten to use the groups of rational points of elliptic curves. For more see also:
- Elliptic curve cryptography
- Elliptic-curve Diffie–Hellman key exchange (ECDH)
- Supersingular isogeny key exchange
- Elliptic curve digital signature algorithm (ECDSA)
- EdDSA digital signature algorithm
- Dual EC DRBG random number generator
- Lenstra elliptic-curve factorization
- Elliptic curve primality proving
Alternative representations of elliptic curves
- Hessian curve
- Edwards curve
- Twisted curve
- Twisted Hessian curve
- Twisted Edwards curve
- Doubling-oriented Doche–Icart–Kohel curve
- Tripling-oriented Doche–Icart–Kohel curve
- Jacobian curve
- Montgomery curve
See also
- Arithmetic dynamics
- Elliptic algebra
- Elliptic surface
- Comparison of computer algebra systems
- Isogeny
- j-line
- Level structure (algebraic geometry)
- Modularity theorem
- Moduli stack of elliptic curves
- Nagell–Lutz theorem
- Riemann–Hurwitz formula
- Wiles's proof of Fermat's Last Theorem
Notes
- Sarli, J. (2012). "Conics in the hyperbolic plane intrinsic to the collineation group". J. Geom. 103: 131–148. doi:10.1007/s00022-012-0115-5. S2CID 119588289.
- Silverman 1986, III.1 Weierstrass Equations (p.45)
- T. Nagell, L'analyse indéterminée de degré supérieur, Mémorial des sciences mathématiques 39, Paris, Gauthier-Villars, 1929, pp. 56–59.
- OEIS: https://oeis.org/A029728
- Siksek, Samir (1995), Descents on Curves of Genus 1 (Ph.D. thesis), University of Exeter, pp. 16–17, hdl:10871/8323.
- Silverman 1986, Theorem 4.1
- Silverman 1986, pp. 199–205
- See also Cassels, J. W. S. (1986). "Mordell's Finite Basis Theorem Revisited". Mathematical Proceedings of the Cambridge Philosophical Society. 100 (1): 31–41. Bibcode:1986MPCPS.100...31C. doi:10.1017/S0305004100065841. and the comment of A. Weil on the genesis of his work: A. Weil, Collected Papers, vol. 1, 520–521.
- Dujella, Andrej. "History of elliptic curves rank records". University of Zagreb.
- Silverman 1986, Theorem 7.5
- Silverman 1986, Remark 7.8 in Ch. VIII
- The definition is formal, the exponential of this power series without constant term denotes the usual development.
- see for example Silverman, Joseph H. (2006). "An Introduction to the Theory of Elliptic Curves" (PDF). Summer School on Computational Number Theory and Applications to Cryptography. University of Wyoming.
- "LMFDB - Bad reduction of an elliptic curve at a prime (Reviewed)".
- Koblitz 1993
- Heath-Brown, D. R. (2004). "The Average Analytic Rank of Elliptic Curves". Duke Mathematical Journal. 122 (3): 591–623. arXiv:math/0305114. doi:10.1215/S0012-7094-04-12235-3. S2CID 15216987.
- See Koblitz 1994, p. 158
- Koblitz 1994, p. 160
- Harris, M.; Shepherd-Barron, N.; Taylor, R. (2010). "A family of Calabi–Yau varieties and potential automorphy". Annals of Mathematics. 171 (2): 779–813. doi:10.4007/annals.2010.171.779.
- Merel, L. (1996). "Bornes pour la torsion des courbes elliptiques sur les corps de nombres". Inventiones Mathematicae (in French). 124 (1–3): 437–449. Bibcode:1996InMat.124..437M. doi:10.1007/s002220050059. S2CID 3590991. Zbl 0936.11037.
- Wing Tat Chow, Rudolf (2018). "The Arithmetic-Geometric Mean and Periods of Curves of Genus 1 and 2" (PDF). White Rose eTheses Online. p. 12.
References
Serge Lang, in the introduction to the book cited below, stated that "It is possible to write endlessly on elliptic curves. (This is not a threat.)" The following short list is thus at best a guide to the vast expository literature available on the theoretical, algorithmic, and cryptographic aspects of elliptic curves.
- Ian Blake; Gadiel Seroussi; Nigel Smart (2000). Elliptic Curves in Cryptography. LMS Lecture Notes. Cambridge University Press. ISBN 0-521-65374-6.
- Brown, Ezra (2000). "Three Fermat Trails to Elliptic Curves". The College Mathematics Journal. 31 (3): 162–172. doi:10.1080/07468342.2000.11974137. S2CID 5591395., winner of the MAA writing prize the George Pólya Award
- Richard Crandall; Carl Pomerance (2001). "Chapter 7: Elliptic Curve Arithmetic". Prime Numbers: A Computational Perspective (1st ed.). Springer-Verlag. pp. 285–352. ISBN 0-387-94777-9.
- Cremona, John (1997). Algorithms for Modular Elliptic Curves (2nd ed.). Cambridge University Press. ISBN 0-521-59820-6.
- Darrel Hankerson, Alfred Menezes and Scott Vanstone (2004). Guide to Elliptic Curve Cryptography. Springer. ISBN 0-387-95273-X.
- Hardy, G. H.; Wright, E. M. (2008) [1938]. An Introduction to the Theory of Numbers. Revised by D. R. Heath-Brown and J. H. Silverman. Foreword by Andrew Wiles. (6th ed.). Oxford: Oxford University Press. ISBN 978-0-19-921986-5. MR 2445243. Zbl 1159.11001. Chapter XXV
- Hellegouarch, Yves (2001). Invitation aux mathématiques de Fermat-Wiles. Paris: Dunod. ISBN 978-2-10-005508-1.
- Husemöller, Dale (2004). Elliptic Curves. Graduate Texts in Mathematics. Vol. 111 (2nd ed.). Springer. ISBN 0-387-95490-2.
- Kenneth Ireland; Michael I. Rosen (1998). "Chapters 18 and 19". A Classical Introduction to Modern Number Theory. Graduate Texts in Mathematics. Vol. 84 (2nd revised ed.). Springer. ISBN 0-387-97329-X.
- Knapp, Anthony W. (2018) [1992]. Elliptic Curves. Mathematical Notes. Vol. 40. Princeton University Press. ISBN 9780691186900.
- Koblitz, Neal (1993). Introduction to Elliptic Curves and Modular Forms. Graduate Texts in Mathematics. Vol. 97 (2nd ed.). Springer-Verlag. ISBN 0-387-97966-2.
- Koblitz, Neal (1994). "Chapter 6". A Course in Number Theory and Cryptography. Graduate Texts in Mathematics. Vol. 114 (2nd ed.). Springer-Verlag. ISBN 0-387-94293-9.
- Serge Lang (1978). Elliptic curves: Diophantine analysis. Grundlehren der mathematischen Wissenschaften. Vol. 231. Springer-Verlag. ISBN 3-540-08489-4.
- Henry McKean; Victor Moll (1999). Elliptic curves: function theory, geometry and arithmetic. Cambridge University Press. ISBN 0-521-65817-9.
- Ivan Niven; Herbert S. Zuckerman; Hugh Montgomery (1991). "Section 5.7". An introduction to the theory of numbers (5th ed.). John Wiley. ISBN 0-471-54600-3.
- Silverman, Joseph H. (1986). The Arithmetic of Elliptic Curves. Graduate Texts in Mathematics. Vol. 106. Springer-Verlag. ISBN 0-387-96203-4.
- Joseph H. Silverman (1994). Advanced Topics in the Arithmetic of Elliptic Curves. Graduate Texts in Mathematics. Vol. 151. Springer-Verlag. ISBN 0-387-94328-5.
- Joseph H. Silverman; John Tate (1992). Rational Points on Elliptic Curves. Springer-Verlag. ISBN 0-387-97825-9.
- John Tate (1974). "The arithmetic of elliptic curves". Inventiones Mathematicae. 23 (3–4): 179–206. Bibcode:1974InMat..23..179T. doi:10.1007/BF01389745. S2CID 120008651.
- Lawrence Washington (2003). Elliptic Curves: Number Theory and Cryptography. Chapman & Hall/CRC. ISBN 1-58488-365-0.
External links
- LMFDB: Database of Elliptic Curves over Q
- "Elliptic curve", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
- Weisstein, Eric W. "Elliptic Curves". MathWorld.
- The Arithmetic of elliptic curves from PlanetMath
- Interactive elliptic curve over R and over Zp – web application that requires HTML5 capable browser.
This article incorporates material from Isogeny on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.
In mathematics an elliptic curve is a smooth projective algebraic curve of genus one on which there is a specified point O An elliptic curve is defined over a field K and describes points in K2 the Cartesian product of K with itself If the field s characteristic is different from 2 and 3 then the curve can be described as a plane algebraic curve which consists of solutions x y for A catalog of elliptic curves The region shown is x y 3 3 For a b 0 0 the function is not smooth and therefore not an elliptic curve y2 x3 ax b displaystyle y 2 x 3 ax b for some coefficients a and b in K The curve is required to be non singular which means that the curve has no cusps or self intersections This is equivalent to the condition 4a3 27b2 0 that is being square free in x It is always understood that the curve is really sitting in the projective plane with the point O being the unique point at infinity Many sources define an elliptic curve to be simply a curve given by an equation of this form When the coefficient field has characteristic 2 or 3 the above equation is not quite general enough to include all non singular cubic curves see Elliptic curves over a general field below An elliptic curve is an abelian variety that is it has a group law defined algebraically with respect to which it is an abelian group and O serves as the identity element If y2 P x where P is any polynomial of degree three in x with no repeated roots the solution set is a nonsingular plane curve of genus one an elliptic curve If P has degree four and is square free this equation again describes a plane curve of genus one however it has no natural choice of identity element More generally any algebraic curve of genus one for example the intersection of two quadric surfaces embedded in three dimensional projective space is called an elliptic curve provided that it is equipped with a marked point to act as the identity Using the theory of elliptic functions it can be shown that elliptic curves defined over the complex numbers correspond to embeddings of the torus into the complex projective plane The torus is also an abelian group and this correspondence is also a group isomorphism Elliptic curves are especially important in number theory and constitute a major area of current research for example they were used in Andrew Wiles s proof of Fermat s Last Theorem They also find applications in elliptic curve cryptography ECC and integer factorization An elliptic curve is not an ellipse in the sense of a projective conic which has genus zero see elliptic integral for the origin of the term However there is a natural representation of real elliptic curves with shape invariant j 1 as ellipses in the hyperbolic plane H2 displaystyle mathbb H 2 Specifically the intersections of the Minkowski hyperboloid with quadric surfaces characterized by a certain constant angle property produce the Steiner ellipses in H2 displaystyle mathbb H 2 generated by orientation preserving collineations Further the orthogonal trajectories of these ellipses comprise the elliptic curves with j 1 and any ellipse in H2 displaystyle mathbb H 2 described as a locus relative to two foci is uniquely the elliptic curve sum of two Steiner ellipses obtained by adding the pairs of intersections on each orthogonal trajectory Here the vertex of the hyperboloid serves as the identity on each trajectory curve Topologically a complex elliptic curve is a torus while a complex ellipse is a sphere Elliptic curves over the real numbersGraphs of curves y2 x3 x and y2 x3 x 1 Although the formal definition of an elliptic curve requires some background in algebraic geometry it is possible to describe some features of elliptic curves over the real numbers using only introductory algebra and geometry In this context an elliptic curve is a plane curve defined by an equation of the form y2 x3 ax b displaystyle y 2 x 3 ax b after a linear change of variables a and b are real numbers This type of equation is called a Weierstrass equation and said to be in Weierstrass form or Weierstrass normal form The definition of elliptic curve also requires that the curve be non singular Geometrically this means that the graph has no cusps self intersections or isolated points Algebraically this holds if and only if the discriminant D displaystyle Delta is not equal to zero D 16 4a3 27b2 0 displaystyle Delta 16 left 4a 3 27b 2 right neq 0 The discriminant is zero when a 3k2 b 2k3 displaystyle a 3k 2 b 2k 3 Although the factor 16 is irrelevant to whether or not the curve is non singular this definition of the discriminant is useful in a more advanced study of elliptic curves The real graph of a non singular curve has two components if its discriminant is positive and one component if it is negative For example in the graphs shown in figure to the right the discriminant in the first case is 64 and in the second case is 368 Following the convention at Conic section Discriminant elliptic curves require that the discriminant is negative The group lawWhen working in the projective plane the equation in homogeneous coordinates becomes Y2Z2 X3Z3 aXZ b displaystyle frac Y 2 Z 2 frac X 3 Z 3 a frac X Z b This equation is not defined on the line at infinity but we can multiply by Z3 displaystyle Z 3 to get one that is ZY2 X3 aZ2X bZ3 displaystyle ZY 2 X 3 aZ 2 X bZ 3 This resulting equation is defined on the whole projective plane and the curve it defines projects onto the elliptic curve of interest To find its intersection with the line at infinity we can just posit Z 0 displaystyle Z 0 This implies X3 0 displaystyle X 3 0 which in a field means X 0 displaystyle X 0 Y displaystyle Y on the other hand can take any value and thus all triplets 0 Y 0 displaystyle 0 Y 0 satisfy the equation In projective geometry this set is simply the point O 0 1 0 displaystyle O 0 1 0 which is thus the unique intersection of the curve with the line at infinity Since the curve is smooth hence continuous it can be shown that this point at infinity is the identity element of a group structure whose operation is geometrically described as follows Since the curve is symmetric about the x axis given any point P we can take P to be the point opposite it We then have O O displaystyle O O as O displaystyle O lies on the XZ plane so that O displaystyle O is also the symmetrical of O displaystyle O about the origin and thus represents the same projective point If P and Q are two points on the curve then we can uniquely describe a third point P Q in the following way First draw the line that intersects P and Q This will generally intersect the cubic at a third point R We then take P Q to be R the point opposite R This definition for addition works except in a few special cases related to the point at infinity and intersection multiplicity The first is when one of the points is O Here we define P O P O P making O the identity of the group If P Q we only have one point thus we cannot define the line between them In this case we use the tangent line to the curve at this point as our line In most cases the tangent will intersect a second point R and we can take its opposite If P and Q are opposites of each other we define P Q O Lastly if P is an inflection point a point where the concavity of the curve changes we take R to be P itself and P P is simply the point opposite itself i e itself Let K be a field over which the curve is defined that is the coefficients of the defining equation or equations of the curve are in K and denote the curve by E Then the K rational points of E are the points on E whose coordinates all lie in K including the point at infinity The set of K rational points is denoted by E K E K is a group because properties of polynomial equations show that if P is in E K then P is also in E K and if two of P Q R are in E K then so is the third Additionally if K is a subfield of L then E K is a subgroup of E L Algebraic interpretation The above groups can be described algebraically as well as geometrically Given the curve y2 x3 bx c over the field K whose characteristic we assume to be neither 2 nor 3 and points P xP yP and Q xQ yQ on the curve assume first that xP xQ case 1 Let y sx d be the equation of the line that intersects P and Q which has the following slope s yP yQxP xQ displaystyle s frac y P y Q x P x Q The line equation and the curve equation intersect at the points xP xQ and xR so the equations have identical y values at these values sx d 2 x3 bx c displaystyle sx d 2 x 3 bx c which is equivalent to x3 s2x2 2sdx bx c d2 0 displaystyle x 3 s 2 x 2 2sdx bx c d 2 0 Since xP xQ and xR are solutions this equation has its roots at exactly the same x values as x xP x xQ x xR x3 xP xQ xR x2 xPxQ xPxR xQxR x xPxQxR displaystyle x x P x x Q x x R x 3 x P x Q x R x 2 x P x Q x P x R x Q x R x x P x Q x R and because both equations are cubics they must be the same polynomial up to a scalar Then equating the coefficients of x2 in both equations s2 xP xQ xR displaystyle s 2 x P x Q x R and solving for the unknown xR xR s2 xP xQ displaystyle x R s 2 x P x Q yR follows from the line equation yR yP s xP xR displaystyle y R y P s x P x R and this is an element of K because s is If xP xQ then there are two options if yP yQ case 3 including the case where yP yQ 0 case 4 then the sum is defined as 0 thus the inverse of each point on the curve is found by reflecting it across the x axis If yP yQ 0 then Q P and R xR yR P P 2P 2Q case 2 using P as R The slope is given by the tangent to the curve at xP yP s 3xP2 b2yP xR s2 2xP yR yP s xP xR displaystyle begin aligned s amp frac 3 x P 2 b 2y P x R amp s 2 2x P y R amp y P s x P x R end aligned A more general expression for s displaystyle s that works in both case 1 and case 2 is s xP2 xPxQ xQ2 byP yQ displaystyle s frac x P 2 x P x Q x Q 2 b y P y Q where equality to yP yQ xP xQ relies on P and Q obeying y2 x3 bx c Non Weierstrass curves For the curve y2 x3 ax2 bx c the general form of an elliptic curve with characteristic 3 the formulas are similar with s xP2 xP xQ xQ2 axP axQ b yP yQ and xR s2 a xP xQ For a general cubic curve not in Weierstrass normal form we can still define a group structure by designating one of its nine inflection points as the identity O In the projective plane each line will intersect a cubic at three points when accounting for multiplicity For a point P P is defined as the unique third point on the line passing through O and P Then for any P and Q P Q is defined as R where R is the unique third point on the line containing P and Q For an example of the group law over a non Weierstrass curve see Hessian curves Elliptic curves over the rational numbersA curve E defined over the field of rational numbers is also defined over the field of real numbers Therefore the law of addition of points with real coordinates by the tangent and secant method can be applied to E The explicit formulae show that the sum of two points P and Q with rational coordinates has again rational coordinates since the line joining P and Q has rational coefficients This way one shows that the set of rational points of E forms a subgroup of the group of real points of E Integral points This section is concerned with points P x y of E such that x is an integer For example the equation y2 x3 17 has eight integral solutions with y gt 0 x y 2 3 1 4 2 5 4 9 8 23 43 282 52 375 5234 378661 As another example Ljunggren s equation a curve whose Weierstrass form is y2 x3 2x has only four solutions with y 0 x y 0 0 1 1 2 2 338 6214 The structure of rational points Rational points can be constructed by the method of tangents and secants detailed above starting with a finite number of rational points More precisely the Mordell Weil theorem states that the group E Q is a finitely generated abelian group By the fundamental theorem of finitely generated abelian groups it is therefore a finite direct sum of copies of Z and finite cyclic groups The proof of the theorem involves two parts The first part shows that for any integer m gt 1 the quotient group E Q mE Q is finite this is the weak Mordell Weil theorem Second introducing a height function h on the rational points E Q defined by h P0 0 and h P log max p q if P unequal to the point at infinity P0 has as abscissa the rational number x p q with coprime p and q This height function h has the property that h mP grows roughly like the square of m Moreover only finitely many rational points with height smaller than any constant exist on E The proof of the theorem is thus a variant of the method of infinite descent and relies on the repeated application of Euclidean divisions on E let P E Q be a rational point on the curve writing P as the sum 2P1 Q1 where Q1 is a fixed representant of P in E Q 2E Q the height of P1 is about 1 4 of the one of P more generally replacing 2 by any m gt 1 and 1 4 by 1 m2 Redoing the same with P1 that is to say P1 2P2 Q2 then P2 2P3 Q3 etc finally expresses P as an integral linear combination of points Qi and of points whose height is bounded by a fixed constant chosen in advance by the weak Mordell Weil theorem and the second property of the height function P is thus expressed as an integral linear combination of a finite number of fixed points The theorem however doesn t provide a method to determine any representatives of E Q mE Q The rank of E Q that is the number of copies of Z in E Q or equivalently the number of independent points of infinite order is called the rank of E The Birch and Swinnerton Dyer conjecture is concerned with determining the rank One conjectures that it can be arbitrarily large even if only examples with relatively small rank are known The elliptic curve with the currently largest exactly known rank is y2 xy y x3 x2 244537 673 336 319 601 463 803 487 168 961 769 270 757 573 821 859 853 707 x 961710 182 053 183 034 546 222 979 258 806 817 743 270 682 028 964 434 238 957 830 989 898 438 151 121 499 931 It has rank 20 found by Noam Elkies and Zev Klagsbrun in 2020 Curves of rank higher than 20 have been known since 1994 with lower bounds on their ranks ranging from 21 to 29 but their exact ranks are not known and in particular it is not proven which of them have higher rank than the others or which is the true current champion As for the groups constituting the torsion subgroup of E Q the following is known the torsion subgroup of E Q is one of the 15 following groups a theorem due to Barry Mazur Z NZ for N 1 2 3 4 5 6 7 8 9 10 or 12 or Z 2Z Z 2NZ with N 1 2 3 4 Examples for every case are known Moreover elliptic curves whose Mordell Weil groups over Q have the same torsion groups belong to a parametrized family The Birch and Swinnerton Dyer conjecture The Birch and Swinnerton Dyer conjecture BSD is one of the Millennium problems of the Clay Mathematics Institute The conjecture relies on analytic and arithmetic objects defined by the elliptic curve in question At the analytic side an important ingredient is a function of a complex variable L the Hasse Weil zeta function of E over Q This function is a variant of the Riemann zeta function and Dirichlet L functions It is defined as an Euler product with one factor for every prime number p For a curve E over Q given by a minimal equation y2 a1xy a3y x3 a2x2 a4x a6 displaystyle y 2 a 1 xy a 3 y x 3 a 2 x 2 a 4 x a 6 with integral coefficients ai displaystyle a i reducing the coefficients modulo p defines an elliptic curve over the finite field Fp except for a finite number of primes p where the reduced curve has a singularity and thus fails to be elliptic in which case E is said to be of bad reduction at p The zeta function of an elliptic curve over a finite field Fp is in some sense a generating function assembling the information of the number of points of E with values in the finite field extensions Fpn of Fp It is given by Z E Fp T exp n 1 E Fpn Tnn displaystyle Z E mathbf F p T exp left sum n 1 infty left E mathbf F p n right frac T n n right The interior sum of the exponential resembles the development of the logarithm and in fact the so defined zeta function is a rational function in T Z E Fp T 1 apT pT2 1 T 1 pT displaystyle Z E mathbf F p T frac 1 a p T pT 2 1 T 1 pT where the trace of Frobenius termap displaystyle a p is defined to be the difference between the expected number p 1 displaystyle p 1 and the number of points on the elliptic curve E displaystyle E over Fp displaystyle mathbb F p viz ap p 1 E Fp displaystyle a p p 1 E mathbb F p or equivalently E Fp p 1 ap displaystyle E mathbb F p p 1 a p We may define the same quantities and functions over an arbitrary finite field of characteristic p displaystyle p with q pn displaystyle q p n replacing p displaystyle p everywhere The L function of E over Q is then defined by collecting this information together for all primes p It is defined by L E Q s p N 1 app s p1 2s 1 p N 1 app s 1 displaystyle L E mathbf Q s prod p not mid N left 1 a p p s p 1 2s right 1 cdot prod p mid N left 1 a p p s right 1 where N is the conductor of E i e the product of primes with bad reduction D Emodp 0 displaystyle Delta E mod p 0 in which case ap is defined differently from the method above see Silverman 1986 below For example E y2 x3 14x 19 displaystyle E y 2 x 3 14x 19 has bad reduction at 17 because Emod17 y2 x3 3x 2 displaystyle E mod 17 y 2 x 3 3x 2 has D 0 displaystyle Delta 0 This product converges for Re s gt 3 2 only Hasse s conjecture affirms that the L function admits an analytic continuation to the whole complex plane and satisfies a functional equation relating for any s L E s to L E 2 s In 1999 this was shown to be a consequence of the proof of the Shimura Taniyama Weil conjecture which asserts that every elliptic curve over Q is a modular curve which implies that its L function is the L function of a modular form whose analytic continuation is known One can therefore speak about the values of L E s at any complex number s At s 1 the conductor product can be discarded as it is finite the L function becomes L E Q 1 p N 1 app 1 p 1 1 p Npp ap 1 p Np E Fp displaystyle L E mathbf Q 1 prod p not mid N left 1 a p p 1 p 1 right 1 prod p not mid N frac p p a p 1 prod p not mid N frac p E mathbb F p The Birch and Swinnerton Dyer conjecture relates the arithmetic of the curve to the behaviour of this L function at s 1 It affirms that the vanishing order of the L function at s 1 equals the rank of E and predicts the leading term of the Laurent series of L E s at that point in terms of several quantities attached to the elliptic curve Much like the Riemann hypothesis the truth of the BSD conjecture would have multiple consequences including the following two A congruent number is defined as an odd square free integer n which is the area of a right triangle with rational side lengths It is known that n is a congruent number if and only if the elliptic curve y2 x3 n2x displaystyle y 2 x 3 n 2 x has a rational point of infinite order assuming BSD this is equivalent to its L function having a zero at s 1 Tunnell has shown a related result assuming BSD n is a congruent number if and only if the number of triplets of integers x y z satisfying 2x2 y2 8z2 n displaystyle 2x 2 y 2 8z 2 n is twice the number of triples satisfying 2x2 y2 32z2 n displaystyle 2x 2 y 2 32z 2 n The interest in this statement is that the condition is easy to check In a different direction certain analytic methods allow for an estimation of the order of zero in the center of the critical strip for certain L functions Admitting BSD these estimations correspond to information about the rank of families of the corresponding elliptic curves For example assuming the generalized Riemann hypothesis and BSD the average rank of curves given by y2 x3 ax b displaystyle y 2 x 3 ax b is smaller than 2 Elliptic curves over finite fieldsSet of affine points of elliptic curve y2 x3 x over finite field F61 Let K Fq be the finite field with q elements and E an elliptic curve defined over K While the precise number of rational points of an elliptic curve E over K is in general difficult to compute Hasse s theorem on elliptic curves gives the following inequality E K q 1 2q displaystyle E K q 1 leq 2 sqrt q In other words the number of points on the curve grows proportionally to the number of elements in the field This fact can be understood and proven with the help of some general theory see local zeta function and etale cohomology for example Set of affine points of elliptic curve y2 x3 x over finite field F89 The set of points E Fq is a finite abelian group It is always cyclic or the product of two cyclic groups For example the curve defined by y2 x3 x displaystyle y 2 x 3 x over F71 has 72 points 71 affine points including 0 0 and one point at infinity over this field whose group structure is given by Z 2Z Z 36Z The number of points on a specific curve can be computed with Schoof s algorithm Set of affine points of elliptic curve y2 x3 x over finite field F71 Studying the curve over the field extensions of Fq is facilitated by the introduction of the local zeta function of E over Fq defined by a generating series also see above Z E K T exp n 1 E Kn Tnn displaystyle Z E K T exp left sum n 1 infty left E K n right T n over n right where the field Kn is the unique up to isomorphism extension of K Fq of degree n that is Kn Fqn displaystyle K n F q n The zeta function is a rational function in T To see this consider the integer a displaystyle a such that E K 1 a q displaystyle E K 1 a q There is a complex number a displaystyle alpha such that 1 a q 1 a 1 a displaystyle 1 a q 1 alpha 1 bar alpha where a displaystyle bar alpha is the complex conjugate and so we have a a a displaystyle alpha bar alpha a aa q displaystyle alpha bar alpha q We choose a displaystyle alpha so that its absolute value is q displaystyle sqrt q that is a q12ei8 a q12e i8 displaystyle alpha q frac 1 2 e i theta bar alpha q frac 1 2 e i theta and that cos 8 a2q displaystyle cos theta frac a 2 sqrt q Note that a 2q displaystyle a leq 2 sqrt q a displaystyle alpha can then be used in the local zeta function as its values when raised to the various powers of n can be said to reasonably approximate the behaviour of an displaystyle a n in that E Kn 1 an qn displaystyle E K n 1 a n q n Using the Taylor series for the natural logarithm Z E K T exp n 1 1 an a n qn Tnn exp n 1 Tnn n 1 anTnn n 1 a nTnn n 1 qnTnn exp ln 1 T ln 1 aT ln 1 a T ln 1 qT exp ln 1 aT 1 a T 1 T 1 qT 1 aT 1 a T 1 T 1 qT displaystyle begin alignedat 2 Z E K T amp exp left sum n 1 infty left 1 alpha n bar alpha n q n right T n over n right amp exp left sum n 1 infty T n over n sum n 1 infty alpha n T n over n sum n 1 infty bar alpha n T n over n sum n 1 infty q n T n over n right amp exp left ln 1 T ln 1 alpha T ln 1 bar alpha T ln 1 qT right amp exp left ln frac 1 alpha T 1 bar alpha T 1 T 1 qT right amp frac 1 alpha T 1 bar alpha T 1 T 1 qT end alignedat Then 1 aT 1 a T 1 aT qT2 displaystyle 1 alpha T 1 bar alpha T 1 aT qT 2 so finally Z E K T 1 aT qT2 1 qT 1 T displaystyle Z E K T frac 1 aT qT 2 1 qT 1 T For example the zeta function of E y2 y x3 over the field F2 is given by 1 2T2 1 T 1 2T displaystyle frac 1 2T 2 1 T 1 2T which follows from E F2r 2r 1r odd2r 1 2 2 r2r even displaystyle left E mathbf F 2 r right begin cases 2 r 1 amp r text odd 2 r 1 2 2 frac r 2 amp r text even end cases as q 2 displaystyle q 2 then E 21 1 3 1 a 2 displaystyle E 2 1 1 3 1 a 2 so a 0 displaystyle a 0 The functional equation is Z E K 1qT 1 a1qT q 1qT 2 1 q1qT 1 1qT q2T2 aqT q qT q qT 1 Z E K T displaystyle Z left E K frac 1 qT right frac 1 a frac 1 qT q left frac 1 qT right 2 1 q frac 1 qT 1 frac 1 qT frac q 2 T 2 aqT q qT q qT 1 Z E K T As we are only interested in the behaviour of an displaystyle a n we can use a reduced zeta function Z a T exp n 1 anTnn displaystyle Z a T exp left sum n 1 infty a n T n over n right Z a T exp n 1 anTnn a nTnn displaystyle Z a T exp left sum n 1 infty alpha n T n over n bar alpha n T n over n right and so Z a T exp ln 1 aT ln 1 a T displaystyle Z a T exp left ln 1 alpha T ln 1 bar alpha T right which leads directly to the local L functions L E K T 1 aT qT2 displaystyle L E K T 1 aT qT 2 The Sato Tate conjecture is a statement about how the error term 2q displaystyle 2 sqrt q in Hasse s theorem varies with the different primes q if an elliptic curve E over Q is reduced modulo q It was proven for almost all such curves in 2006 due to the results of Taylor Harris and Shepherd Barron and says that the error terms are equidistributed Elliptic curves over finite fields are notably applied in cryptography and for the factorization of large integers These algorithms often make use of the group structure on the points of E Algorithms that are applicable to general groups for example the group of invertible elements in finite fields F q can thus be applied to the group of points on an elliptic curve For example the discrete logarithm is such an algorithm The interest in this is that choosing an elliptic curve allows for more flexibility than choosing q and thus the group of units in Fq Also the group structure of elliptic curves is generally more complicated Elliptic curves over a general fieldElliptic curves can be defined over any field K the formal definition of an elliptic curve is a non singular projective algebraic curve over K with genus 1 and endowed with a distinguished point defined over K If the characteristic of K is neither 2 nor 3 then every elliptic curve over K can be written in the form y2 x3 px q displaystyle y 2 x 3 px q after a linear change of variables Here p and q are elements of K such that the right hand side polynomial x3 px q does not have any double roots If the characteristic is 2 or 3 then more terms need to be kept in characteristic 3 the most general equation is of the form y2 4x3 b2x2 2b4x b6 displaystyle y 2 4x 3 b 2 x 2 2b 4 x b 6 for arbitrary constants b2 b4 b6 such that the polynomial on the right hand side has distinct roots the notation is chosen for historical reasons In characteristic 2 even this much is not possible and the most general equation is y2 a1xy a3y x3 a2x2 a4x a6 displaystyle y 2 a 1 xy a 3 y x 3 a 2 x 2 a 4 x a 6 provided that the variety it defines is non singular If characteristic were not an obstruction each equation would reduce to the previous ones by a suitable linear change of variables One typically takes the curve to be the set of all points x y which satisfy the above equation and such that both x and y are elements of the algebraic closure of K Points of the curve whose coordinates both belong to K are called K rational points Many of the preceding results remain valid when the field of definition of E is a number field K that is to say a finite field extension of Q In particular the group E K of K rational points of an elliptic curve E defined over K is finitely generated which generalizes the Mordell Weil theorem above A theorem due to Loic Merel shows that for a given integer d there are up to isomorphism only finitely many groups that can occur as the torsion groups of E K for an elliptic curve defined over a number field K of degree d More precisely there is a number B d such that for any elliptic curve E defined over a number field K of degree d any torsion point of E K is of order less than B d The theorem is effective for d gt 1 if a torsion point is of order p with p prime then p lt d3d2 displaystyle p lt d 3d 2 As for the integral points Siegel s theorem generalizes to the following Let E be an elliptic curve defined over a number field K x and y the Weierstrass coordinates Then there are only finitely many points of E K whose x coordinate is in the ring of integers OK The properties of the Hasse Weil zeta function and the Birch and Swinnerton Dyer conjecture can also be extended to this more general situation Elliptic curves over the complex numbersAn elliptic curve over the complex numbers is obtained as a quotient of the complex plane by a lattice L here spanned by two fundamental periods w1 and w2 The four torsion is also shown corresponding to the lattice 1 4 L containing L The formulation of elliptic curves as the embedding of a torus in the complex projective plane follows naturally from a curious property of Weierstrass s elliptic functions These functions and their first derivative are related by the formula z 2 4 z 3 g2 z g3 displaystyle wp z 2 4 wp z 3 g 2 wp z g 3 Here g2 and g3 are constants z is the Weierstrass elliptic function and z its derivative It should be clear that this relation is in the form of an elliptic curve over the complex numbers The Weierstrass functions are doubly periodic that is they are periodic with respect to a lattice L in essence the Weierstrass functions are naturally defined on a torus T C L This torus may be embedded in the complex projective plane by means of the map z 1 z 12 z displaystyle z mapsto left 1 wp z tfrac 1 2 wp z right This map is a group isomorphism of the torus considered with its natural group structure with the chord and tangent group law on the cubic curve which is the image of this map It is also an isomorphism of Riemann surfaces from the torus to the cubic curve so topologically an elliptic curve is a torus If the lattice L is related by multiplication by a non zero complex number c to a lattice cL then the corresponding curves are isomorphic Isomorphism classes of elliptic curves are specified by the j invariant The isomorphism classes can be understood in a simpler way as well The constants g2 and g3 called the modular invariants are uniquely determined by the lattice that is by the structure of the torus However all real polynomials factorize completely into linear factors over the complex numbers since the field of complex numbers is the algebraic closure of the reals So the elliptic curve may be written as y2 x x 1 x l displaystyle y 2 x x 1 x lambda One finds that g2 433 l2 l 1 g3 127 l 1 2l2 5l 2 displaystyle begin aligned g 2 amp frac sqrt 3 4 3 left lambda 2 lambda 1 right 4pt g 3 amp frac 1 27 lambda 1 left 2 lambda 2 5 lambda 2 right end aligned and j t 1728g2 3g2 3 27g3 2 256 l2 l 1 3l2 l 1 2 displaystyle j tau 1728 frac g 2 3 g 2 3 27 g 3 2 256 frac left lambda 2 lambda 1 right 3 lambda 2 left lambda 1 right 2 with j invariant j t and l t is sometimes called the modular lambda function For example let t 2i then l 2i 1 2 4 which implies g 2 g 3 and therefore g 23 27g 32 of the formula above are all algebraic numbers if t involves an imaginary quadratic field In fact it yields the integer j 2i 663 287496 In contrast the modular discriminant D t g2 t 3 27g3 t 2 2p 12h24 t displaystyle Delta tau g 2 tau 3 27g 3 tau 2 2 pi 12 eta 24 tau is generally a transcendental number In particular the value of the Dedekind eta function h 2i is h 2i G 14 2118p34 displaystyle eta 2i frac Gamma left frac 1 4 right 2 frac 11 8 pi frac 3 4 Note that the uniformization theorem implies that every compact Riemann surface of genus one can be represented as a torus This also allows an easy understanding of the torsion points on an elliptic curve if the lattice L is spanned by the fundamental periods w1 and w2 then the n torsion points are the equivalence classes of points of the form anw1 bnw2 displaystyle frac a n omega 1 frac b n omega 2 for integers a and b in the range 0 a b lt n If E y2 4 x e1 x e2 x e3 displaystyle E y 2 4 x e 1 x e 2 x e 3 is an elliptic curve over the complex numbers and a0 e1 e3 b0 e1 e2 c0 e2 e3 displaystyle a 0 sqrt e 1 e 3 qquad b 0 sqrt e 1 e 2 qquad c 0 sqrt e 2 e 3 then a pair of fundamental periods of E can be calculated very rapidly by w1 pM a0 b0 w2 pM c0 ib0 displaystyle omega 1 frac pi operatorname M a 0 b 0 qquad omega 2 frac pi operatorname M c 0 ib 0 M w z is the arithmetic geometric mean of w and z At each step of the arithmetic geometric mean iteration the signs of zn arising from the ambiguity of geometric mean iterations are chosen such that wn zn wn zn where wn and zn denote the individual arithmetic mean and geometric mean iterations of w and z respectively When wn zn wn zn there is an additional condition that Im zn wn gt 0 Over the complex numbers every elliptic curve has nine inflection points Every line through two of these points also passes through a third inflection point the nine points and 12 lines formed in this way form a realization of the Hesse configuration The dual isogenyGiven an isogeny f E E displaystyle f E to E of elliptic curves of degree n displaystyle n the dual isogeny is an isogeny f E E displaystyle hat f E to E of the same degree such that f f n displaystyle f circ hat f n Here n displaystyle n denotes the multiplication by n displaystyle n isogeny e ne displaystyle e mapsto ne which has degree n2 displaystyle n 2 Construction of the dual isogeny Often only the existence of a dual isogeny is needed but it can be explicitly given as the composition E Div0 E Div0 E E displaystyle E to operatorname Div 0 E to operatorname Div 0 E to E where Div0 displaystyle operatorname Div 0 is the group of divisors of degree 0 To do this we need maps E Div0 E displaystyle E to operatorname Div 0 E given by P P O displaystyle P to P O where O displaystyle O is the neutral point of E displaystyle E and Div0 E E displaystyle operatorname Div 0 E to E given by nPP nPP displaystyle sum n P P to sum n P P To see that f f n displaystyle f circ hat f n note that the original isogeny f displaystyle f can be written as a composite E Div0 E Div0 E E displaystyle E to operatorname Div 0 E to operatorname Div 0 E to E and that since f displaystyle f is finite of degree n displaystyle n f f displaystyle f f is multiplication by n displaystyle n on Div0 E displaystyle operatorname Div 0 E Alternatively we can use the smaller Picard group Pic0 displaystyle operatorname Pic 0 a quotient of Div0 displaystyle operatorname Div 0 The map E Div0 E displaystyle E to operatorname Div 0 E descends to an isomorphism E Pic0 E displaystyle E to operatorname Pic 0 E The dual isogeny is E Pic0 E Pic0 E E displaystyle E to operatorname Pic 0 E to operatorname Pic 0 E to E Note that the relation f f n displaystyle f circ hat f n also implies the conjugate relation f f n displaystyle hat f circ f n Indeed let ϕ f f displaystyle phi hat f circ f Then ϕ f f n n f displaystyle phi circ hat f hat f circ n n circ hat f But f displaystyle hat f is surjective so we must have ϕ n displaystyle phi n Algorithms that use elliptic curvesElliptic curves over finite fields are used in some cryptographic applications as well as for integer factorization Typically the general idea in these applications is that a known algorithm which makes use of certain finite groups is rewritten to use the groups of rational points of elliptic curves For more see also Elliptic curve cryptography Elliptic curve Diffie Hellman key exchange ECDH Supersingular isogeny key exchange Elliptic curve digital signature algorithm ECDSA EdDSA digital signature algorithm Dual EC DRBG random number generator Lenstra elliptic curve factorization Elliptic curve primality provingAlternative representations of elliptic curvesHessian curve Edwards curve Twisted curve Twisted Hessian curve Twisted Edwards curve Doubling oriented Doche Icart Kohel curve Tripling oriented Doche Icart Kohel curve Jacobian curve Montgomery curveSee alsoArithmetic dynamics Elliptic algebra Elliptic surface Comparison of computer algebra systems Isogeny j line Level structure algebraic geometry Modularity theorem Moduli stack of elliptic curves Nagell Lutz theorem Riemann Hurwitz formula Wiles s proof of Fermat s Last TheoremNotesSarli J 2012 Conics in the hyperbolic plane intrinsic to the collineation group J Geom 103 131 148 doi 10 1007 s00022 012 0115 5 S2CID 119588289 Silverman 1986 III 1 Weierstrass Equations p 45 T Nagell L analyse indeterminee de degre superieur Memorial des sciences mathematiques 39 Paris Gauthier Villars 1929 pp 56 59 OEIS https oeis org A029728 Siksek Samir 1995 Descents on Curves of Genus 1 Ph D thesis University of Exeter pp 16 17 hdl 10871 8323 Silverman 1986 Theorem 4 1 Silverman 1986 pp 199 205 See also Cassels J W S 1986 Mordell s Finite Basis Theorem Revisited Mathematical Proceedings of the Cambridge Philosophical Society 100 1 31 41 Bibcode 1986MPCPS 100 31C doi 10 1017 S0305004100065841 and the comment of A Weil on the genesis of his work A Weil Collected Papers vol 1 520 521 Dujella Andrej History of elliptic curves rank records University of Zagreb Silverman 1986 Theorem 7 5 Silverman 1986 Remark 7 8 in Ch VIII The definition is formal the exponential of this power series without constant term denotes the usual development see for example Silverman Joseph H 2006 An Introduction to the Theory of Elliptic Curves PDF Summer School on Computational Number Theory and Applications to Cryptography University of Wyoming LMFDB Bad reduction of an elliptic curve at a prime Reviewed Koblitz 1993 Heath Brown D R 2004 The Average Analytic Rank of Elliptic Curves Duke Mathematical Journal 122 3 591 623 arXiv math 0305114 doi 10 1215 S0012 7094 04 12235 3 S2CID 15216987 See Koblitz 1994 p 158 Koblitz 1994 p 160 Harris M Shepherd Barron N Taylor R 2010 A family of Calabi Yau varieties and potential automorphy Annals of Mathematics 171 2 779 813 doi 10 4007 annals 2010 171 779 Merel L 1996 Bornes pour la torsion des courbes elliptiques sur les corps de nombres Inventiones Mathematicae in French 124 1 3 437 449 Bibcode 1996InMat 124 437M doi 10 1007 s002220050059 S2CID 3590991 Zbl 0936 11037 Wing Tat Chow Rudolf 2018 The Arithmetic Geometric Mean and Periods of Curves of Genus 1 and 2 PDF White Rose eTheses Online p 12 ReferencesSerge Lang in the introduction to the book cited below stated that It is possible to write endlessly on elliptic curves This is not a threat The following short list is thus at best a guide to the vast expository literature available on the theoretical algorithmic and cryptographic aspects of elliptic curves Ian Blake Gadiel Seroussi Nigel Smart 2000 Elliptic Curves in Cryptography LMS Lecture Notes Cambridge University Press ISBN 0 521 65374 6 Brown Ezra 2000 Three Fermat Trails to Elliptic Curves The College Mathematics Journal 31 3 162 172 doi 10 1080 07468342 2000 11974137 S2CID 5591395 winner of the MAA writing prize the George Polya Award Richard Crandall Carl Pomerance 2001 Chapter 7 Elliptic Curve Arithmetic Prime Numbers A Computational Perspective 1st ed Springer Verlag pp 285 352 ISBN 0 387 94777 9 Cremona John 1997 Algorithms for Modular Elliptic Curves 2nd ed Cambridge University Press ISBN 0 521 59820 6 Darrel Hankerson Alfred Menezes and Scott Vanstone 2004 Guide to Elliptic Curve Cryptography Springer ISBN 0 387 95273 X Hardy G H Wright E M 2008 1938 An Introduction to the Theory of Numbers Revised by D R Heath Brown and J H Silverman Foreword by Andrew Wiles 6th ed Oxford Oxford University Press ISBN 978 0 19 921986 5 MR 2445243 Zbl 1159 11001 Chapter XXV Hellegouarch Yves 2001 Invitation aux mathematiques de Fermat Wiles Paris Dunod ISBN 978 2 10 005508 1 Husemoller Dale 2004 Elliptic Curves Graduate Texts in Mathematics Vol 111 2nd ed Springer ISBN 0 387 95490 2 Kenneth Ireland Michael I Rosen 1998 Chapters 18 and 19 A Classical Introduction to Modern Number Theory Graduate Texts in Mathematics Vol 84 2nd revised ed Springer ISBN 0 387 97329 X Knapp Anthony W 2018 1992 Elliptic Curves Mathematical Notes Vol 40 Princeton University Press ISBN 9780691186900 Koblitz Neal 1993 Introduction to Elliptic Curves and Modular Forms Graduate Texts in Mathematics Vol 97 2nd ed Springer Verlag ISBN 0 387 97966 2 Koblitz Neal 1994 Chapter 6 A Course in Number Theory and Cryptography Graduate Texts in Mathematics Vol 114 2nd ed Springer Verlag ISBN 0 387 94293 9 Serge Lang 1978 Elliptic curves Diophantine analysis Grundlehren der mathematischen Wissenschaften Vol 231 Springer Verlag ISBN 3 540 08489 4 Henry McKean Victor Moll 1999 Elliptic curves function theory geometry and arithmetic Cambridge University Press ISBN 0 521 65817 9 Ivan Niven Herbert S Zuckerman Hugh Montgomery 1991 Section 5 7 An introduction to the theory of numbers 5th ed John Wiley ISBN 0 471 54600 3 Silverman Joseph H 1986 The Arithmetic of Elliptic Curves Graduate Texts in Mathematics Vol 106 Springer Verlag ISBN 0 387 96203 4 Joseph H Silverman 1994 Advanced Topics in the Arithmetic of Elliptic Curves Graduate Texts in Mathematics Vol 151 Springer Verlag ISBN 0 387 94328 5 Joseph H Silverman John Tate 1992 Rational Points on Elliptic Curves Springer Verlag ISBN 0 387 97825 9 John Tate 1974 The arithmetic of elliptic curves Inventiones Mathematicae 23 3 4 179 206 Bibcode 1974InMat 23 179T doi 10 1007 BF01389745 S2CID 120008651 Lawrence Washington 2003 Elliptic Curves Number Theory and Cryptography Chapman amp Hall CRC ISBN 1 58488 365 0 External linksWikimedia Commons has media related to Elliptic curve Wikiquote has quotations related to Elliptic curve LMFDB Database of Elliptic Curves over Q Elliptic curve Encyclopedia of Mathematics EMS Press 2001 1994 Weisstein Eric W Elliptic Curves MathWorld The Arithmetic of elliptic curves from PlanetMath Interactive elliptic curve over R and over Zp web application that requires HTML5 capable browser This article incorporates material from Isogeny on PlanetMath which is licensed under the Creative Commons Attribution Share Alike License