Reference : Counting the Number of Points on Elliptic Curves over Finite Fields of Characteristic...
Scientific congresses, symposiums and conference proceedings : Paper published in a journal
Engineering, computing & technology : Computer science
Counting the Number of Points on Elliptic Curves over Finite Fields of Characteristic Greater than Three
Lehmann, Frank [> >]
Maurer, Markus [> >]
Müller, Volker mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Shoup, Victor [New York University, New York]
Proceedings of Algorithmic Number Theory Symposium I, Lecture Notes in Computer Science
Algorithmic Number Theory Symposium I (ANTS I)
Cornell University
Ithaca (New York)
[en] Elliptic curves ; Point counting ; Atkin-Elkies algorithm
[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.
Researchers ; Students

There is no file associated with this reference.

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.