Elliptic curves over complex numbers provide a fascinating bridge between algebra, geometry, and number theory. Their study reveals deep connections between lattices in the complex plane, elliptic functions, and isomorphism classes of curves.
Complex multiplication adds another layer of richness, linking elliptic curves to imaginary quadratic fields and class field theory. This powerful theory enables the construction of curves with special properties, finding applications in cryptography and computational number theory.
Elliptic curves over complex numbers
Elliptic curves over the complex numbers C provide a rich geometric and analytic structure that connects various branches of mathematics
The study of elliptic curves over C involves the interplay between algebraic geometry, complex analysis, and number theory
Understanding elliptic curves over C lays the foundation for the study of complex multiplication and its applications
Weierstrass equation
Top images from around the web for Weierstrass equation
The Math Behind Elliptic Curves in Weierstrass Form - Sefik Ilkin Serengil View original
Is this image relevant?
1 of 3
Elliptic curves over C can be described by the Weierstrass equation y2=x3+ax+b, where a,b∈C and the discriminant Δ=4a3+27b2=0
The Weierstrass equation defines a smooth projective curve of genus one with a specified base point O at infinity
The coefficients a and b determine the shape and properties of the elliptic curve (y2=x3−x and y2=x3−1)
Lattices in complex plane
A lattice Λ in the complex plane C is a discrete subgroup of the form Λ={mω1+nω2:m,n∈Z}, where ω1,ω2∈C are linearly independent over R
Every lattice Λ defines a complex torus C/Λ, which is an elliptic curve when equipped with a suitable
The periods ω1 and ω2 determine the shape and size of the lattice (Λ=Z+iZ and Λ=Z+2iZ)
Elliptic functions and meromorphic functions
An elliptic function is a meromorphic function f:C→C that is periodic with respect to a lattice Λ, i.e., f(z+ω)=f(z) for all z∈C and ω∈Λ
Elliptic functions can be expressed in terms of the Weierstrass ℘-function and its derivative ℘′, which are examples of meromorphic functions on the complex torus C/Λ
The field of elliptic functions associated with a lattice Λ is isomorphic to the field of rational functions on the corresponding elliptic curve (℘(z) and ℘′(z))
Isomorphisms between elliptic curves and complex tori
There is a bijective correspondence between isomorphism classes of elliptic curves over C and isomorphism classes of complex tori C/Λ
The Weierstrass ℘-function and its derivative ℘′ provide an explicit isomorphism between an elliptic curve in and the corresponding complex torus
The j-invariant j(E) of an elliptic curve E is a complex number that characterizes the isomorphism class of E and the corresponding lattice Λ (j(y2=x3−x)=1728 and j(y2=x3−1)=0)
Complex multiplication
Complex multiplication is a special property of certain elliptic curves over C that have extra endomorphisms beyond the usual multiplication-by-n maps
The study of complex multiplication connects elliptic curves, imaginary quadratic fields, and class field theory
Complex multiplication plays a crucial role in constructing elliptic curves with desired properties and has applications in cryptography and computational number theory
Endomorphism rings of elliptic curves
An endomorphism of an elliptic curve E over C is a complex-analytic map ϕ:E→E that is also a group homomorphism
The set of endomorphisms of E forms a ring End(E) under pointwise addition and composition
The End(E) is either Z (generic case) or an order in an imaginary quadratic field (complex multiplication case) (End(y2=x3−x)=Z[i] and End(y2=x3−1)=Z[ω], where ω=e2πi/3)
Orders in imaginary quadratic fields
An imaginary quadratic field is a number field K=Q(−d), where d is a positive square-free integer
An order O in K is a subring of K that is a finitely generated Z-module containing 1 (O=Z[i] in Q(i) and O=Z[ω] in Q(−3))
The maximal order in K is the ring of integers OK, which is the integral closure of Z in K
Class group of orders
The class group Cl(O) of an order O in an imaginary quadratic field K is the group of fractional ideal classes of O under ideal multiplication
The class number h(O) is the order of the class group Cl(O)
The class group Cl(OK) of the ring of integers OK is a finite abelian group that measures the failure of unique factorization in OK (Cl(Z[i])={1} and Cl(Z[ω])≅Z/2Z)
Elliptic curves with complex multiplication
An elliptic curve E over C has complex multiplication by an order O in an imaginary quadratic field K if End(E)≅O
The j-invariant j(E) of an elliptic curve E with complex multiplication by O is an algebraic integer that generates the Hilbert class field of O
Elliptic curves with complex multiplication have special properties, such as a larger endomorphism ring and a more efficient point counting algorithm (y2=x3−x has CM by Z[i] and y2=x3−1 has CM by Z[ω])
Hilbert class field and ray class fields
The Hilbert class field HO of an order O in an imaginary quadratic field K is the maximal unramified abelian extension of K with Galois group isomorphic to Cl(O)
Ray class fields are generalizations of the Hilbert class field that allow ramification at a finite set of primes
The theory of complex multiplication provides a way to construct Hilbert class fields and ray class fields using the j-invariants of elliptic curves with complex multiplication (HZ[i]=Q(i) and HZ[ω]=Q(−3,−1))
Elliptic curves over finite fields
The study of elliptic curves over finite fields Fq, where q is a prime power, has important applications in cryptography and computational number theory
Elliptic curves over finite fields exhibit different properties compared to elliptic curves over C, such as a finite number of points and a more intricate endomorphism structure
Understanding the reduction of elliptic curves modulo primes and the Frobenius endomorphism is crucial for the efficient implementation of elliptic curve cryptography
Reduction of elliptic curves modulo primes
Given an elliptic curve E defined over Q and a prime p, the reduction of E modulo p is the elliptic curve Ep obtained by reducing the coefficients of the Weierstrass equation of E modulo p
The reduction Ep is an elliptic curve over the finite field Fp if p does not divide the discriminant Δ of E (good reduction)
If p divides Δ, the reduction Ep is either a singular curve (bad reduction) or a curve with a node or a cusp (semistable reduction) (y2=x3−x mod 5 and y2=x3−1 mod 7)
Supersingular vs ordinary elliptic curves
An elliptic curve E over a finite field Fq of characteristic p is called supersingular if the group E(Fqn) has order divisible by p for all n≥1
If E is not supersingular, it is called ordinary
Supersingular elliptic curves have special properties, such as a larger endomorphism ring and a more efficient point counting algorithm (y2=x3−x over F5 is supersingular and y2=x3−1 over F7 is ordinary)
Frobenius endomorphism
The Frobenius endomorphism πq:E→E of an elliptic curve E over a finite field Fq is the map (x,y)↦(xq,yq)
The Frobenius endomorphism πq satisfies the characteristic equation πq2−tqπq+q=0, where tq is the trace of πq
The trace tq determines the number of points on E over Fq via the formula #E(Fq)=q+1−tq (π5(x,y)=(x5,y5) on y2=x3−x over F5 and π7(x,y)=(x7,y7) on y2=x3−1 over F7)
Characteristic polynomial of Frobenius
The characteristic polynomial of the Frobenius endomorphism πq of an elliptic curve E over Fq is the polynomial Pq(T)=T2−tqT+q
The roots of Pq(T) are complex numbers of absolute value q and are conjugate if E is ordinary
The splitting field of Pq(T) is related to the endomorphism ring of E and plays a role in the complex multiplication method (P5(T)=T2+2T+5 for y2=x3−x over F5 and P7(T)=T2+2T+7 for y2=x3−1 over F7)
Point counting algorithms for elliptic curves
Determining the number of points on an elliptic curve E over a finite field Fq is a fundamental problem in elliptic curve cryptography
The naive algorithm of counting points by exhaustive search has exponential complexity in logq
More efficient point counting algorithms, such as Schoof's algorithm and its variants (Schoof-Elkies-Atkin algorithm), have polynomial complexity in logq and rely on the properties of the Frobenius endomorphism and the characteristic polynomial (#E(F5)=5 for y2=x3−x over F5 and #E(F7)=6 for y2=x3−1 over F7)
Applications of complex multiplication
The theory of complex multiplication has numerous applications in various areas of mathematics and computer science
Complex multiplication provides a way to construct elliptic curves with desired properties, such as a prescribed number of points or resistance to certain attacks in cryptography
The complex multiplication method is also used in primality proving and the computation of class polynomials
Constructing elliptic curves with prescribed number of points
In elliptic curve cryptography, it is often desirable to construct elliptic curves over finite fields with a prescribed number of points to ensure security and efficiency
The complex multiplication method allows the construction of such curves by starting with an elliptic curve E with complex multiplication by an order O and reducing E modulo a suitable prime p
The resulting curve Ep over Fp will have a number of points related to the class number of O and the trace of the Frobenius endomorphism (y2=x3−1 over F7 has 6 points)
Primality proving
Primality proving is the task of determining whether a given integer n is prime or composite
The complex multiplication method can be used to construct primality proofs for certain classes of integers, such as Mersenne numbers and Fermat numbers
The idea is to construct an elliptic curve E with complex multiplication by an order O and show that the reduction En has a prime number of points over Fn, implying that n is prime (y2=x3−x over F5 has 5 points, proving that 5 is prime)
Elliptic curve cryptography relies on the difficulty of the discrete logarithm problem on elliptic curves over finite fields
To ensure security, it is important to use elliptic curves that are resistant to known attacks, such as the Pollard rho algorithm and the Pohlig-Hellman algorithm
The complex multiplication method can be used to generate cryptographically secure elliptic curves with a prescribed number of points and a large embedding degree, which is important for pairing-based cryptography (y2=x3−x+1 over F31 has 37 points and embedding degree 6)
Complex multiplication method for computing class polynomials
The complex multiplication method is an algorithm for computing the Hilbert class polynomial HD(x) associated with an imaginary quadratic discriminant D
The Hilbert class polynomial HD(x) is a polynomial whose roots are the j-invariants of elliptic curves with complex multiplication by the order of discriminant D
The complex multiplication method computes HD(x) by evaluating the modular j-function at certain points in the upper half-plane related to the class group of the order (H−3(x)=x and H−4(x)=x2+1728)
Elliptic curve cryptography and pa
Key Terms to Review (17)
Cm field: A cm field, or complex multiplication field, is a special type of number field that is defined by its relationship to the theory of elliptic curves and complex multiplication. These fields contain algebraic integers whose endomorphism rings have non-trivial automorphisms, leading to rich structures that allow for deep connections between number theory and geometry, particularly in the context of elliptic curves.
David Hilbert: David Hilbert was a prominent German mathematician known for his foundational contributions to various areas of mathematics, including algebra, number theory, and geometry. His work laid the groundwork for the modern understanding of elliptic curves and their properties, influencing numerous aspects of mathematics and theoretical physics.
Ecc: ECC, or Elliptic Curve Cryptography, is a method of public key cryptography based on the algebraic structure of elliptic curves over finite fields. It leverages the mathematical properties of elliptic curves to provide security for digital communications, enabling secure key exchange and data encryption. This approach is particularly attractive due to its ability to achieve a high level of security with relatively small key sizes, making it efficient and suitable for constrained environments like mobile devices.
Endomorphism ring: The endomorphism ring is a structure that consists of all endomorphisms of an algebraic object, such as an elliptic curve, along with the operations of addition and composition. It provides insight into the symmetries and transformations that can be applied to the object, revealing important algebraic properties. In the context of elliptic curves, understanding the endomorphism ring is crucial for exploring their classification and applications in number theory, cryptography, and coding theory.
Frey's Theorem: Frey's Theorem asserts that if there exists a solution to the equation $$x^n + y^n = z^n$$ for integers $$x, y, z$$ and an integer $$n > 2$$, then one can associate an elliptic curve with this solution. This connection between Diophantine equations and elliptic curves has profound implications in number theory, especially in understanding Fermat's Last Theorem.
Goro Shimura: Goro Shimura is a prominent mathematician known for his significant contributions to the theory of elliptic curves, particularly in the context of complex multiplication. He is widely recognized for establishing a connection between the theory of modular forms and the arithmetic of elliptic curves, paving the way for advancements in number theory and algebraic geometry.
Group law: In the context of elliptic curves, group law refers to the set of rules that define how to add points on an elliptic curve, forming a mathematical group. This concept is crucial as it provides a structured way to perform point addition and ensures that the operation adheres to properties like associativity, commutativity, and the existence of an identity element, which are fundamental in various applications including cryptography and number theory.
Key Exchange Protocols: Key exchange protocols are cryptographic methods used to securely share cryptographic keys between parties, ensuring that the communication remains private and authenticated. These protocols enable two or more users to establish a shared secret key over an insecure channel, which can then be used for encrypting and decrypting messages. They are fundamental in establishing secure communications, especially in environments where data confidentiality and integrity are crucial.
L-functions: L-functions are complex functions that generalize the notion of Dirichlet series and are crucial in number theory, particularly in understanding the properties of algebraic objects like elliptic curves. They encode significant arithmetic information and are deeply connected to various conjectures and theorems in mathematics, linking number theory and geometry.
Modular Forms: Modular forms are complex analytic functions defined on the upper half-plane that exhibit specific transformation properties under the action of modular groups. They are fundamental in number theory and have deep connections to elliptic curves, providing crucial insights into the properties of these curves through concepts like the j-invariant and the Taniyama-Shimura conjecture.
Modularity Theorem: The Modularity Theorem asserts that every elliptic curve over the rational numbers is modular, meaning it can be associated with a modular form. This connection not only bridges the worlds of number theory and algebraic geometry but also plays a crucial role in several significant conjectures and theorems in mathematics, including the proof of Fermat's Last Theorem.
Mordell-Weil Group: The Mordell-Weil Group is a fundamental concept in the study of elliptic curves, representing the group of rational points on an elliptic curve over a number field. This group captures the structure of solutions to the elliptic curve equation and is integral to understanding both the arithmetic properties of the curve and its relationships with other mathematical objects, especially in relation to complex multiplication.
Mordell's Theorem: Mordell's Theorem states that the group of rational points on an elliptic curve defined over the rational numbers is finitely generated. This means that the set of rational solutions to the equation describing the elliptic curve can be expressed as a finite combination of a finite number of generators and a torsion subgroup. This theorem connects the structure of elliptic curves to the nature of rational numbers, illustrating how solutions behave over various fields.
Rank: In the context of elliptic curves, the rank refers to the number of independent rational points that can be generated on an elliptic curve over a given field, particularly over the rational numbers. This concept is crucial as it helps in understanding the structure of the group of rational points, leading to insights about the solutions to equations defined by the curve and their distributions over various fields.
Rational Points: Rational points on an elliptic curve are points whose coordinates are both rational numbers. These points play a critical role in understanding the structure of elliptic curves, their group laws, and their applications in number theory and cryptography.
Tate's Isogeny Theorem: Tate's Isogeny Theorem provides a deep connection between the arithmetic of elliptic curves and their endomorphism rings, particularly in the context of curves with complex multiplication. This theorem states that for any elliptic curve with complex multiplication by an order in an imaginary quadratic field, there exists a finite isogeny to another elliptic curve with the same degree. This result is crucial for understanding the structure of elliptic curves and their associated L-functions.
Weierstrass form: Weierstrass form is a specific way of representing elliptic curves using a cubic equation in two variables, typically expressed as $$y^2 = x^3 + ax + b$$, where $$a$$ and $$b$$ are constants. This representation is fundamental because it simplifies the study of elliptic curves, enabling clear definitions of point addition and doubling, and serving as a basis for various applications in number theory and cryptography.