Skip to Main content Skip to Navigation
Other publications

Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts

Preda Mihailescu 1 François Morain 2, 3 Eric Schost 4
1 Mathematisches Institut
2 TANC - Algorithmic number theory for cryptology
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
3 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
4 ORCCA and Computer Science Department
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.
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download
https://hal.inria.fr/inria-00130142
Contributor : François Morain <>
Submitted on : Friday, February 9, 2007 - 2:27:51 PM
Last modification on : Monday, May 25, 2020 - 6:02:04 PM
Document(s) archivé(s) le : Wednesday, April 7, 2010 - 2:44:07 AM

File

Vignette du document
issac07-hal.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00130142, version 1

Collections

INRIA | CNRS | LIX | INSMI | X-LIX | X | X-DEP-INFO

Citation

Preda Mihailescu, François Morain, Eric Schost. Computing the eigenvalue in the Schoof-Elkies-Atkin algorithm using Abelian lifts. 2007. ⟨inria-00130142⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

609

Files downloads

374

 

Contact                    Legal Notice                    Personal Data