default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCécile Pierrot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2016
[b1]Cécile Pierrot:
Le logarithme discret dans les corps finis. (Discrete logarithm in finite fields). Pierre and Marie Curie University, Paris, France, 2016
Journal Articles
- 2024
- [j7]Haetham Al Aswad, Emmanuel Thomé, Cécile Pierrot:
Discrete Logarithm Factory. IACR Commun. Cryptol. 1(3): 23 (2024) - [j6]Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot:
Lattice Enumeration and Automorphisms for Tower NFS: A 521-Bit Discrete Logarithm Computation. J. Cryptol. 37(1): 6 (2024) - 2023
- [j5]Haetham Al Aswad
, Cécile Pierrot:
Individual discrete logarithm with sublattice reduction. Des. Codes Cryptogr. 91(12): 4059-4091 (2023) - 2019
- [j4]Léo Ducas, Cécile Pierrot:
Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices. Des. Codes Cryptogr. 87(8): 1737-1748 (2019) - 2018
- [j3]Cécile Pierrot, Benjamin Wesolowski:
Malleability of the blockchain's entropy. Cryptogr. Commun. 10(1): 211-233 (2018) - 2016
- [j2]Antoine Joux, Cécile Pierrot:
Technical history of discrete logarithms in small characteristic finite fields - The road from subexponential to quasi-polynomial complexity. Des. Codes Cryptogr. 78(1): 73-85 (2016) - 2014
- [j1]Razvan Barbulescu, Cécile Pierrot:
The multiple number field sieve for medium- and high-characteristic finite fields. LMS J. Comput. Math. 17(Theory): 230-246 (2014)
Conference and Workshop Papers
- 2023
- [c7]Cécile Pierrot, Camille Desenclos, Pierrick Gaudry, Paul Zimmermann:
Deciphering Charles Quint (A diplomatic letter from 1547). HistoCrypt 2023: 148-159 - 2021
- [c6]Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot:
Lattice Enumeration for Tower NFS: A 521-Bit Discrete Logarithm Computation. ASIACRYPT (1) 2021: 67-96 - 2020
- [c5]Gabrielle De Micheli, Rémi Piau, Cécile Pierrot:
A Tale of Three Signatures: Practical Attack of ECDSA with wNAF. AFRICACRYPT 2020: 361-381 - [c4]Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot:
Asymptotic Complexities of Discrete Logarithm Algorithms in Pairing-Relevant Finite Fields. CRYPTO (2) 2020: 32-61 - 2015
- [c3]Cécile Pierrot:
The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods. EUROCRYPT (1) 2015: 156-170 - 2014
- [c2]Antoine Joux, Cécile Pierrot:
Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms - Simplified Setting for Small Characteristic Finite Fields. ASIACRYPT (1) 2014: 378-397 - 2013
- [c1]Antoine Joux, Cécile Pierrot:
The Special Number Field Sieve in 𝔽pn - Application to Pairing-Friendly Constructions. Pairing 2013: 45-61
Parts in Books or Collections
- 2014
- [p1]Antoine Joux, Andrew M. Odlyzko, Cécile Pierrot:
The Past, Evolving Present, and Future of the Discrete Logarithm. Open Problems in Mathematics and Computational Science 2014: 5-36
Informal and Other Publications
- 2023
- [i14]Haetham Al Aswad, Cécile Pierrot, Emmanuel Thomé:
Discrete Logarithm Factory. IACR Cryptol. ePrint Arch. 2023: 834 (2023) - 2022
- [i13]Haetham Al Aswad, Cécile Pierrot:
Individual Discrete Logarithm with Sublattice Reduction. IACR Cryptol. ePrint Arch. 2022: 912 (2022) - 2021
- [i12]Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot:
Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation. IACR Cryptol. ePrint Arch. 2021: 707 (2021) - 2020
- [i11]Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot:
Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields. IACR Cryptol. ePrint Arch. 2020: 329 (2020) - 2019
- [i10]Antoine Joux, Cécile Pierrot:
Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms. CoRR abs/1907.02689 (2019) - [i9]Antoine Joux, Cécile Pierrot:
Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms. IACR Cryptol. ePrint Arch. 2019: 782 (2019) - [i8]Gabrielle De Micheli, Rémi Piau, Cécile Pierrot:
A Tale of Three Signatures: practical attack of ECDSA with wNAF. IACR Cryptol. ePrint Arch. 2019: 861 (2019) - 2018
- [i7]Léo Ducas, Cécile Pierrot:
Polynomial Time Bounded Distance Decoding near Minkowski's Bound in Discrete Logarithm Lattices. IACR Cryptol. ePrint Arch. 2018: 146 (2018) - 2016
- [i6]Cécile Pierrot, Benjamin Wesolowski:
Malleability of the blockchain's entropy. IACR Cryptol. ePrint Arch. 2016: 370 (2016) - 2015
- [i5]Antoine Joux, Cécile Pierrot:
Nearly Sparse Linear Algebra. IACR Cryptol. ePrint Arch. 2015: 930 (2015) - 2014
- [i4]Razvan Barbulescu, Cécile Pierrot:
The Multiple Number Field Sieve for Medium and High Characteristic Finite Fields. IACR Cryptol. ePrint Arch. 2014: 147 (2014) - [i3]Cécile Pierrot:
The Multiple Number Field Sieve with Conjugation Method. IACR Cryptol. ePrint Arch. 2014: 641 (2014) - [i2]Antoine Joux, Cécile Pierrot:
Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms - Simplified Setting for Small Characteristic Finite Fields. IACR Cryptol. ePrint Arch. 2014: 924 (2014) - 2013
- [i1]Antoine Joux, Cécile Pierrot:
The Special Number Field Sieve in Fpn, Application to Pairing-Friendly Constructions. IACR Cryptol. ePrint Arch. 2013: 582 (2013)
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 2024-10-30 21:34 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:
