Schoof's algorithm: Difference between revisions

Revision as of 08:49, 5 August 2019

Revision as of 05:34, 26 September 2019

Line 1:

==Introduction==

'''Schoof's algorithm''' is an efficient algorithm to count points on [[elliptic curve]]s over [[finite fields]]. The algorithm has applications in [[elliptic curve cryptography]] where it is important to know the number of points to judge the difficulty of solving the [[discrete logarithm problem]] in the [[Group (mathematics)|group]] of points on an elliptic curve.

Line 6 ⟶ 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>