Relational Reasoning via Probabilistic Coupling. - Gilles Barthe; Thomas Espitau; Benjamin Grégoire; Justin Hsu; Léo Stefanesco; Pierre-Yves Strub (LPAR, 2015)

Higher-Order Differential Meet-in-The-Middle Preimage Attacks on SHA-1 and BLAKE. - Thomas Espitau; Pierre-Alain Fouque; Pierre Karpman (IACR Cryptol. ePrint Arch., 2015)

Synthesizing Probabilistic Invariants via Doob's Decomposition. - Gilles Barthe; Thomas Espitau; Luis María Ferrer Fioriti; Justin Hsu (CAV (1), 2016)

Loop-Abort Faults on Lattice-Based Fiat-Shamir and Hash-and-Sign Signatures. - Thomas Espitau; Pierre-Alain Fouque; Benoît Gérard; Mehdi Tibouchi (SAC, 2016)

Computing generator in cyclotomic integer rings. - Thomas Espitau; Pierre-Alain Fouque; Alexandre Gélin; Paul Kirchner (IACR Cryptol. ePrint Arch., 2016)

Loop abort Faults on Lattice-Based Fiat-Shamir & Hash'n Sign signatures. - Thomas Espitau; Pierre-Alain Fouque; Benoît Gérard; Mehdi Tibouchi (IACR Cryptol. ePrint Arch., 2016)

Adaptive precision LLL and Potential-LLL reductions with Interval arithmetic. - Thomas Espitau; Antoine Joux (IACR Cryptol. ePrint Arch., 2016)

Computing Generator in Cyclotomic Integer Rings - A Subfield Algorithm for the Principal Ideal Problem in L|Δ𝕂|(½) and Application to the Cryptanalysis of a FHE Scheme. - Jean-François Biasse; Thomas Espitau; Pierre-Alain Fouque; Alexandre Gélin; Paul Kirchner (EUROCRYPT (1), 2017)

*-Liftings for Differential Privacy. - Gilles Barthe; Thomas Espitau; Justin Hsu; Tetsuya Sato 001; Pierre-Yves Strub (ICALP, 2017)

Proving uniformity and independence by self-composition and coupling. - Gilles Barthe; Thomas Espitau; Benjamin Grégoire; Justin Hsu; Pierre-Yves Strub (LPAR, 2017)

Computing generator in cyclotomic integer rings, A subfield algorithm for the Principal Ideal Problem in L(1/2) and application to cryptanalysis of a FHE scheme. - Jean-François Biasse; Thomas Espitau; Pierre-Alain Fouque; Alexandre Gélin; Paul Kirchner (IACR Cryptol. ePrint Arch., 2017)

Side-Channel Attacks on BLISS Lattice-Based Signatures - Exploiting Branch Tracing Against strongSwan and Electromagnetic Emanations in Microcontrollers. - Thomas Espitau; Pierre-Alain Fouque; Benoît Gérard; Mehdi Tibouchi (IACR Cryptol. ePrint Arch., 2017)

An Assertion-Based Program Logic for Probabilistic Programs. - Gilles Barthe; Thomas Espitau; Marco Gaboardi; Benjamin Grégoire; Justin Hsu; Pierre-Yves Strub (ESOP, 2018)

LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS. - Jonathan Bootle; Claire Delaplace; Thomas Espitau; Pierre-Alain Fouque; Mehdi Tibouchi (IACR Cryptol. ePrint Arch., 2018)

Proving expected sensitivity of probabilistic programs. - Gilles Barthe; Thomas Espitau; Benjamin Grégoire; Justin Hsu; Pierre-Yves Strub (Proc. ACM Program. Lang., 2018)

Loop-Abort Faults on Lattice-Based Signature Schemes and Key Exchange Protocols. - Thomas Espitau; Pierre-Alain Fouque; Benoît Gérard; Mehdi Tibouchi (IEEE Trans. Computers, 2018)

GALACTICS: Gaussian Sampling for Lattice-Based Constant-Time Implementation of Cryptographic Signatures, Revisited. - Gilles Barthe; Sonia Belaïd; Thomas Espitau; Pierre-Alain Fouque; Mélissa Rossi; Mehdi Tibouchi (IACR Cryptol. ePrint Arch., 2019)

Algebraic and Euclidean Lattices: Optimal Lattice Reduction and Beyond. - Paul Kirchner; Thomas Espitau; Pierre-Alain Fouque (IACR Cryptol. ePrint Arch., 2019)

Relational ⋆⋆ star-Liftings for Differential Privacy. - Gilles Barthe; Thomas Espitau; Justin Hsu; Tetsuya Sato 001; Pierre-Yves Strub (Log. Methods Comput. Sci., 2019)

Fast Reduction of Algebraic Lattices over Cyclotomic Fields. - Paul Kirchner; Thomas Espitau; Pierre-Alain Fouque (CRYPTO (2), 2020)

On a Dual/Hybrid Approach to Small Secret LWE - A Dual/Enumeration Technique for Learning with Errors and Application to Security Estimates of FHE Schemes. - Thomas Espitau; Antoine Joux; Natalia Kharchenko (INDOCRYPT, 2020)

Certified lattice reduction. - Thomas Espitau; Antoine Joux (Adv. Math. Commun., 2020)

