On Ideal Lattices and Learning with Errors over Rings

, , and . Advances in Cryptology -- EUROCRYPT 2010, page 1--23. Berlin, Heidelberg, Springer Berlin Heidelberg, (2010)


The ``learning with errors'' (LWE) problem is to distinguish random linear equations, which have been perturbed by a small amount of noise, from truly uniform ones. The problem has been shown to be as hard as worst-case lattice problems, and in recent years it has served as the foundation for a plethora of cryptographic applications. Unfortunately, these applications are rather inefficient due to an inherent quadratic overhead in the use of LWE. A main open question was whether LWE and its applications could be made truly efficient by exploiting extra algebraic structure, as was done for lattice-based hash functions (and related primitives).


On Ideal Lattices and Learning with Errors over Rings | SpringerLink

Links and resources

BibTeX key:
search on:

Comments and Reviews  

There is no review or comment yet. You can write one!


Cite this publication