default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDReynald Lercier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j10]Reynald Lercier, Christophe Ritzenthaler, Jeroen Sijsling
:
Reconstructing Plane Quartics from Their Invariants. Discret. Comput. Geom. 63(1): 73-113 (2020)
2010 – 2019
- 2019
- [j9]Reynald Lercier, Christophe Ritzenthaler, Florent Rovetta, Jeroen Sijsling, Benjamin Smith:
Distributions of Traces of Frobenius for Smooth Plane Curves Over Finite Fields. Exp. Math. 28(1): 39-48 (2019) - 2017
- [j8]Victor Cauchois, Clément Gomez, Reynald Lercier:
Grøstl Distinguishing Attack: A New Rebound Attack of an AES-like Permutation. IACR Trans. Symmetric Cryptol. 2017(3): 1-23 (2017) - [i6]Victor Cauchois, Clément Gomez, Reynald Lercier:
Generalized Distinguishing Attack: A New Cryptanalysis of AES-like Permutations. IACR Cryptol. ePrint Arch. 2017: 508 (2017) - 2016
- [j7]Reynald Lercier, Christophe Ritzenthaler, Jeroen Sijsling:
Explicit Galois obstruction and descent for hyperelliptic curves with tamely cyclic reduced automorphism group. Math. Comput. 85(300): 2011-2045 (2016) - 2014
- [j6]Jean Marc Couveignes, Reynald Lercier:
The geometry of some parameterizations and encodings. Adv. Math. Commun. 8(4): 437-458 (2014) - [j5]Reynald Lercier, Christophe Ritzenthaler, Florent Rovetta, Jeroen Sijsling:
Parametrizing the moduli space of curves and applications to smooth plane quartics over finite fields. LMS J. Comput. Math. 17(Theory): 128-147 (2014) - 2013
- [c11]Romain Basson, Reynald Lercier, Christophe Ritzenthaler, Jeroen Sijsling:
An explicit expression of the Lüroth invariant. ISSAC 2013: 31-36 - 2011
- [r2]Antoine Joux, Reynald Lercier:
Number Field Sieve for the DLP. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 867-873 - 2010
- [c10]Jean-Gabriel Kammerer, Reynald Lercier, Guénaël Renault:
Encoding Points on Hyperelliptic Curves over Finite Fields in Deterministic Polynomial Time. Pairing 2010: 278-297 - [i5]Jean-Gabriel Kammerer, Reynald Lercier, Guénaël Renault:
Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time. CoRR abs/1005.1454 (2010)
2000 – 2009
- 2009
- [j4]Jean Marc Couveignes, Reynald Lercier:
Elliptic periods for finite fields. Finite Fields Their Appl. 15(1): 1-22 (2009) - [c9]Antoine Joux, Reynald Lercier, David Naccache, Emmanuel Thomé:
Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms. IMACC 2009: 351-367 - [i4]Clément Dunand, Reynald Lercier:
Normal Elliptic Bases and Torus-Based Cryptography. CoRR abs/0909.0236 (2009) - 2008
- [c8]Pierre-Alain Fouque, Reynald Lercier, Denis Réal, Frédéric Valette:
Fault Attack onElliptic Curve Montgomery Ladder Implementation. FDTC 2008: 92-98 - [i3]Antoine Joux, Reynald Lercier, David Naccache, Emmanuel Thomé:
Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms. IACR Cryptol. ePrint Arch. 2008: 217 (2008) - 2006
- [c7]Antoine Joux, Reynald Lercier, Nigel P. Smart, Frederik Vercauteren:
The Number Field Sieve in the Medium Prime Case. CRYPTO 2006: 326-344 - [c6]Antoine Joux, Reynald Lercier:
The Function Field Sieve in the Medium Prime Case. EUROCRYPT 2006: 254-270 - [i2]Antoine Joux, Reynald Lercier:
Counting points on elliptic curves in medium characteristic. IACR Cryptol. ePrint Arch. 2006: 176 (2006) - 2005
- [r1]Reynald Lercier, David Lubicz, Frederik Vercauteren:
Point Counting on Elliptic and Hyperelliptic Curves. Handbook of Elliptic and Hyperelliptic Curve Cryptography 2005: 406-453 - 2004
- [i1]Éliane Jaulmes, Reynald Lercier:
FRMAC, a Fast Randomized Message Authentication Code. IACR Cryptol. ePrint Arch. 2004: 166 (2004) - 2003
- [j3]Antoine Joux, Reynald Lercier:
Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method. Math. Comput. 72(242): 953-967 (2003) - [c5]Reynald Lercier, David Lubicz:
Counting Points on Elliptic Curves over Finite Fields of Small Characteristic in Quasi Quadratic Time. EUROCRYPT 2003: 360-373 - 2002
- [c4]Antoine Joux, Reynald Lercier:
The Function Field Sieve Is Quite Special. ANTS 2002: 431-445 - 2001
- [j2]Antoine Joux, Reynald Lercier:
"Chinese & Match", an alternative to Atkin's "Match and Sort" method used in the SEA algorithm. Math. Comput. 70(234): 827-836 (2001) - 2000
- [j1]Reynald Lercier, François Morain:
Computing isogenies between elliptic curves over Fpn using Couveignes's algorithm. Math. Comput. 69(229): 351-370 (2000)
1990 – 1999
- 1997
- [b1]Reynald Lercier:
Algorithmique des courbes elliptiques dans les corps finis. (Algorithms for elliptic curves over finite fields). École Polytechnique, Palaiseau, France, 1997 - [c3]Reynald Lercier:
Finding Good Random Elliptic Curves for Cryptosystems Defined over F2n. EUROCRYPT 1997: 379-392 - 1996
- [c2]Reynald Lercier:
Computing Isogenies in F2n. ANTS 1996: 197-212 - 1995
- [c1]Reynald Lercier, François Morain:
Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance. EUROCRYPT 1995: 79-94
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
