192 citations · 482 across the 8 of their papers we have counts for
8 papers
Computing an LLL-reduced basis of the orthogonal lattice
Jingwei Chen, Damien Stehlé, Gilles Villard
As a typical application, the Lenstra-Lenstra-Lovasz lattice basis reduction algorithm (LLL) is used to compute a reduced basis of the orthogonal lattice for a given integer matrix…
Learning With Errors and Extrapolated Dihedral Cosets
Zvika Brakerski, Elena Kirshanova, Damien Stehlé +1
The hardness of the learning with errors (LWE) problem is one of the most fruitful resources of modern cryptography. In particular, it is one of the most prominent candidates for s…
Classical Hardness of Learning with Errors
Zvika Brakerski, Adeline Langlois, Chris Peikert +2
We show that the Learning with Errors (LWE) problem is classically at least as hard as standard worst-case lattice problems, even with polynomial modulus. Previously this was only…
Semantically Secure Lattice Codes for the Gaussian Wiretap Channel
Cong Ling, Laura Luzzi, Jean-Claude Belfiore +1
We propose a new scheme of wiretap lattice coding that achieves semantic security and strong secrecy over the Gaussian wiretap channel. The key tool in our security proof is the fl…
Decoding by Embedding: Correct Decoding Radius and DMT Optimality
Laura Luzzi, Damien Stehle, Cong Ling
The closest vector problem (CVP) and shortest (nonzero) vector problem (SVP) are the core algorithmic problems on Euclidean lattices. They are central to the applications of lattic…
Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding
Shuiyin Liu, Cong Ling, Damien Stehlé
Despite its reduced complexity, lattice reduction-aided decoding exhibits a widening gap to maximum-likelihood (ML) performance as the dimension increases. To improve its performan…