Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts
Abstract
The Schoof-Elkies-Atkin algorithm is the best known method for counting the number of points of an elliptic curve defined over a finite field of large characteristic. We use abelian properties of division polynomials to design a fast theoretical and practical algorithm for computing the eigenvalue search.
Origin : Files produced by the author(s)
Loading...