On lattices, learning with errors, random linear codes, and cryptography
On lattices, learning with errors, random linear codes, and cryptography
O. Regev
2005 · DOI: 10.1145/1060590.1060603
Symposium on the Theory of Computing · 3,745 Citations
TLDR
A public-key cryptosystem whose hardness is based on the worst-case quantum hardness of SVP and SIVP, and an efficient solution to the learning problem implies a quantum, which can be made classical.