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:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Lattice Enumeration and Automorphisms for Tower NFS: A 521-Bit Discrete Logarithm Computation.
J. Cryptol., March, 2024
Adv. Math. Commun., 2024
2023
Des. Codes Cryptogr., December, 2023
Proceedings of the 6th International Conference on Historical Cryptology, 2023
2021
IACR Cryptol. ePrint Arch., 2021
2020
Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields.
IACR Cryptol. ePrint Arch., 2020
2019
IACR Cryptol. ePrint Arch., 2019
Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices.
Des. Codes Cryptogr., 2019
2018
2016
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
The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015
2014
LMS J. Comput. Math., 2014
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
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