| Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the Gaussian integer method A Joux, R Lercier Mathematics of computation 72 (242), 953-967, 2003 | 173 | 2003 |
| The number field sieve in the medium prime case A Joux, R Lercier, N Smart, F Vercauteren Annual International Cryptology Conference, 326-344, 2006 | 168 | 2006 |
| Fault attack on elliptic curve Montgomery ladder implementation PA Fouque, R Lercier, D Réal, F Valette 2008 5th Workshop on Fault Diagnosis and Tolerance in Cryptography, 92-98, 2008 | 144 | 2008 |
| The function field sieve in the medium prime case A Joux, R Lercier Annual International Conference on the Theory and Applications of …, 2006 | 139 | 2006 |
| Counting the number of points on elliptic curves over finite fields: strategies and performances R Lercier, F Morain International Conference on the Theory and Applications of Cryptographic …, 1995 | 120 | 1995 |
| The function field sieve is quite special A Joux, R Lercier International Algorithmic Number Theory Symposium, 431-445, 2002 | 93 | 2002 |
| Hyperelliptic curves and their invariants: geometric, arithmetic and algorithmic aspects R Lercier, C Ritzenthaler Journal of algebra 372, 595-636, 2012 | 87 | 2012 |
| Algorithmique des courbes elliptiques dans les corps finis R Lercier Ecole Polytechnique, 1997 | 87 | 1997 |
| Elliptic periods for finite fields JM Couveignes, R Lercier Finite fields and their applications 15 (1), 1-22, 2009 | 61 | 2009 |
| A quasi quadratic time algorithm for hyperelliptic curve point counting R Lercier, D Lubicz The Ramanujan Journal 12 (3), 399-423, 2006 | 59 | 2006 |
| Finding Good Random Elliptic Curves for Cryptosystems Defined over R Lercier Advances in Cryptology—EUROCRYPT’97: International Conference on the Theory …, 1997 | 59 | 1997 |
| A multifractal mass transference principle for Gibbs measures with applications to dynamical Diophantine approximation AH Fan, J Schmeling, S Troubetzkoy Proceedings of the London Mathematical Society 107 (5), 1173-1219, 2013 | 55 | 2013 |
| Computing isogenies in R Lercier International Algorithmic Number Theory Symposium, 197-212, 1996 | 53 | 1996 |
| Counting points on elliptic curves over finite fields of small characteristic in quasi quadratic time R Lercier, D Lubicz International Conference on the Theory and Applications of Cryptographic …, 2003 | 47 | 2003 |
| Fast construction of irreducible polynomials over finite fields JM Couveignes, R Lercier Israel Journal of Mathematics 194, 77-105, 2013 | 42 | 2013 |
| On Elkies subgroups of -torsion points in elliptic curves defined over a finite field R Lercier, T Sirvent Journal de théorie des nombres de Bordeaux 20 (3), 783-797, 2008 | 40 | 2008 |
| Plane quartics over with complex multiplication P Kılıçer, H Labrande, R Lercier, C Ritzenthaler, J Sijsling, M Streng arXiv preprint arXiv:1701.06489, 2017 | 35 | 2017 |
| Parametrizing the moduli space of curves and applications to smooth plane quartics over finite fields R Lercier, C Ritzenthaler, F Rovetta, J Sijsling LMS Journal of Computation and Mathematics 17 (A), 128-147, 2014 | 33 | 2014 |
| “Chinese & Match”, an alternative to Atkin’s “Match and Sort” method used in the SEA algorithm A Joux, R Lercier Mathematics of computation 70 (234), 827-836, 2001 | 30 | 2001 |
| Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time JG Kammerer, R Lercier, G Renault Pairing-Based Cryptography-Pairing 2010: 4th International Conference …, 2010 | 28 | 2010 |
