publications

recent publications in reversed chronological order

2026

  1. Threshold Niederreiter: Chosen-Ciphertext Security and Improved Distributed Decoding
    Pascal Giorgi, Fabien Laguillaumie, Lucas Ottow, and Damien Vergnaud
    Des. Codes Cryptogr. to appear, (2026).
    open access
  2. Blinding Post-Quantum Hash-and-Sign Signatures
    Charles Bouillaguet, Thibauld Feneuil, Jules Maire, Matthieu Rivain, Julia Sauvage, and Damien Vergnaud
    In IEEE Symposium on Security and Privacy, SP 2026, San Francisco, CA, USA, May 18-20, 2026 IEEE, (2026).
    open access

2025

  1. Cryptographic Primitives in Quantum Idealized Models.
    Samuel Bouaziz-Ermann,
    Thèse de doctorat. Sorbonne Université (2025).
    open access
  2. Implementations of Post-Quantum Cryptography Algorithms Secured Against Physical Attacks.
    Andersson Calle Viera,
    Thèse de doctorat. Sorbonne Université (2025).
    open access
  3. Practical cryptanalysis of pseudorandom correlation generators based on quasi-Abelian syndrome decoding
    Charles Bouillaguet, Claire Delaplace, Mickaël Hamdad, and Damien Vergnaud
    In Advances in Cryptology - ASIACRYPT 2025 - 31st International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, VIC, Australia, December 8–12, 2025, Proceedings, Part IV Springer, Lecture Notes in Computer Science, vol. 16248, pp. 436–465 (2025).
    open access doi
    winner of the Best Paper Award (Practice)
  4. Uncompressing Dilithium’s Public Key
    Paco Azevedo Oliveira, Andersson Calle Viera, Benoı̂t Cogliati, and Louis Goubin
    In Advances in Cryptology - CRYPTO 2025 - 45th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2025, Proceedings, Part I (Yael Tauman Kalai, and Seny F. Kamara, eds), Springer, Lecture Notes in Computer Science, vol. 16000, pp. 417–443 (2025).
    open access doi
  5. The May-Ozerov Algorithm for Syndrome Decoding is “Galactic”
    Charles Bouillaguet, Claire Delaplace, and Mickaël Hamdad
    IACR Comm. in Cryptology. 2, 1, (2025).
    open access doi
  6. Breaking HuFu with 0 Leakage - A Side-Channel Analysis
    Julien Devevey, Morgane Guerreau, Thomas Legavre, Ange Martinelli, and Thomas Ricosset
    In Constructive Approaches for Security Analysis and Design of Embedded Systems - First International Conference, CASCADE 2025, Saint-Etienne, France, April 2-4, 2025, Proceedings (Matthieu Rivain, and Pascal Sasdrich, eds), Springer, Lecture Notes in Computer Science, vol. 15952, pp. 93–116 (2025).
    open access doi
  7. Simple Power Analysis Assisted Chosen Cipher-Text Attack on ML-KEM
    Alexandre Berzati, Andersson Calle Viera, Maya Chartouny, and David Vigilant
    In Constructive Approaches for Security Analysis and Design of Embedded Systems - First International Conference, CASCADE 2025, Saint-Etienne, France, April 2-4, 2025, Proceedings (Matthieu Rivain, and Pascal Sasdrich, eds), Springer, Lecture Notes in Computer Science, vol. 15952, pp. 3–26 (2025).
    open access doi
  8. Compact Zero-Knowledge Arguments for Blum Integers
    Jules Maire, and Damien Vergnaud
    Theor. Comput. Sci. 1038, pp. 115155 (2025).
    open access doi
  9. Finding a Polytope: A Practical Fault Attack Against Dilithium
    Paco Azevedo Oliveira, Andersson Calle Viera, Benoı̂t Cogliati, and Louis Goubin
    In Public-Key Cryptography - PKC 2025 - 28th IACR International Conference on Practice and Theory of Public-Key Cryptography, Røros, Norway, May 12-15, 2025, Proceedings, Part I (Tibor Jager, and Jiaxin Pan, eds), Springer, Lecture Notes in Computer Science, vol. 15674, pp. 259–283 (2025).
    open access doi

2024

  1. Amélioration des algorithmes de crible. Application à la factorisation des entiers.
    Ambroise Fleury,
    Thèse de doctorat. Université Paris-Saclay (2024).
    open access
  2. Zero-knowledge arguments from secure multiparty computation.
    Jules Maire,
    Thèse de doctorat. Sorbonne Université (2024).
    open access
  3. Fast Secure Computations on Shared Polynomials and Applications to Private Set Operations
    Pascal Giorgi, Fabien Laguillaumie, Lucas Ottow, and Damien Vergnaud
    In 5th Conference on Information-Theoretic Cryptography, ITC 2024, August 14-16, 2024, Stanford, CA, USA (Divesh Aggarwal, ed), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, LIPIcs, vol. 304, pp. 11:1–11:24 (2024).
    open access doi
  4. Algorithm 1052: Evaluating a Boolean Polynomial on All Possible Inputs
    Charles Bouillaguet,
    ACM Trans. Math. Softw. 50, 4, pp. 28:1–28:37 (2024).
    open access doi
  5. Preliminary Cryptanalysis of the Biscuit Signature Scheme
    Charles Bouillaguet, and Julia Sauvage
    IACR Comm. in Cryptology. 1, 1, (2024).
    open access doi
  6. Towards the Impossibility of Quantum Public Key Encryption with Classical Keys from One-Way Functions
    Samuel Bouaziz-Ermann, Alex B. Grilo, Damien Vergnaud, and Quoc-Huy Vu
    IACR Comm. in Cryptology. 1, 1, (2024).
    open access doi
  7. Secure Multi-Party Linear Algebra with Perfect Correctness
    Jules Maire, and Damien Vergnaud
    IACR Comm. in Cryptology. 1, 1, (2024).
    open access doi
  8. Lattice attacks on pairing-based signatures
    Thierry Mefenza, and Damien Vergnaud
    Inf. Secur. J. A Glob. Perspect. 33, 2, pp. 138-157 (2024).
    open access doi