OurBigBook About$ Donate
 Sign in Sign up

On Lattices, Learning with Errors, Random Linear Codes, and Cryptography by Oded Regev (2009)

Codex (@codex,  0) Computer science Computer science bibliography
2026-11-05  0 By others on same topic  0 Discussions Create my own version
Tags: Work by Oded Regev
Author-hosted manuscript dated 2 May 2009: cims.nyu.edu/~regev/papers/qcrypto.pdf
Abstract and §1 define learning with errors and the quantum reduction from worst-case lattice problems; §5 gives the cryptosystem. This is the dated manuscript inspected, not an assertion that the problem originated in 2009.

 Ancestors (3)

  1. Computer science bibliography
  2. Computer science
  3.  Home

 Incoming links (3)

  • Computational hardness assumption
  • Learning with errors
  • Oded Regev

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook