In
mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ... the division polynomials provide a way to calculate multiples of points on
elliptic curves and to study the fields generated by torsion points. They play a central role in the study of
counting points on elliptic curves in
Schoof's algorithm .
Definition
The set of division polynomials is a sequence of
polynomials
In mathematics, a polynomial is an expression (mathematics), expression consisting of indeterminate (variable), indeterminates (also called variable (mathematics), variables) and coefficients, that involves only the operations of addition, subtrac ... in
\mathbb ,y,A,B /math> with x, y, A, B free variables that is recursively defined by:
::\psi_ = 0
::\psi_ = 1
::\psi_ = 2y
::\psi_ = 3x^ + 6Ax^ + 12Bx - A^
::\psi_ = 4y(x^ + 5Ax^ + 20Bx^ - 5A^x^ - 4ABx - 8B^ - A^)
::\vdots
::\psi_ = \psi_ \psi_^ - \psi_ \psi ^_ \text m \geq 2
::\psi_ = \left ( \frac \right ) \cdot ( \psi_\psi^_ - \psi_ \psi ^_) \text m \geq 3
The polynomial \psi_n is called the ''n''th division polynomial.
Properties
*In practice, one sets y^2=x^3+Ax+B , and then \psi_\in\mathbb ,A,B /math> and \psi_\in 2y\mathbb ,A,B /math>.
* The division polynomials form a generic elliptic divisibility sequence over the ring \mathbb ,y,A,B (y^2-x^3-Ax-B) .
*If an elliptic curve E is given in the Weierstrass form
In mathematics, an elliptic curve is a smooth, projective, algebraic curve of genus one, on which there is a specified point . An elliptic curve is defined over a field and describes points in , the Cartesian product of with itself. If t ... y^2=x^3+Ax+B over some field K , i.e. A, B\in K , one can use these values of A, B and consider the division polynomials in the coordinate ring of E . The roots of \psi_ are the x -coordinates of the points of En+1 N1, N.I, N-1, or N01 may refer to:
Information technology
* Nokia N1, an Android tablet
* Nexus One, an Android phone made by HTC
* Nylas N1, a desktop email client
* Oppo N1, an Android phone
* N1, a Sun Microsystems software brand now mostly ... setminus \ , where En+1 N1, N.I, N-1, or N01 may refer to:
Information technology
* Nokia N1, an Android tablet
* Nexus One, an Android phone made by HTC
* Nylas N1, a desktop email client
* Oppo N1, an Android phone
* N1, a Sun Microsystems software brand now mostly ... /math> is the (2n+1)^ torsion subgroup of E . Similarly, the roots of \psi_/y are the x -coordinates of the points of E n setminus E /math>.
*Given a point P=(x_P,y_P) on the elliptic curve E:y^2=x^3+Ax+B over some field K , we can express the coordinates of the nth multiple of P in terms of division polynomials:
::nP= \left ( \frac, \frac \right) = \left( x - \frac , \frac \right)
: where \phi_ and \omega_ are defined by:
::\phi_=x\psi_^ - \psi_\psi_,
::\omega_=\frac.
Using the relation between \psi_ and \psi _ , along with the equation of the curve, the functions \psi_^ , \frac, \psi_ , \phi_ are all in K /math>.
Let p>3 be prime and let E:y^2=x^3+Ax+B be an elliptic curve over the finite field \mathbb_p , i.e., A,B \in \mathbb_p . The \ell -torsion group of E over \bar_p is isomorphic
In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word is ... to \mathbb/\ell \times \mathbb/\ell if \ell\neq p , and to \mathbb/\ell or \ if \ell=p . Hence the degree of \psi_\ell is equal to either \frac(l^2-1) , \frac(l-1) , or 0.
René Schoof
René Schoof (born 8 May 1955 in Den Helder)R.J. Schoof, 1955 - at the observed that working modulo the \ell ''th'' division polynomial allows one to work with all \ell -torsion points simultaneously. This is heavily used in Schoof's algorithm for counting points on elliptic curves.
See also
* Schoof's algorithm
References
*A. Enge: ''Elliptic Curves and their Applications to Cryptography: An Introduction''. Kluwer Academic Publishers, Dordrecht, 1999.
*N. Koblitz: ''A Course in Number Theory and Cryptography'', Graduate Texts in Math. No. 114, Springer-Verlag, 1987. Second edition, 1994
*Müller : ''Die Berechnung der Punktanzahl von elliptischen kurvenüber endlichen Primkörpern''. Master's Thesis. Universität des Saarlandes, Saarbrücken, 1991.
*G. Musiker: ''Schoof's Algorithm for Counting Points on E(\mathbb_q) ''. Available at http://www-math.mit.edu/~musiker/schoof.pdf
*Schoof: ''Elliptic Curves over Finite Fields and the Computation of Square Roots mod p''. Math. Comp., 44(170):483–494, 1985. Available at http://www.mat.uniroma2.it/~schoof/ctpts.pdf
*R. Schoof: ''Counting Points on Elliptic Curves over Finite Fields''. J. Theor. Nombres Bordeaux 7:219–254, 1995. Available at http://www.mat.uniroma2.it/~schoof/ctg.pdf
*L. C. Washington: ''Elliptic Curves: Number Theory and Cryptography''. Chapman & Hall/CRC, New York, 2003.
*J. Silverman: ''The Arithmetic of Elliptic Curves'', Springer-Verlag, GTM 106, 1986.
{{Algebraic curves navbox
Polynomials
Algebraic curves
HOME
Content is Copyleft Website design, code, and AI is Copyrighted (c) 2014-2017 by Stephen Payne
Consider donating to Wikimedia
As an Amazon Associate I earn from qualifying purchases