Cécile Pierrot

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms Advances in Mathematics of Communications	2024-08-06	Paper
Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation Journal of Cryptology	2024-01-23	Paper
Individual discrete logarithm with sublattice reduction Designs, Codes and Cryptography	2023-11-20	Paper
Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation Lecture Notes in Computer Science	2023-05-12	Paper
Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields	2022-11-09	Paper
A tale of three signatures: practical attack of ECDSA with wNAF Progress in Cryptology - AFRICACRYPT 2020	2022-11-09	Paper
Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms	2019-07-05	Paper
Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices Designs, Codes and Cryptography	2019-06-27	Paper
Malleability of the blockchain's entropy Cryptography and Communications	2018-01-29	Paper
scientific article; zbMATH DE number 6696740 (Why is no real title available?)	2017-03-23	Paper
Nearly sparse linear algebra and application to discrete logarithms computations Contemporary Developments in Finite Fields and Applications	2016-11-08	Paper
Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity Designs, Codes and Cryptography	2016-02-02	Paper
The multiple number field sieve with conjugation and generalized Joux-Lercier methods Advances in Cryptology -- EUROCRYPT 2015	2015-09-30	Paper
The past, evolving present, and future of the discrete logarithm Open Problems in Mathematics and Computational Science	2015-06-22	Paper
Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms Lecture Notes in Computer Science	2015-01-16	Paper
The multiple number field sieve for medium- and high-characteristic finite fields LMS Journal of Computation and Mathematics	2014-09-05	Paper
The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$ Pairing-Based Cryptography – Pairing 2013	2014-02-18	Paper

Research outcomes over time

This page was built for person: Cécile Pierrot