Preprint

1. Accelerating the Tower Number Field Sieve with Galois Automorphisms.
   with Haetham Al Aswad and Emmanuel Thomé
   To come soon
   
   
2. A Caribbean Directory-based Encryption during the American War of Independence.
   with Olivier Chaline, Gaspard Damoiseau-Malraux, Paul Mekhail and Ludovic Perret
   Submitted
   
   

Record computation

• Discovery of a discrete logarithm in GF(p^6) with Tower NFS.
  with Gabrielle De Micheli and Pierrick Gaudry
  February 2021 [Verification script]

Publications

1. Discrete Logarithm Factory.
   with Haetham Al Aswad and Emmanuel Thomé
   IACR Communications in Cryptology, 2024
   
   
2. Deciphering Charles Quint (A diplomatic letter from 1547).
   with Camille Désenclos, Pierrick Gaudry and Paul Zimmermann
   Histocrypt, 2023
   
   
3. Individual Discrete Logarithm with Sublattice Reduction.
   with Haetham Al Aswad
   Designs, Codes and Cryptography, 2023
   
   
4. Lattice Enumeration and Automorphisms for Tower NFS: a 521-bit Discrete Logarithm Computation.
   with Gabrielle de Micheli and Pierrick Gaudry
   Journal of Cryptology, 2023
   
   
5. Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms.
   with Antoine Joux
   Advances in Mathematics of Communications, 2022
   
   
6. Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation.
   with Gabrielle de Micheli and Pierrick Gaudry
   Asiacrypt 2021, Best Paper
   
   
7. Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields.
   with Gabrielle De Micheli and Pierrick Gaudry
   Crypto 2020
   
   
8. A Tale of Three Signatures: practical attack of ECDSA with wNAF.
   with Gabrielle De Micheli and Rémi Piau
   Africacrypt 2020
   
   
9. Polynomial Time Bounded Distance Decoding near Minkowski’s Bound in Discrete Logarithm Lattices
   with Léo Ducas
   Design, Code and Cryptography (DCC), 2018
   This is a post-peer-review, pre-copyedit version of an article published in Design, Code and Cryptography. The final authenticated version is available online at: http://dx.doi.org/10.1007/s10623-018-0573-3
   
   
10. Malleability of the Blockchain's Entropy
    with Benjamin Wesolowski
    Cryptography and Communications (CCDS), Springer, 2017
    Presented at ArcticCrypt Conference 2016
    
    
11. Nearly Sparse Linear Algebra, and Applications to Discrete Logarithms Computations
    with Antoine Joux
    Review Volume « Contemporary Developments in Finite Fields and Applications »
    2016 copyright World Scientific Publishing Company
    
    
12. Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity.
    with Antoine Joux
    Journal of Designs, Codes and Cryptography, 2016
    
    
13. The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods
    Eurocrypt 2015
    
    
14. Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms, Simplified Setting for Small Characteristic Finite Fields
    with Antoine Joux
    Asiacrypt 2014
    
    
15. The Multiple Number Field Sieve for Medium and High Characteristic Finite Fields
    with Razvan Barbulescu
    LMS Journal of Computation and Mathematics
    Presented at ANTS XI, 2014, South Korea
    
    
16. The Past, evolving Present and Future of Discrete Logarithm
    with Antoine Joux and Andrew Odlyzko
    Open Problems in Mathematical and Computational Science Book, Springer, 2014
    I aknowledge the ePublisher Springer to let me self-archive my chapter. The full book can be downloaded on Springer's website.
    
    
17. The Special Number Field Sieve in Finite Fields, Application to Pairing-Friendly Constructions
    with Antoine Joux
    Pairing 2013
    
    

Reports and manuscripts (in French)

1. Le problème du logarithme discret dans les corps finis.
   PhD Thesis, defended on Nov. 25th, 2016, in UPMC, Sorbonne-Universités, Paris 6. I still have some printed manuscripts, tell me if you would like to have one.
   
   
2. Calculs de logarithmes discret dans les corps finis par cribles spécial de corps de nombres, Application aux courbes elliptiques bien couplées.
   Mémoire de Master 2 : Algèbre Appliquée à la Cryptographie et au Calcul Formel, Université de Versailles, Septembre 2013

Other articles in French

1. 1024, le Bulletin de la Société Informatique de France (SIF) : La cryptographie à l'honneur : Diffie et Hellman, prix Turing 2015 , 2016.
2. La Gazette de la Société Mathématique de France (SMF) : Discrétion Assurée, est paru en 2015 et relate, pour un public de mathématiciens, les avancées de la résolution du problème du logarithme discret dans les corps finis de petite caractéristique.