• DOI:10.1145/2488608.2488680
Corpus ID: 6005009

Classical hardness of learning with errors

@inproceedings{Brakerski2013ClassicalHO,
  title={Classical hardness of learning with errors},
  author={Zvika Brakerski and A. Langlois and Chris Peikert and O. Regev and D. Stehl{\'e}},
  booktitle={STOC '13},
  year={2013}
}

Zvika Brakerski, A. Langlois, +2 authors D. Stehlé

Published in STOC '13 2013

Mathematics, Computer Science

View on ACM

arxiv.org

Save to Library

Create Alert

Cite

Launch Research Feed

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.