Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performances
Lercier, Reynald ; Morain, François
HAL, hal-01102046 / Harvested from HAL
Text on HAL
Cryptographic schemes using elliptic curves over finite fields requirethe computation of the cardinality of the curves. Dramaticprogress have been achieved recently in that field. The aim of thisarticle is to highlight part of these improvements and to describe anefficient implementation of them in the particular case of the field$GF(2^n)$, for $n \leq 500$.
Publié le : 1995-05-04
Classification:  [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG] 
@article{hal-01102046,
     author = {Lercier, Reynald and Morain, Fran\c cois},
     title = {Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performances},
     journal = {HAL},
     volume = {1995},
     number = {0},
     year = {1995},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-01102046}
}

Lercier, Reynald; Morain, François. Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performances. HAL, Tome 1995 (1995) no. 0, . http://gdmltest.u-ga.fr/item/hal-01102046/