Classical Hardness of Learning with Errors - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Classical Hardness of Learning with Errors


We show that the Learning with Errors (LWE) problem is classically at least as hard as standard worst-case lattice problems. Previously this was only known under quantum reductions. Our techniques capture the tradeoff between the dimension and the modulus of LWE instances, leading to a much better understanding of the landscape of the problem. The proof is inspired by techniques from several recent cryptographic constructions, most notably fully homomorphic encryption schemes.
Not file

Dates and versions

hal-00922194 , version 1 (24-12-2013)


  • HAL Id : hal-00922194 , version 1


Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, Damien Stehlé. Classical Hardness of Learning with Errors. Proceedings of STOC, 2013, United States. pp.575-584. ⟨hal-00922194⟩
260 View
0 Download


Gmail Facebook Twitter LinkedIn More