On lattices, learning with errors, random linear codes, and cryptography
@inproceedings{Regev2005OnLL, title={On lattices, learning with errors, random linear codes, and cryptography}, author={O. Regev}, booktitle={STOC '05}, year={2005} }
Our main result is a reduction from worst-case lattice problems such as SVP and SIVP to a certain learning problem. This learning problem is a natural extension of the 'learning from parity with error' problem to higher moduli. It can also be viewed as the problem of decoding from a random linear code. This, we believe, gives a strong indication that these problems are hard. Our reduction, however, is quantum. Hence, an efficient solution to the learning problem implies a <i>quantum</i… CONTINUE READING
1,643 Citations
On lattices, learning with errors, random linear codes, and cryptography
- Mathematics, Computer Science
- JACM
- 2009
- 889
- PDF
On the Hardness of the Computational Ring-LWR Problem and its Applications
- Computer Science, Materials Science
- IACR Cryptol. ePrint Arch.
- 2018
- 4
- PDF
On the Security of Lattice-Based Cryptography Against Lattice Reduction and Hybrid Attacks
- Computer Science
- 2018
- 1
- PDF
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract
- Mathematics, Computer Science
- STOC '09
- 2009
- 735
- PDF
Smoothing Out Binary Linear Codes and Worst-case Sub-exponential Hardness for LPN
- Mathematics, Computer Science
- IACR Cryptol. ePrint Arch.
- 2020
- PDF
References
SHOWING 1-7 OF 7 REFERENCES
Generating Hard Instances of Lattice Problems
- Computer Science
- Electron. Colloquium Comput. Complex.
- 1996
- 676
- Highly Influential
New bounds in some transference theorems in the geometry of numbers
- Mathematics
- 1993
- 370
- Highly Influential
- PDF
Factoring polynomials with rational coefficients
- Mathematics, Computer Science
- 1982
- 3,744
- Highly Influential
- PDF
Relations between average case complexity and approximation complexity
- Mathematics, Computer Science
- STOC '02
- 2002
- 253
- Highly Influential
- PDF
Lattice problems in NP intersect coNP
- In Proc. 45th Annual IEEE Symp. on Foundations of Computer Science (FOCS),
- 2004
Noise-tolerant learning, the parity problem, and the statistical query model
- Computer Science, Mathematics
- JACM
- 2003
- 563
- Highly Influential
- PDF