Reynald Lercier

According to our database, Reynald Lercier authored at least 28 papers between 1995 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Reconstructing Plane Quartics from Their Invariants.

Reynald Lercier, Christophe Ritzenthaler, Jeroen Sijsling

Discret. Comput. Geom., 2020

2019

Distributions of Traces of Frobenius for Smooth Plane Curves Over Finite Fields.

Reynald Lercier, Christophe Ritzenthaler, Florent Rovetta, Jeroen Sijsling, Benjamin Smith

Exp. Math., 2019

2017

Grøstl Distinguishing Attack: A New Rebound Attack of an AES-like Permutation.

Victor Cauchois, Clément Gomez, Reynald Lercier

IACR Trans. Symmetric Cryptol., 2017

Generalized Distinguishing Attack: A New Cryptanalysis of AES-like Permutations.

Victor Cauchois, Clément Gomez, Reynald Lercier

IACR Cryptol. ePrint Arch., 2017

2016

Explicit Galois obstruction and descent for hyperelliptic curves with tamely cyclic reduced automorphism group.

Reynald Lercier, Christophe Ritzenthaler, Jeroen Sijsling

Math. Comput., 2016

2014

Parametrizing the moduli space of curves and applications to smooth plane quartics over finite fields.

Reynald Lercier, Christophe Ritzenthaler, Florent Rovetta, Jeroen Sijsling

LMS J. Comput. Math., 2014

The geometry of some parameterizations and encodings.

Jean Marc Couveignes, Reynald Lercier

Adv. Math. Commun., 2014

2013

An explicit expression of the Lüroth invariant.

Romain Basson, Reynald Lercier, Christophe Ritzenthaler, Jeroen Sijsling

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2011

Number Field Sieve for the DLP.

Antoine Joux, Reynald Lercier

Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

2010

Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time.

Jean-Gabriel Kammerer, Reynald Lercier, Guénaël Renault

Proceedings of the Pairing-Based Cryptography - Pairing 2010, 2010

2009

Elliptic periods for finite fields.

Jean Marc Couveignes, Reynald Lercier

Finite Fields Their Appl., 2009

Normal Elliptic Bases and Torus-Based Cryptography

Clément Dunand, Reynald Lercier

CoRR, 2009

2008

Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms.

Antoine Joux, Reynald Lercier, David Naccache, Emmanuel Thomé

IACR Cryptol. ePrint Arch., 2008

Fault Attack onElliptic Curve Montgomery Ladder Implementation.

Pierre-Alain Fouque, Reynald Lercier, Denis Réal, Frédéric Valette

Proceedings of the Fifth International Workshop on Fault Diagnosis and Tolerance in Cryptography, 2008

2006

Counting points on elliptic curves in medium characteristic.

Antoine Joux, Reynald Lercier

IACR Cryptol. ePrint Arch., 2006

The Function Field Sieve in the Medium Prime Case.

Antoine Joux, Reynald Lercier

Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

The Number Field Sieve in the Medium Prime Case.

Antoine Joux, Reynald Lercier, Nigel P. Smart, Frederik Vercauteren

Proceedings of the Advances in Cryptology, 2006

2005

Point Counting on Elliptic and Hyperelliptic Curves.

Reynald Lercier, David Lubicz, Frederik Vercauteren

Proceedings of the Handbook of Elliptic and Hyperelliptic Curve Cryptography., 2005

2004

FRMAC, a Fast Randomized Message Authentication Code.

Éliane Jaulmes, Reynald Lercier

IACR Cryptol. ePrint Arch., 2004

2003

Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method.

Antoine Joux, Reynald Lercier

Math. Comput., 2003

Counting Points on Elliptic Curves over Finite Fields of Small Characteristic in Quasi Quadratic Time.

Reynald Lercier, David Lubicz

Proceedings of the Advances in Cryptology, 2003

2002

The Function Field Sieve Is Quite Special.

Antoine Joux, Reynald Lercier

Proceedings of the Algorithmic Number Theory, 5th International Symposium, 2002

2001

"Chinese & Match", an alternative to Atkin's "Match and Sort" method used in the SEA algorithm.

Antoine Joux, Reynald Lercier

Math. Comput., 2001

2000

Computing isogenies between elliptic curves over F_pⁿ using Couveignes's algorithm.

Reynald Lercier, François Morain

Math. Comput., 2000

1997

Algorithmique des courbes elliptiques dans les corps finis. (Algorithms for elliptic curves over finite fields).

Reynald Lercier

PhD thesis, 1997

Finding Good Random Elliptic Curves for Cryptosystems Defined over F₂ⁿ.

Reynald Lercier

Proceedings of the Advances in Cryptology, 1997

1996

Computing Isogenies in F_2ⁿ.

Reynald Lercier

Proceedings of the Algorithmic Number Theory, Second International Symposium, 1996

1995

Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance.

Reynald Lercier, François Morain

Proceedings of the Advances in Cryptology, 1995