Léo Ducas

Biography

Research

I do research on cryptology, and I am more specifically interested in theoretical and practical aspects of lattice-based cryptography.

I am involved in the design of fast algorithms for use in lattice-based cryptographic protocols, and in the design of optimized cryptographic protocols for practice. This work includes candidates Quantum-safe protocols  for the NIST standardization competition (NewHope, Frodo, Kyber, Dilithium).

I am also interested the precise security estimations of lattice problems, the fine tuning of cryptanalytic algorithm and their implementation. In particular I am very active in the development of the FPLLL lattice reduction library, so as to test in practice the latest algorithmic advances, but also to provide useful tools for prototyping new algorithms.

I have also contributed to quantum cryptanalysis of lattice-based schemes, showing that not all lattices problems are equally resistant to quantum computing.

Publications

• Albrecht, M, Ducas, L, Herold, G, Kirshanova, E, Postlethwaite, E.W, & Stevens, M.M.J. (2019). The General Sieve Kernel and New Records in Lattice Reduction. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. doi:10.1007/978-3-030-17656-3_25
• Ducas, L, & Pellet-Mary, A. (2018). On the statistical leak of the GGH13 multilinear map and some variants. In Advances in Cryptology - ASIACRYPT (pp. 465–493). doi:10.1007/978-3-030-03326-2_16
• Yu, Y, & Ducas, L. (2018). Learning strikes again: The case of the DRS signature scheme. In Advances in Cryptology - ASIACRYPT 2018 (pp. 525–543). doi:10.1007/978-3-030-03329-3_18
• Ducas, L, & Pierrot, C.A. (2018). Polynomial time bounded distance decoding near Minkowski’s bound in discrete logarithm lattices. Designs, Codes and Cryptography. doi:10.1007/s10623-018-0573-3
• Bonnoron, G, Ducas, L, & Fillinger, M.J. (2018). Large FHE Gates from tensored homomorphic accumulator. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. doi:10.1007/978-3-319-89339-6_13
• Ducas, L. (2018). Shortest vector from lattice sieving: A few dimensions for free. In Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques (pp. 125–145). doi:10.1007/978-3-319-78381-9_5
• Bos, J.W, Ducas, L, Kiltz, E, Lepoint, T, Lyubashevsky, V, Schanck, J.M, … Stehlé, D. (2018). CRYSTALS - Kyber: A CCA-secure Module-Lattice-Based KEM. In 3rd IEEE European Symposium on Security and Privacy, EURO S & P 2018 (pp. 353–367). doi:10.1109/EuroSP.2018.00032
• de Boer, K, Ducas, L, Jeffery, S, & de Wolf, R.M. (2018). Attacks on the AJPS Mersenne-based cryptosystem. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 101–120). doi:10.1007/978-3-319-79063-3_5
• Benhamouda, F, Blazy, O, Ducas, L, & Quach, W. (2018). Hash Proof Systems over lattices revisited. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 644–674). doi:10.1007/978-3-319-76581-5_22
• Ducas, L, Kiltz, E, Lepoint, T, Lyubashevsky, V, Schwabe, P, Seiler, G, & Stehlé, D. (2018). CRYSTALS-Dilithium: A lattice-based digital signature scheme. IACR Transactions on Cryptographic Hardware and Embedded Systems, 2018(1), 238–268.

Current projects with external funding

• Cryptanalysis of Lattice-based Cryptography ()
• PRivacy preserving pOst-quantuM systEms from advanced crypTograpHic mEchanisms Using latticeS (PROMETHEUS)

Awards

• USENIX and Facebook "Internet Defense Prize" - For Newhope, joint work with Erdem Alkim, Thomas Poppelmann, Peter Schwabe (2016)