Public-key cryptosystems from the worst-case shortest vector problem: extended abstract

  title={Public-key cryptosystems from the worst-case shortest vector problem: extended abstract},
  author={Chris Peikert},
  journal={Electron. Colloquium Comput. Complex.},
  • Chris Peikert
  • Published 2009
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
  • We construct public-key cryptosystems that are secure assuming theworst-case hardness of approximating the minimum distance on n-dimensional lattices to within small Poly(n) factors. Prior cryptosystems with worst-case connections were based either on the shortest vector problem for a special class of lattices (Ajtai and Dwork, STOC 1997; Regev, J. ACM 2004), or on the conjectured hardness of lattice problems for quantum algorithms (Regev, STOC 2005). Our main technical innovation is a… CONTINUE READING
    735 Citations
    Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
    • 322
    • PDF
    Efficient Public Key Encryption Based on Ideal Lattices
    • 217
    • Highly Influenced
    • PDF
    Lattice-based signature schemes with additional features
    • 4
    • PDF
    Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
    • C. Gentry
    • Mathematics, Computer Science
    • CRYPTO
    • 2010
    • 134
    • PDF
    Public Key Cryptosystems from the Multiplicative Learning with Errors
    • Gu Chun-sheng
    • Computer Science
    • 2010 International Conference on Multimedia Information Networking and Security
    • 2010
    • 1
    On lattices, learning with errors, random linear codes, and cryptography
    • O. Regev
    • Mathematics, Computer Science
    • JACM
    • 2009
    • 889
    • PDF
    A provably secure variant of NTRU cryptosystem
    • PDF


    Cryptographic Primitives Based on Hard Learning Problems
    • 276
    • Highly Influential
    • PDF