Reynald Lercier

30 papers A* 5B 1C 3Journal 16Unranked 2
YearRankTypeTitle / Venue / Authors
2020 J jnl
Reconstructing Plane Quartics from Their Invariants.
Discret. Comput. Geom.
Reynald Lercier, Christophe Ritzenthaler, Jeroen Sijsling
2019 J jnl
Distributions of Traces of Frobenius for Smooth Plane Curves Over Finite Fields.
Exp. Math.
Reynald Lercier, Christophe Ritzenthaler, Florent Rovetta, Jeroen Sijsling, Benjamin Smith
2017 J jnl
Generalized Distinguishing Attack: A New Cryptanalysis of AES-like Permutations.
IACR Cryptol. ePrint Arch.
Victor Cauchois, Clément Gomez, Reynald Lercier
2017 J jnl
Grøstl Distinguishing Attack: A New Rebound Attack of an AES-like Permutation.
IACR Trans. Symmetric Cryptol.
Victor Cauchois, Clément Gomez, Reynald Lercier
2016 J jnl
Explicit Galois obstruction and descent for hyperelliptic curves with tamely cyclic reduced automorphism group.
Math. Comput.
Reynald Lercier, Christophe Ritzenthaler, Jeroen Sijsling
2014 J jnl
Parametrizing the moduli space of curves and applications to smooth plane quartics over finite fields.
LMS J. Comput. Math.
Reynald Lercier, Christophe Ritzenthaler, Florent Rovetta, Jeroen Sijsling
2014 J jnl
The geometry of some parameterizations and encodings.
Adv. Math. Commun.
Jean Marc Couveignes, Reynald Lercier
2013 B conf
An explicit expression of the Lüroth invariant.
ISSAC
Romain Basson, Reynald Lercier, Christophe Ritzenthaler, Jeroen Sijsling
2011 — ch.
Number Field Sieve for the DLP.
Encyclopedia of Cryptography and Security (2nd Ed.)
Antoine Joux, Reynald Lercier
2010 C conf
Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time.
Pairing
Jean-Gabriel Kammerer, Reynald Lercier, Guénaël Renault
2010 J jnl
Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time
CoRR
Jean-Gabriel Kammerer, Reynald Lercier, Guénaël Renault
2009 J jnl
Elliptic periods for finite fields.
Finite Fields Their Appl.
Jean Marc Couveignes, Reynald Lercier
2009 J jnl
Normal Elliptic Bases and Torus-Based Cryptography
CoRR
Clément Dunand, Reynald Lercier
2009 C conf
Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms.
IMACC
Antoine Joux, Reynald Lercier, David Naccache, Emmanuel Thomé
2008 C conf
Fault Attack onElliptic Curve Montgomery Ladder Implementation.
FDTC
Pierre-Alain Fouque, Reynald Lercier, Denis Réal, Frédéric Valette
2008 J jnl
Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms.
IACR Cryptol. ePrint Arch.
Antoine Joux, Reynald Lercier, David Naccache, Emmanuel Thomé
2006 J jnl
Counting points on elliptic curves in medium characteristic.
IACR Cryptol. ePrint Arch.
Antoine Joux, Reynald Lercier
2006 A* conf
The Function Field Sieve in the Medium Prime Case.
EUROCRYPT
Antoine Joux, Reynald Lercier
2006 A* conf
The Number Field Sieve in the Medium Prime Case.
CRYPTO
Antoine Joux, Reynald Lercier, Nigel P. Smart, Frederik Vercauteren
2005 — ch.
Point Counting on Elliptic and Hyperelliptic Curves.
Handbook of Elliptic and Hyperelliptic Curve Cryptography
Reynald Lercier, David Lubicz, Frederik Vercauteren
2004 J jnl
FRMAC, a Fast Randomized Message Authentication Code.
IACR Cryptol. ePrint Arch.
Éliane Jaulmes, Reynald Lercier
2003 A* conf
Counting Points on Elliptic Curves over Finite Fields of Small Characteristic in Quasi Quadratic Time.
EUROCRYPT
Reynald Lercier, David Lubicz
2003 J jnl
Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method.
Math. Comput.
Antoine Joux, Reynald Lercier
2002 — conf
The Function Field Sieve Is Quite Special.
ANTS
Antoine Joux, Reynald Lercier
2001 J jnl
"Chinese & Match", an alternative to Atkin's "Match and Sort" method used in the SEA algorithm.
Math. Comput.
Antoine Joux, Reynald Lercier
2000 J jnl
Computing isogenies between elliptic curves over F
Math. Comput.
Reynald Lercier, François Morain
1997 — —
Algorithmique des courbes elliptiques dans les corps finis. (Algorithms for elliptic curves over finite fields).
Reynald Lercier
1997 A* conf
Finding Good Random Elliptic Curves for Cryptosystems Defined over F
EUROCRYPT
Reynald Lercier
1996 — conf
Computing Isogenies in F
ANTS
Reynald Lercier
1995 A* conf
Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance.
EUROCRYPT
Reynald Lercier, François Morain