Counting points on elliptic curves over finite fields
Journal de théorie des nombres de Bordeaux · 1995 · 7 (1) · 219-254
DOI: 10.5802/jtnb.142 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal de théorie des nombres de Bordeaux, 1995. Verfasst von René Schoof. Die Arbeit wurde bisher 266-mal zitiert (Crossref) und nennt 21 Literaturangaben.
Abstract (Originalsprache)
We describe three algorithms to count the number of points on an elliptic curve over a finite field. The first one is very practical when the finite field is not too large ; it is based on Shanks's baby-step-giant-step strategy. The second algorithm is very efficient when the endomorphism ring of the curve is known. It exploits the natural lattice structure of this ring. The third algorithm is based on calculations with the torsion points of the elliptic curve [18]. This deterministic polynomial time algorithm was impractical in its original form. We discuss several practical improvements by Atkin and Elkies.
Zitieren
APA
Schoof, R. (1995). Counting points on elliptic curves over finite fields. Journal de théorie des nombres de Bordeaux, 7(1), 219-254. https://doi.org/10.5802/jtnb.142
Vancouver
Schoof R. Counting points on elliptic curves over finite fields. Journal de théorie des nombres de Bordeaux. 1995;7(1):219-254. doi:10.5802/jtnb.142
BibTeX
@article{Schoof1995,
author = {Schoof, René},
title = {Counting points on elliptic curves over finite fields},
journal = {Journal de théorie des nombres de Bordeaux},
year = {1995},
volume = {7},
number = {1},
pages = {219--254},
doi = {10.5802/jtnb.142}
}
EUVIMED