Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Reynald Lercier

dblp:33/3075 · DBLP profile ↗
← Back
11ranked-venue papers
4as first author
1since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 8 · 3 first-authorTheory of computation · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
5 papers
Cryptographic primitives and cryptanalysis · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography
0.132003
Counting Points on Elliptic Curves over Finite Fields of Small Characteristic in Quasi Quadratic Time · EUROCRYPT 2003
Finding Good Random Elliptic Curves for Cryptosystems Defined over F2n · EUROCRYPT 1997
Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance · EUROCRYPT 1995
Cryptographic primitives and cryptanalysis › discrete logarithm
function field sieve
0.112006
The Function Field Sieve in the Medium Prime Case · EUROCRYPT 2006
Cryptographic primitives and cryptanalysis
integer factorization
0.112006
The Number Field Sieve in the Medium Prime Case · CRYPTO 2006
Cryptographic primitives and cryptanalysis › integer factorization
number field sieve
0.112006
The Number Field Sieve in the Medium Prime Case · CRYPTO 2006
Cryptographic primitives and cryptanalysis › public-key cryptography › elliptic curve cryptography
point counting
0.122003
Counting Points on Elliptic Curves over Finite Fields of Small Characteristic in Quasi Quadratic Time · EUROCRYPT 2003
Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance · EUROCRYPT 1995
Cryptographic primitives and cryptanalysis › discrete logarithm
finite field discrete logarithm
0.012006
The Function Field Sieve in the Medium Prime Case · EUROCRYPT 2006
Cryptographic primitives and cryptanalysis
public-key cryptography
0.012006
The Function Field Sieve in the Medium Prime Case · EUROCRYPT 2006
Cryptographic primitives and cryptanalysis › public-key cryptography › elliptic curve cryptography
curve generation
0.011997
Finding Good Random Elliptic Curves for Cryptosystems Defined over F2n · EUROCRYPT 1997

Methods — techniques the papers use, named apart from their topics

number field sieve · 0.1quasi-quadratic algorithm · 0.0finite field arithmetic · 0.0performance evaluation · 0.0
YearPublicationVenuePosition
2026 Elliptic butterflies
Jean Marc Couveignes, Reynald Lercier
J. Complex.2
2020 Reconstructing Plane Quartics from Their Invariants
Reynald Lercier, Christophe Ritzenthaler, Jeroen Sijsling
Discret. Comput. Geom.1
2013 An explicit expression of the Lüroth invariant
abstract
In this short note, we give an algorithm that returns an explicit expression of the Lüroth invariant in terms of the Dixmier-Ohno invariants of plane quartic curves. We also obtain an explicit factorized expression on the locus of Ciani quartics in terms of the coefficients. After this calculation, we extend our methods to answer two open theoretical questions concerning the sub-locus of singular Lüroth quartics.
Romain Basson, Reynald Lercier, Christophe Ritzenthaler, Jeroen Sijsling
ISSAC2
2010 Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time
Jean-Gabriel Kammerer, Reynald Lercier, Guénaël Renault
Pairing2
2009 Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms
Antoine Joux, Reynald Lercier, David Naccache, Emmanuel Thomé
IMACC2
2008 Fault Attack onElliptic Curve Montgomery Ladder Implementation
abstract
In this paper, we present a new fault attack on elliptic curve scalar product algorithms. This attack is tailored to work on the classical Montgomery ladder method when the $y$-coordinate is not used. No weakness has been reported so far on such implementations, which are very efficient and were promoted by several authors. But taking into account the twist of the elliptic curves, we show how, with few faults (around one or two faults), we can retrieve the full secret exponent even if classical countermeasures are employed to prevent fault attacks. It turns out that this attack has not been anticipated as the security of the elliptic curve parameters in most standards can be strongly reduced. Especially, the attack is meaningful on some NIST or SECG parameters.
Pierre-Alain Fouque, Reynald Lercier, Denis Réal, Frédéric Valette
FDTC2
2006 The Number Field Sieve in the Medium Prime Case
Antoine Joux, Reynald Lercier, Nigel P. Smart, Frederik Vercauteren
CRYPTO2
2006 The Function Field Sieve in the Medium Prime Case
Antoine Joux, Reynald Lercier
EUROCRYPT2
2003 Counting Points on Elliptic Curves over Finite Fields of Small Characteristic in Quasi Quadratic Time
Reynald Lercier, David Lubicz
EUROCRYPT1
1997 Finding Good Random Elliptic Curves for Cryptosystems Defined over F2n
Reynald Lercier
EUROCRYPT1
1995 Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance
Reynald Lercier, François Morain
EUROCRYPT1