@inproceedings{cc538e6051534a3fb1d0d03231282a03,
title = "Counting the number of points on elliptic curves over finite fields: Strategies and performances",
abstract = "Abstract. Cryptographic schemes using elliptic curves over finite fields require the computation of the cardinality of the curves. Dramatic progress have been achieved recently in that field by various authors. The aim of this article is to highlight part of these improvements and to describe an efficient, implementation of them in the particular case of the fields.",
author = "Reynald Lercier and Fran{\c c}ois Morain",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1995.; International Conference on theTheory and Applications of Cryptographic Techniques, EUROCRYPT 1995 ; Conference date: 21-05-1995 Through 25-05-1995",
year = "1995",
month = jan,
day = "1",
doi = "10.1007/3-540-49264-X\_7",
language = "English",
isbn = "3540594094",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "79--94",
editor = "Jean-Jacques Quisquater and Guillou, \{Louis C.\}",
booktitle = "Advances in Cryptology — EUROCRYPT 1995 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings",
}