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
171 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
169 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
143 2008 The function field sieve in the medium prime case A Joux, R Lercier
Annual International Conference on the Theory and Applications of …, 2006
142 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
121 1995 The function field sieve is quite special A Joux, R Lercier
International Algorithmic Number Theory Symposium, 431-445, 2002
95 2002 Hyperelliptic curves and their invariants: geometric, arithmetic and algorithmic aspects R Lercier, C Ritzenthaler
Journal of algebra 372, 595-636, 2012
89 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
65 2009 A quasi quadratic time algorithm for hyperelliptic curve point counting R Lercier, D Lubicz
The Ramanujan Journal 12 (3), 399-423, 2006
61 2006 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
59 2013 Finding Good Random Elliptic Curves for Cryptosystems Defined over R Lercier
Advances in Cryptology—EUROCRYPT’97: International Conference on the Theory …, 1997
57 1997 Computing isogenies in R Lercier
International Algorithmic Number Theory Symposium, 197-212, 1996
54 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
43 2013 On Elkies subgroups of R Lercier, T Sirvent
Journal de théorie des nombres de Bordeaux 20 (3), 783-797, 2008
42 2008 Plane quartics over P Kılıçer, H Labrande, R Lercier, C Ritzenthaler, J Sijsling, M Streng
arXiv preprint arXiv:1701.06489, 2017
38 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
37 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
32 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
30 2010 