On a hybrid approach to solve binary-LWE. - Thomas Espitau; Antoine Joux; Natalia Kharchenko (IACR Cryptol. ePrint Arch., 2020)

The nearest-colattice algorithm. - Thomas Espitau; Paul Kirchner (IACR Cryptol. ePrint Arch., 2020)

Algorithmic aspects of algebraic lattices. (Aspects algorithmiques des réseaux algébriques). - Thomas Espitau (2020)

Mitaka: Faster, Simpler, Parallelizable and Maskable Hash-and-Sign Signatures on NTRU Lattices. - Thomas Espitau (APKC@AsiaCCS, 2021)

Towards Faster Polynomial-Time Lattice Reduction. - Paul Kirchner; Thomas Espitau; Pierre-Alain Fouque (CRYPTO (2), 2021)

Mitaka: a simpler, parallelizable, maskable variant of Falcon. - Thomas Espitau; Pierre-Alain Fouque; François Gérard; Mélissa Rossi; Akira Takahashi 002; Mehdi Tibouchi; Alexandre Wallet; Yang Yu 008 (IACR Cryptol. ePrint Arch., 2021)

Guessing Bits: Improved Lattice Attacks on (EC)DSA. - Chao Sun; Thomas Espitau; Mehdi Tibouchi; Masayuki Abe (IACR Cryptol. ePrint Arch., 2021)

Quantum binary quadratic form reduction. - Nicolas David; Thomas Espitau; Akinori Hosoyamada (IACR Cryptol. ePrint Arch., 2022)

Shorter Hash-and-Sign Lattice-Based Signatures. - Thomas Espitau; Mehdi Tibouchi; Alexandre Wallet; Yang Yu 008 (IACR Cryptol. ePrint Arch., 2022)

Guessing Bits: Improved Lattice Attacks on (EC)DSA with Nonce Leakage. - Chao Sun; Thomas Espitau; Mehdi Tibouchi; Masayuki Abe (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2022)

Antrag: Annular NTRU Trapdoor Generation - Making Mitaka as Secure as Falcon. - Thomas Espitau; Thi Thu Quyen Nguyen; Chao Sun; Mehdi Tibouchi; Alexandre Wallet (ASIACRYPT (7), 2023)

Finding short integer solutions when the modulus is small. - Léo Ducas; Thomas Espitau; Eamonn W. Postlethwaite (IACR Cryptol. ePrint Arch., 2023)

Antrag: Annular NTRU Trapdoor Generation. - Thomas Espitau; Thi Thu Quyen Nguyen; Chao Sun; Mehdi Tibouchi; Alexandre Wallet (IACR Cryptol. ePrint Arch., 2023)

On Gaussian sampling, smoothing parameter and application to signatures. - Thomas Espitau; Alexandre Wallet; Yang Yu 008 (IACR Cryptol. ePrint Arch., 2023)

Cryptanalysis of the Peregrine Lattice-Based Signature Scheme. - Xiuhan Lin; Moeto Suzuki; Shiduo Zhang; Thomas Espitau; Yang Yu 008; Mehdi Tibouchi; Masayuki Abe (IACR Cryptol. ePrint Arch., 2023)

Plover: Masking-Friendly Hash-and-Sign Lattice Signatures. - Muhammed F. Esgin; Thomas Espitau; Guilhem Niot; Thomas Prest; Amin Sakzad; Ron Steinfeld (IACR Cryptol. ePrint Arch., 2024)

Flood and Submerse: Distributed Key Generation and Robust Threshold Signature from Lattices. - Thomas Espitau; Guilhem Niot; Thomas Prest (IACR Cryptol. ePrint Arch., 2024)

On hermitian decomposition lattices and the module-LIP problem in rank 2. - Thomas Espitau; Heorhii Pliatsok (IACR Cryptol. ePrint Arch., 2024)

Masking the GLP Lattice-Based Signature Scheme at Any Order. - Gilles Barthe; Sonia Belaïd; Thomas Espitau; Pierre-Alain Fouque; Benjamin Grégoire; Mélissa Rossi; Mehdi Tibouchi (J. Cryptol., 2024)

Recursive lattice reduction - A framework for finding short lattice vectors. - Divesh Aggarwal; Thomas Espitau; Spencer Peters; Noah Stephens-Davidowitz (SOSA, 2025)

Threshold Signatures Reloaded: ML-DSA and Enhanced Raccoon with Identifiable Aborts. - Giacomo Borin; Sofía Celi; Rafaël del Pino; Thomas Espitau; Guilhem Niot; Thomas Prest (IACR Cryptol. ePrint Arch., 2025)

A reduction from Hawk to the principal ideal problem in a quaternion algebra. - Clémence Chevignard; Guilhem Mureau; Thomas Espitau; Alice Pellet-Mary; Heorhii Pliatsok; Alexandre Wallet (IACR Cryptol. ePrint Arch., 2025)

Simple and Efficient Lattice Threshold Signatures with Identifiable Aborts. - Rafaël Del Pino; Thomas Espitau; Guilhem Niot; Thomas Prest (IACR Cryptol. ePrint Arch., 2025)

Two-Round Threshold Signature from Algebraic One-More Learning with Errors. - Thomas Espitau; Shuichi Katsumata; Kaoru Takemure (J. Cryptol., 2025)