Cécile Pierrot

Orcid: 0000-0001-5417-7133

According to our database1, Cécile Pierrot authored at least 19 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Lattice Enumeration and Automorphisms for Tower NFS: A 521-Bit Discrete Logarithm Computation.
J. Cryptol., March, 2024

2023
Individual discrete logarithm with sublattice reduction.
Des. Codes Cryptogr., December, 2023

Discrete Logarithm Factory.
IACR Cryptol. ePrint Arch., 2023

Deciphering Charles Quint (A diplomatic letter from 1547).
Proceedings of the 6th International Conference on Historical Cryptology, 2023

2021
Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation.
IACR Cryptol. ePrint Arch., 2021

2020
Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields.
IACR Cryptol. ePrint Arch., 2020

2019
A Tale of Three Signatures: practical attack of ECDSA with wNAF.
IACR Cryptol. ePrint Arch., 2019

Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms.
IACR Cryptol. ePrint Arch., 2019

Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices.
Des. Codes Cryptogr., 2019

2018
Malleability of the blockchain's entropy.
Cryptogr. Commun., 2018

2016
Le logarithme discret dans les corps finis. (Discrete logarithm in finite fields).
PhD thesis, 2016

Technical history of discrete logarithms in small characteristic finite fields - The road from subexponential to quasi-polynomial complexity.
Des. Codes Cryptogr., 2016

2015
Nearly Sparse Linear Algebra.
IACR Cryptol. ePrint Arch., 2015

The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

2014
The multiple number field sieve for medium- and high-characteristic finite fields.
LMS J. Comput. Math., 2014

The Multiple Number Field Sieve with Conjugation Method.
IACR Cryptol. ePrint Arch., 2014

Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms - Simplified Setting for Small Characteristic Finite Fields.
IACR Cryptol. ePrint Arch., 2014

The Past, Evolving Present, and Future of the Discrete Logarithm.
Proceedings of the Open Problems in Mathematics and Computational Science, 2014

2013
The Special Number Field Sieve in F<sub>p<sup>n</sup></sub>, Application to Pairing-Friendly Constructions.
IACR Cryptol. ePrint Arch., 2013


  Loading...