Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm

Abstract

The Schoof-Elkies-Atkin algorithm is the only known method for counting the number of points of an elliptic curve defined over a finite field of large characteristic. Several practical and asymptotical improvements for the phase called eigenvalue computation are proposed.
Fichier principal
Vignette du fichier
issac06.pdf (126.32 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00001009 , version 1 (13-01-2006)

Identifiers

Cite

Pierrick Gaudry, François Morain. Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm. ISSAC '06: Proceedings of the 2006 international symposium on symbolic and algebraic computation, Jul 2006, Genoa, Italy, pp.109 - 115, ⟨10.1145/1145768.1145791⟩. ⟨inria-00001009⟩
1790 View
650 Download

Altmetric

Share

Gmail Facebook X LinkedIn More