Elliptic curves have been used in integer factoring algorithms and in primality proving algorithms, and also for designing public-key cryptosystems. This section introduces elliptic curves and associated group operations, along with basic structural properties of particular interest in cryptography.
Defining Equation
An elliptic curve E over a field F is defined by a Weierstrass equation
with \(a_1,a_2,a_3,a_4,a_6 \in F\) and \(\Delta \neq 0\), where Δ is the discriminant of E and is defined as follows:
If L is any extension field of F, then the set of L-rational points on E is

where ∞ is the point at infinity.
Two elliptic curves E 1 and E 2 defined over F and given by Weierstrass equations (1...
References
Koblitz, N. (1994). A Course in Number Theory and Cryptography (2nd ed.). Springer-Verlag, Berlin.
Silverman, J. (1986). The Arithmetic of Elliptic Curves. Springer-Verlag, Berlin.
Silverman, J. (1994). Advanced Topics in the Arithmetic of Elliptic Curves. Springer-Verlag, Berlin.
Washington, L. (2003). Elliptic Curves: Number Theory and Cryptography. CRC Press, Boca Raton, FL.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this entry
Cite this entry
Hankerson, D., Menezes, A. (2005). Elliptic Curve. In: van Tilborg, H.C.A. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA . https://doi.org/10.1007/0-387-23483-7_130
Download citation
DOI: https://doi.org/10.1007/0-387-23483-7_130
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23473-1
Online ISBN: 978-0-387-23483-0
eBook Packages: Computer ScienceReference Module Computer Science and Engineering