Schoof's algorithm: Difference between revisions

Content deleted Content added
m ]]s
No edit summary
Tags: Mobile edit Mobile web edit
Line 5:
This article explains Schoof's approach, laying emphasis on the mathematical ideas underlying the structure of the algorithm.
 
 
==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>. Over a field of characteristic <math>\neq 2, 3</math> an elliptic curve can be given by a (short) Weierstrass equation
: <math>