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.
CITATION STYLE
Lercier, R., & Morain, F. (1995). Counting the number of points on elliptic curves over finite fields: Strategies and performances. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 921, pp. 79–94). Springer Verlag. https://doi.org/10.1007/3-540-49264-X_7
Mendeley helps you to discover research relevant for your work.