- My recent papers are available on HAL.
- Click here for my DBLP list of publications, which is almost complete.
- Click here for my entry on the IACR database.
- For my Habilitation, see there.
- For my Ph.D., see there.
Books
- Proceedings of ISC 2017: 20th International Conference on Information Security (Springer, LNCS 10599, 2017)
- Proceedings of EUROCRYPT 2014: 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques (Springer, LNCS 8441, 2014)
- Proceedings of EUROCRYPT 2013: 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques (Springer, LNCS 7881, 2013)
- Proceedings of PKC 2010: 13th International Conference on Practice and Theory in Public Key Cryptography (Springer, LNCS 6056, 2010)
- The LLL Algorithm: Survey and Applications (Springer, Series: Information Security and Cryptography, 2009)
- Proceedings of VIETCRYPT: First International Conference on Cryptology in Vietnam (Springer, LNCS 4341, 2006)
Surveys and Lecture Notes
- Lattice-Based Fault Attacks on Signatures (2011)
- Hermite's Constant and Lattice Algorithms (2009)
- Public-Key Cryptanalysis (2008)
- New Trends in Cryptology (STORK Project, 2003)
- The Two Faces of Lattices in Cryptology (Calc '01)
- Lattice Reduction in Cryptology: An Update (ANTS-IV, 2000)
"Vulgarisation" in French
- La cryptographie de demain (Pour la Science, 2016)
- Calculer avec des données cryptées (Mensuel La Recherche, n°437, janvier 2010)
- Une géométrie pour les codes secrets (Les dossiers de la Recherche, n°37, trimestriel novembre 2009)
- Le calcul en toute discrétion (Mensuel La Recherche, n°434, octobre 2009)
- Les logiciels libres aussi ont des failles de sécurité (Mensuel La Recherche, n°423, octobre 2008)
- Une géométrie pour les prochains codes (Mensuel La Recherche, n°420, juin 2008)
- La cryptologie : Enjeux et perspectives (2005)
- La géométrie des nombres : de Gauss aux codes secrets (Hors série n° 36 de Pour la Science, juillet 2002)
Journal Papers
- Counting Co-cyclic Lattices (2016) *SIAM Journal on Discrete Mathematics*, 30-3, pp. 1358-1370
- An LLL Algorithm with Quadratic Complexity (2009) *SIAM Journal on Computing*, Vol. 39, No. 3, pp. 874–903
- Low-Dimensional Lattice Basis Reduction Revisited (2009) *ACM Transactions on Algorithms*, Vol. 5 Issue 4, October 2009
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures (2009) *Journal of Cryptology*, Volume 22, Number 2
- Sieve Algorithms for the Shortest Vector Problem Are Practical (2008) *Journal of Mathematical Cryptology*, Vol 2, Number 2
- Testing Set Proportionality and the Adam Isomorphism of Circulant Graphs (2005) *Journal of Discrete Algorithms*
- Hidden number problem with hidden multipliers, timed-release crypto and noisy exponentiation (2003) *Mathematics of computation*, Vol 72, Number 243, Pages 1473-1485
- The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces (2003) *Design, Codes and Cryptography*, Vol 30, Number 2, Pages 201-217
- The Insecurity of the Digital Signature
Algorithm with Partially Known Nonces (2002) *J. of Cryptology*, Vol. 15, Number 3, Pages 151-176
International Conference Papers
- 2020:
- Slide Reduction, Revisited -- Filling the Gaps in SVP Approximation (CRYPTO '20)
- 2019:
- Computing a Lattice Basis Revisited (ISSAC '19)
- 2018:
- Lower Bounds on Lattice Enumeration with Extreme Pruning(CRYPTO '18)
- Quantum Lattice Enumeration and Tweaking Discrete Pruning (ASIACRYPT '18)
- 2017:
- 2016:
- 2015:
- Simpler Efficient Group Signatures from Lattices (PKC '15)
- 2014:
- Approximating the Densest Sublattice from Rankin's Inequality (ANTS '14)
- Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences (PKC '14)
- 2013:
- Solving BDD by Enumeration: An Update (CT-RSA '13)
- 2012:
- Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures (ASIACRYPT '12)
- Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic (ASIACRYPT '12)
- Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers (EUROCRYPT '12)
- 2011:
- BKZ 2.0: Better Lattice Security Estimates (ASIACRYPT '11)
- Modulus Fault Attacks Against RSA-CRT Signatures (CHES '11)
- 2010:
- Lattice Enumeration Using Extreme Pruning (EUROCRYPT '10)
- 2009:
- Factoring pq^2 with Quadratic Forms: Nice Cryptanalyses (ASIACRYPT '09)
- How Risky is the Random-Oracle Model? (CRYPTO '09)
- 2008:
- Finding Short Lattice Vectors Within Mordell's Inequality (STOC '08)
- Predicting Lattice Reduction (EUROCRYPT '08)
- 2007:
- Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5 (CRYPTO '07)
- New Chosen-Ciphertext Attacks on NTRU (PKC '07)
- 2006:
- Rankin's Constant and Blockwise Lattice Reduction (CRYPTO '06)
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures (EUROCRYPT '06, Best Paper Award)
- Symplectic Lattice Reduction and NTRU (EUROCRYPT '06)
- LLL on the Average (ANTS-VII)
- 2005:
- Floating-Point LLL Revisited (EUROCRYPT '05)
- Adapting Density Attacks to Low-Weight Knapsacks (ASIACRYPT '05)
- Impossible Fault Analysis of RC4 and Differential Fault Analysis of RC4 (IACR FSE '05)
- Experimenting with Faults, Lattices, and the DSA (IACR PKC '05)
- 2004:
- 2003: The Impact of Decryption Failures on the Security of NTRU Encryption (CRYPTO '03)
- 2002:
- 2001:
- On the Insecurity of a Server-Aided RSA Protocol (ASIACRYPT '01)
- Paillier's Cryptosystem Revisited (ACM CCS '01)
- The Insecurity of Nyberg--Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces (CALC '01)
- 2000:
- Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt '99 (ASIACRYPT '00)
- Why Textbook ElGamal and RSA Encryption are Insecure (ASIACRYPT '00)
- Noisy Polynomial Interpolation and Noisy Chinese Remaindering (EUROCRYPT '00)
- DFC v2 (SAC '00)
- 1999:
- Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97 (CRYPTO '99)
- The Hardness of the Hidden Subset Sum Problem and its Cryptographic Implications (CRYPTO '99)
- The Dark Side of the Hidden Number Problem: Lattice Attacks on DSA (CCNT '99)
- Distribution of Modular Sums and the Security of the Server Aided Exponentiation (CCNT '99)
- The Effectiveness of Lattice Attacks Against Low-Exponent RSA (PKC '99)
- 1998:
- The Béguin-Quisquater Server-Aided RSA Protocol from Crypto '95 is not Secure (ASIACRYPT '98)
- Cryptanalysis of the Ajtai-Dwork Cryptosystem (CRYPTO '98)
- A Montgomery-Like Square Root For the Number Field Sieve (ANTS-III, 1998)
- Cryptanalysis of a Fast Public Key Cryptosystem Presented at SAC '97 (SAC '98)
- 1997: Merkle-Hellman Revisited: a Cryptanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorizations (CRYPTO '97)