Projects per year
Abstract
The learning with errors (LWE) problem has become a central building block of modern cryptographic constructions. This work collects and presents hardness results for concrete instances of LWE. In particular, we discuss algorithms proposed in the literature and give the expected resources required to run them. We consider both generic instances of LWE as well as small secret variants. Since for several methods of solving LWE we require a lattice reduction step, we also review lattice reduction algorithms and use a refined model for estimating their running times. We also give concrete estimates for various families of LWE instances, provide a Sage module for computing these estimates and highlight gaps in the knowledge about algorithms for solving the LWE problem.
Original language | English |
---|---|
Pages (from-to) | 169–203 |
Number of pages | 35 |
Journal | Journal of Mathematical Cryptology |
Volume | 9 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2 Oct 2015 |
Projects
- 1 Finished
-
Multilinear Maps in Cryptography
Paterson, K.
Eng & Phys Sci Res Council EPSRC
31/01/14 → 30/01/17
Project: Research