Elliptic curves; Point counting; Atkin-Elkies algorithm
Abstract :
[en] The paper describes the implementation of the Algorithm of Atkin and Elkies for computing the group order of elliptic curves over large prime fields. The focus of the paper lays on algorithmical aspects of the Atkin/Elkies algorithm. Practical data and running times are given.
Disciplines :
Computer science
Identifiers :
UNILU:UL-ARTICLE-2007-002
Author, co-author :
Lehmann, Frank
Maurer, Markus
Müller, Volker ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Shoup, Victor; New York University, New York
Language :
English
Title :
Counting the Number of Points on Elliptic Curves over Finite Fields of Characteristic Greater than Three
Publication date :
1994
Event name :
Algorithmic Number Theory Symposium I (ANTS I)
Event organizer :
Cornell University
Event place :
Ithaca (New York), United States
Event date :
1994
Audience :
International
Journal title :
Proceedings of Algorithmic Number Theory Symposium I, Lecture Notes in Computer Science
