Schoof's algorithm: Difference between revisions

Revision as of 14:11, 3 January 2018

Revision as of 00:34, 8 January 2018

Line 6:

==Introduction==

Let <math>E</math> be an [[elliptic curve]] defined over the finite field <math>\mathbb{F}_{q}</math>, where <math>q=p^n</math> for <math>p</math> a prime and <math>n</math> an integer <math>\geq 1</math>(Here the notation is different from [[Finite Field]], here p is not the Field characteristic. The q is the p used over there.). Over a field of characteristic <math>\neq 2, 3</math> an elliptic curve can be given by a (short) Weierstrass equation

: <math>

y^2 = x^3 + Ax + B