Léo Ducas
 Full Name
 Prof.dr. L. Ducas
 Function(s)
 Researcher, Professor  Universiteit Leiden
 withheld
 Telephone
 +31 20 592 4250
 Room
 M260
 Department(s)
 Cryptology
 Homepage
 https://homepages.cwi.nl/~ducas/
Biography
I have obtained my PhD at ENS Paris, on the topic of Latticebased Cryptography. After a postdoc at UCSD, I have joined CWI in 2015. I obtained a VENI grant in 2016, and started a tenuretrack at CWI in 2017.Research
I do research on cryptology, and I am more specifically interested in theoretical and practical aspects of latticebased cryptography.
I am involved in the design of fast algorithms for use in latticebased cryptographic protocols, and in the design of optimized cryptographic protocols for practice. This work includes candidates Quantumsafe 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 latticebased schemes, showing that not all lattices problems are equally resistant to quantum computing.
Publications

DebrisAlazard, T, Ducas, L, & van Woerden, W.P.J. (2022). An algorithmic reduction theory for binary codes: LLL and more. IEEE Transactions on Information Theory. doi:10.1109/TIT.2022.3143620

Ducas, L, & van Woerden, W.P.J. (2021). NTRU Fatigue: How stretched is overstretched?. In Advances in Cryptology  ASIACRYPT (pp. 3–32). doi:10.1007/9783030920685_1

Ducas, L, Stevens, M.M.J, & van Woerden, W.P.J. (2021). Advanced lattice sieving on GPUs, with Tensor Cores. In Proceedings of EUROCRYPT 2021 (pp. 249–279). doi:10.1007/9783030778866_9

Ducas, L, & Yu, Y. (2021). Learning Strikes Again: The Case of the DRS Signature Scheme. Journal of Cryptology, 34(1). doi:10.1007/s00145020093669

Cramer, R.J.F, Ducas, L, & Wesolowski, B.P.C. (2021). Mildly short vectors in cyclotomic ideal lattices in quantum polynomial time. Journal of the ACM, 68(2). doi:10.1145/3431725

Ducas, L, Laarhoven, T. (Thijs), & van Woerden, W.P.J. (2020). The Randomized Slicer for CVPP: Sharper, Faster, Smaller, Batchier. In PublicKey Cryptography (pp. 3–36). doi:10.1007/9783030453886_1

de Boer, K, Ducas, L, & Fehr, S. (2020). On the Quantum Complexity of the Continuous Hidden Subgroup Problem. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. doi:10.1007/9783030457242_12

de Boer, K, Ducas, L, PelletMary, A, & Wesolowski, B.P.C. (2020). Random selfreducibility of idealsvp via arakelov random walks. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. doi:10.1007/9783030568801_9

DachmanSoled, D, Ducas, L, Gong, H, & Rossi, M. (2020). LWE with side information: Attacks and concrete security estimation. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. doi:10.1007/9783030568801_12

Ducas, L, Galbraith, S, Prest, T, & Yu, Y. (2020). Integral Matrix Gram Root and Lattice Gaussian Sampling Without Floats. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. doi:10.1007/9783030457242_21
Current projects with external funding

A Reduction Theory for Codes and Lattices in Cryptography (ARTICULATE)

PRivacy preserving pOstquantuM 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)