Schoof–Elkies–Atkin algorithm: Difference between revisions

Revision as of 19:21, 26 February 2009

Revision as of 11:55, 17 March 2009

Line 3:

==Details==

The Elkies-Atkin extension to Schoof's algorithm works by restricting the set of primes <math>S = \{l_1, \ldots, l_s\}</math> considered to primes of a certain kind. These came to be called Elkies primes and Atkin primes respectively. A prime <math>l</math> is called an Elkies prime if the characteristic equation: <math>\phi^2-t\phi+ q = 0</math> splits over <math>\mathbb{F}_l</math>, while an Atkin prime is a prime that is not an Elkies prime. Atkin showed how to combine information obtained from the Atkin primes with the information obtained from Elkies primes to produce an efficient algorithm, which came to be known as the Schoof-Elkies-Atkin algorithm. The first problem to address is to determine whether a given prime is Elkies or Atkin. In order to do so, we make use of modular polynomials, which come from the study of [[modular formsform]]s and an interpretation of [[Elliptic curve#Elliptic curves over the complex numbers|elliptic curves over the complex numbers]] as lattices(link). Once we have determined which case we are in, instead of using Division[[division Polynomialspolynomials]], we proceed by working modulo the modular polynomials <math>f_l</math> which have a lower degree than the corresponding division polynomial <math>\psi_l</math> (degree <math>O(l)</math> rather than <math>O(l^2)</math>). This results in a further reduction in the running time, giving us an algorithm more efficient than Schoof's, with complexity <math>O(\log^6 q)</math><ref>C. Peters: Counting ponts on elliptic curves over <math>\mathbb{F}_q</math>. Available at http://www.win.tue.nl/~cpeters/presentations/2008-eccs.pdf</ref>.

==References==