The Learning with Errors Problem (Invited Survey)
Author:
- Oded RegevOROded Regev
Top Cited Papers
- 1 June 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10930159,p. 191-204
Abstract
In this survey we describe the Learning with Errors (LWE) problem, discuss its properties, its hardness, and its cryptographic applications.Keywords
This publication has 33 references indexed in Scilit:
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem2009
- Cryptographic hardness for learning intersections of halfspacesJournal of Computer and System Sciences, 2009
- Trapdoors for hard lattices and new cryptographic constructions2008
- Lattice-Based Identification Schemes Secure Under Active Attacks2008
- Asymptotically Efficient Lattice-Based Digital Signatures2008
- Multi-bit Cryptosystems Based on Lattice Problems2007
- Generalized Compact Knapsacks Are Collision Resistant2006
- On Bounded Distance Decoding for General Lattices2006
- The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem2005
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982