Léo Ducas

Orcid: 0000-0003-2510-4829

According to our database1, Léo Ducas authored at least 65 papers between 2010 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Towards a Modern LLL Implementation.
IACR Cryptol. ePrint Arch., 2025

Predicting Module-Lattice Reduction.
IACR Cryptol. ePrint Arch., 2025

Wagner's Algorithm Provably Runs in Subexponential Time for SIS<sup>∞</sup>.
IACR Cryptol. ePrint Arch., 2025

Lattice Reduction via Dense Sublattices: A Cryptanalytic No-Go.
IACR Commun. Cryptol., 2025

Wagner's Algorithm Provably Runs in Subexponential Time for rmSIS<sup>∞</sup>.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Provable lattice reduction of $\mathbb {Z}^n$ with blocksize n/2.
Des. Codes Cryptogr., April, 2024

Asymptotics and Improvements of Sieving for Codes.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

2023
Accurate Score Prediction for Dual-Sieve Attacks.
IACR Cryptol. ePrint Arch., 2023

Provable Lattice Reduction of ℤ<sup>n</sup> with Blocksize n/2.
IACR Cryptol. ePrint Arch., 2023

Hull Attacks on the Lattice Isomorphism Problem.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

Does the Dual-Sieve Attack on Learning with Errors Even Work?
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Finding Short Integer Solutions When the Modulus Is Small.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Smoothing Codes and Lattices: Systematic Study and New Bounds.
IACR Cryptol. ePrint Arch., 2022

Genus Distribution of Random q-ary Lattices.
IACR Cryptol. ePrint Arch., 2022

Estimating the Hidden Overheads in the BDGL Lattice Sieving Algorithm.
Proceedings of the Post-Quantum Cryptography - 13th International Workshop, 2022

On the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Hawk: Module LIP Makes Lattice Signatures Fast, Compact and Simple.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021
Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time.
J. ACM, 2021

A note on a Claim of Eldar & Hallgren: LLL already solves it.
IACR Cryptol. ePrint Arch., 2021

Lattice Attacks on NTRU and LWE: A History of Refinements.
IACR Cryptol. ePrint Arch., 2021

Advanced Lattice Sieving on GPUs, with Tensor Cores.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

NTRU Fatigue: How Stretched is Overstretched?
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
An Algorithmic Reduction Theory for Binary Codes: LLL and more.
IACR Cryptol. ePrint Arch., 2020

The Randomized Slicer for CVPP: Sharper, Faster, Smaller, Batchier.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

Integral Matrix Gram Root and Lattice Gaussian Sampling Without Floats.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

On the Quantum Complexity of the Continuous Hidden Subgroup Problem.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

LWE with Side Information: Attacks and Concrete Security Estimation.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Random Self-reducibility of Ideal-SVP via Arakelov Random Walks.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
The General Sieve Kernel and New Records in Lattice Reduction.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

On the Shortness of Vectors to Be Found by the Ideal-SVP Quantum Algorithm.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018

Polynomial Time Bounded Distance Decoding near Minkowski's Bound in Discrete Logarithm Lattices.
IACR Cryptol. ePrint Arch., 2018

Preparing Ourselves for the Threats of the Post-Quantum Era.
ERCIM News, 2018

Attacks on the AJPS Mersenne-Based Cryptosystem.
Proceedings of the Post-Quantum Cryptography - 9th International Conference, 2018

Hash Proof Systems over Lattices Revisited.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM.
Proceedings of the 2018 IEEE European Symposium on Security and Privacy, 2018

Shortest Vector from Lattice Sieving: A Few Dimensions for Free.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Learning Strikes Again: The Case of the DRS Signature Scheme.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

On the Statistical Leak of the GGH13 Multilinear Map and Some Variants.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

Large FHE Gates from Tensored Homomorphic Accumulator.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2018, 2018

2017
CRYSTALS - Dilithium: Digital Signatures from Module Lattices.
IACR Cryptol. ePrint Arch., 2017

CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM.
IACR Cryptol. ePrint Arch., 2017

Second Order Statistical Behavior of LLL and BKZ.
Proceedings of the Selected Areas in Cryptography - SAC 2017, 2017

Short Stickelberger Class Relations and Application to Ideal-SVP.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

2016
The closest vector problem in tensored root lattices of type A and in their duals.
IACR Cryptol. ePrint Arch., 2016

NewHope without reconciliation.
IACR Cryptol. ePrint Arch., 2016

Post-quantum Key Exchange - A New Hope.
Proceedings of the 25th USENIX Security Symposium, 2016

New directions in nearest neighbor searching with applications to lattice sieving.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Fast Fourier Orthogonalization.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Sanitization of FHE Ciphertexts.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Recovering Short Generators of Principal Ideals in Cyclotomic Rings.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

A Subfield Lattice Attack on Overstretched NTRU Assumptions - Cryptanalysis of Some FHE and Graded Encoding Schemes.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

Frodo: Take off the Ring! Practical, Quantum-Secure Key Exchange from LWE.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

2014
FHE Bootstrapping in less than a second.
IACR Cryptol. ePrint Arch., 2014

E fficient Identity-Based Encryption over NTRU Lattices.
IACR Cryptol. ePrint Arch., 2014

Accelerating Bliss: the geometry of ternary polynomials.
IACR Cryptol. ePrint Arch., 2014

Improved Short Lattice Signatures in the Standard Model.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Enhanced Lattice-Based Signatures on Reconfigurable Hardware.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2014, 2014

Efficient Identity-Based Encryption over NTRU Lattices.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013
Lattice Signatures and Bimodal Gaussians.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012
Ring-LWE in Polynomial Rings.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2010
Anonymity from Asymmetry: New Constructions for Anonymous HIBE.
Proceedings of the Topics in Cryptology, 2010


  Loading...