ESPITAU Thomas
Supervision : Antoine JOUX
Co-supervision : FOUQUE Pierre-Alain
Algorithmic aspects of algebraic lattices
Lattices are mathematical objects generalizing the concrete idea of grid embedded in the plane. They play a fundamental role in the study of various subfields of mathematics and computer science, in particular, algebraic number theory and cryptography. This thesis deals with so-called "algebraic" lattices, that is, constructed above a maximal order of a number field, with a particular emphasis on computational methods. After developing generic techniques enabling the certified manipulation of such objects, we will turn to the development of an effective algorithms for the reduction of lattices over cyclotomic fields, in particular exploiting their natural recursive and symplectic structure. This study is then used for the resolution of a central problem in algorithmic number theory, namely the principal ideal problem, consisting of the finding of a generator a principal ideal in a number field. We eventually look at the implications of these works in public-key cryptography, where we present attacks on a fully homomorphic encryption scheme and on the BLISS digital signature.
Defence : 01/14/2020
Jury members :
M. Philippe Elbaz-Vincent , Professeur, Université Grenoble-Alpes [rapporteur]
M. Claus Fieker, Professor Dr., Technische Universitat Kaiserslautern [rapporteur]
Mme. Valérie Berthé, Directrice de Recherche, IRIF
M. Pierre-Alain Fouque, Professeur, Université de Rennes
M. Antoine Joux, Tenured Research Faculty , CISPA, Helmholtz Center
Mme. Ariane Mézard, Professeur, IMJ-PRG, Sorbonne Université
M. Phong Nguyen , Directeur de Recherche, INRIA
2016-2020 Publications
-
2020
- Th. Espitau : “Algorithmic aspects of algebraic lattices”, thesis, phd defence 01/14/2020, supervision Joux, Antoine, co-supervision : Fouque, Pierre-Alain (2020)
- Th. Espitau, A. Joux, N. Kharchenko : “On a Dual/Hybrid Approach to Small Secret LWE”, Progress in Cryptology – INDOCRYPT 2020, vol. 12578, Lecture Notes in Computer Science, Bangalore, India, pp. 440-462, (Springer), (ISBN: 978-3-030-65277-7) (2020)
- Th. Espitau, A. Joux : “Certified lattice reduction”, Advances in Mathematics of Communications, vol. 14 (1), pp. 137-159, (AIMS) (2020)
-
2018
- Th. Espitau, P.‑A. Fouque, B. Gérard, M. Tibouchi : “Loop-Abort Faults on Lattice-Based Signatures and Key Exchange Protocols”, IEEE Transactions on Computers, vol. 67 (11), pp. 1535-1549, (Institute of Electrical and Electronics Engineers) (2018)
- J. Bootle, C. Delaplace, Th. Espitau, P.‑A. Fouque, M. Tibouchi : “LWE Without Modular Reduction and Improved Side-Channel Attacks Against BLISS”, ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, vol. 11272, Lecture Notes in Computer Science, Brisbane, QLD, Australia, pp. 494-524, (IEEE) (2018)
- G. Barthe, Th. Espitau, M. Gaboardi, B. Grégoire, J. Hsu, P.‑Y. Strub : “An Assertion-Based Program Logic for Probabilistic Programs”, Lecture Notes in Computer Science, Proceedings of ESOP 2018 - 27th European Symposium on Programming, Thessaloniki, Greece, pp. 117-144, (Springer) (2018)
- G. Barthe, S. Belaid, Th. Espitau, P.‑A. Fouque, B. Grégoire, M. Rossi, M. Tibouchi : “Masking the GLP Lattice-Based Signature Scheme at Any Order”, Eurocrypt 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, vol. 10821, Lecture Notes in Computer Science, Tel Aviv, Israel, pp. 354-384, (Springer) (2018)
-
2017
- G. Barthe, Th. Espitau, B. Grégoire, J. Hsu, P.‑Y. Strub : “Proving expected sensitivity of probabilistic programs”, Proceedings of the ACM on Programming Languages, vol. 2 (POPL), pp. 1-29, (ACM) (2017)
- G. Barthe, Th. Espitau, J. Hsu, T. Sato, P.‑Y. Strub : “Liftings for Differential Privacy”, ICALP 2017, Varsovie, Poland (2017)
- G. Barthe, Th. Espitau, B. Grégoire, J. Hsu, P.‑Y. Strub : “Proving uniformity and independence by self-composition and coupling”, LPAR 2017 - International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2017 - International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, pp. 19 (2017)
- J.‑F. Biasse, Th. Espitau, P.‑A. Fouque, A. Gélin, P. Kirchner : “Computing generator in cyclotomic integer rings: A subfield algorithm for the Principal Ideal Problem in Ll∆Kl(1/2) and application to cryptanalysis of a FHE scheme”, Advances in Cryptology – EUROCRYPT 2017 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 – May 4, 2017, Proceedings, Part I, vol. 10210, Lecture Notes in Computer Science, Paris, France, pp. 60-88 (2017)
- Th. Espitau, P.‑A. Fouque, B. Gérard, M. Tibouchi : “Side-Channel Attacks on BLISS Lattice-Based Signatures: Exploiting Branch Tracing against strongSwan and Electromagnetic Emanations in Microcontrollers”, CCS '17 Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, United States, pp. 1857-1874, (ACM) (2017)
-
2016
- Th. Espitau, P.‑A. Fouque, B. Gérard, M. Tibouchi : “Loop abort Faults on Lattice-Based Fiat-Shamir & Hash’n Sign signatures”, 23rd Conference on Selected Area In Cryptography, Saint John's, Canada (2016)
- G. Barthe, Th. Espitau, L. María Ferrer Fioriti, J. Hsu : “Synthesizing Probabilistic Invariants via Doob’s Decomposition”, Computer Aided Verification 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, vol. 9779, Lecture Notes in Computer Science, Toronto, Canada, pp. 43-61, (Springer) (2016)