# Schoof–Elkies–Atkin algorithm

The Elkies-Atkin extension to Schoof's algorithm works by restricting the set of primes $S=\{l_{1},\ldots ,l_{s}\}$ considered to primes of a certain kind. These came to be called Elkies primes and Atkin primes respectively. A prime $l$ is called an Elkies prime if the characteristic equation: $\phi ^{2}-t\phi +q=0$ splits over $\mathbb {F} _{l}$ , 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 $\Phi _{l}(X,Y)$ that parametrize pairs of $l$ -isogenous elliptic curves in terms of their j-invariants (in practice alternative modular polynomials may also be used but for the same purpose).
If the instantiated polynomial $\Phi _{l}(X,j(E))$ has a root $j(E')$ in $\mathbb {F} _{q}$ then $l$ is an Elkies prime, and we may compute a polynomial $f_{l}(X)$ whose roots correspond to points in the kernel of the $l$ -isogeny from $E$ to $E'$ . The polynomial $f_{l}$ is a divisor of the corresponding division polynomial used in Schoof's algorithm, and it has significantly lower degree, $O(l)$ versus $O(l^{2})$ . For Elkies primes, this allows one to compute the number of points on $E$ modulo $l$ more efficiently than in Schoof's algorithm. In the case of an Atkin prime, we can gain some information from the factorization pattern of $\Phi _{l}(X,j(E))$ in $\mathbb {F} _{l}[X]$ , which constrains the possibilities for the number of points modulo $l$ , but the asymptotic complexity of the algorithm depends entirely on the Elkies primes. Provided there are sufficiently many small Elkies primes (on average, we expect half the primes $l$ to be Elkies primes), this results in a reduction in the running time. The resulting algorithm is probabilistic (of Las Vegas type), and its expected running time is, heuristically, ${\tilde {O}}(\log ^{4}q)$ , making it more efficient in practice than Schoof's algorithm. Here the ${\tilde {O}}$ notation is a variant of big O notation that suppresses terms that are logarithmic in the main term of an expression.