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}
}
  • O. Regev
  • Published in STOC '05 2005
  • Mathematics, Computer Science
  • 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
    • O. Regev
    • Mathematics, Computer Science
    • JACM
    • 2009
    • 889
    • PDF
    Learning with Errors Decoding
    • PDF
    On the Hardness of the Computational Ring-LWR Problem and its Applications
    • Long Chen, Z. Zhang, Z. Zhang
    • Computer Science, Materials Science
    • IACR Cryptol. ePrint Arch.
    • 2018
    • 4
    • PDF
    The Learning Parity with Noise Problem
    • PDF
    Public-key cryptosystems from the worst-case shortest vector problem: extended abstract
    • 735
    • PDF
    Towards efficient lattice-based cryptography
    • PDF
    Smoothing Out Binary Linear Codes and Worst-case Sub-exponential Hardness for LPN
    • Y. Yu, J. Zhang
    • Mathematics, Computer Science
    • IACR Cryptol. ePrint Arch.
    • 2020
    • PDF
    Parameter selection in lattice-based cryptography
    • 5
    • PDF

    References

    SHOWING 1-7 OF 7 REFERENCES
    Generating Hard Instances of Lattice Problems
    • M. Ajtai
    • Computer Science
    • Electron. Colloquium Comput. Complex.
    • 1996
    • 676
    • Highly Influential
    New bounds in some transference theorems in the geometry of numbers
    • 370
    • Highly Influential
    • PDF
    Quantum Computation and Quantum Information
    • 11,970
    • Highly Influential
    • PDF
    Factoring polynomials with rational coefficients
    • 3,744
    • Highly Influential
    • PDF
    Relations between average case complexity and approximation complexity
    • U. Feige
    • 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
    • 563
    • Highly Influential
    • PDF