Leo 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

• 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, … Stehle, 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. (2017). Advances on quantum cryptanalysis of ideal lattices. Nieuw Archief voor Wiskunde, 5/18, 184–189.
• Yu, Y, & Ducas, L. (2017). Second order statistical behavior of LLL and BKZ. In Proceedings of the 24th Annual Conference on Selected Areas in Cryptography (pp. 3–22). doi:10.1007/978-3-319-72565-9_1
• Bos, J.W, Ducas, L, Kiltz, E, Lepoint, T, Lyubashevsky, V, Schanck, J.M, … Stehle, D. (2017). CRYSTALS - Kyber: A CCA-secure Module-Lattice-Based KEM. Cryptology ePrint Archive.
• Cramer, R.J.F, Ducas, L, & Wesolowski, B. (2017). Short Stickelberger class relations and application to Ideal-SVP. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. doi:10.1007/978-3-319-56620-7_12
• Ducas, L, & van Woerden, W.P.J. (2017). The closest vector problem in tensored root lattices of type A and in their duals. Designs, Codes, and Cryptography, 1–14. doi:10.1007/s10623-017-0332-x

Current projects with external funding

• Applications of Arithmetic Secret Sharing Schemes in Two-Party Cryptography
• Cryptanalysis of Lattice-based Cryptography
• Cryptanalysis of Widely-used Hash Function Standards and Beyond
• 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)