| 2008 |
|---|
| 11 | EE | Pierre-Alain Fouque,
Reynald Lercier,
Denis Réal,
Frédéric Valette:
Fault Attack onElliptic Curve Montgomery Ladder Implementation.
FDTC 2008: 92-98 |
| 2006 |
|---|
| 10 | EE | Antoine Joux,
Reynald Lercier,
Nigel P. Smart,
Frederik Vercauteren:
The Number Field Sieve in the Medium Prime Case.
CRYPTO 2006: 326-344 |
| 9 | EE | Antoine Joux,
Reynald Lercier:
The Function Field Sieve in the Medium Prime Case.
EUROCRYPT 2006: 254-270 |
| 2003 |
|---|
| 8 | EE | Reynald Lercier,
David Lubicz:
Counting Points on Elliptic Curves over Finite Fields of Small Characteristic in Quasi Quadratic Time.
EUROCRYPT 2003: 360-373 |
| 7 | | Antoine Joux,
Reynald Lercier:
Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method.
Math. Comput. 72(242): 953-967 (2003) |
| 2002 |
|---|
| 6 | EE | Antoine Joux,
Reynald Lercier:
The Function Field Sieve Is Quite Special.
ANTS 2002: 431-445 |
| 2001 |
|---|
| 5 | | Antoine Joux,
Reynald Lercier:
"Chinese & Match", an alternative to Atkin's "Match and Sort" method used in the SEA algorithm.
Math. Comput. 70(234): 827-836 (2001) |
| 2000 |
|---|
| 4 | | Reynald Lercier,
François Morain:
Computing isogenies between elliptic curves over Fpn using Couveignes's algorithm.
Math. Comput. 69(229): 351-370 (2000) |
| 1997 |
|---|
| 3 | EE | Reynald Lercier:
Finding Good Random Elliptic Curves for Cryptosystems Defined over F2n.
EUROCRYPT 1997: 379-392 |
| 1996 |
|---|
| 2 | | Reynald Lercier:
Computing Isogenies in F2n.
ANTS 1996: 197-212 |
| 1995 |
|---|
| 1 | EE | Reynald Lercier,
François Morain:
Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance.
EUROCRYPT 1995: 79-94 |
