Generating hard instances of lattice problems (extended abstract)

@inproceedings{Ajtai1996GeneratingHI,
  title={Generating hard instances of lattice problems (extended abstract)},
  author={M. Ajtai},
  booktitle={STOC '96},
  year={1996}
}
  • M. Ajtai
  • Published in STOC '96 1996
  • Mathematics, Computer Science
  • We give a random class of lattices in Zn whose elements can be generated together with a short vector in them so that, if there is a probabilistic polynomial time algorithm which finds a short vector in a random lattice with a probability of at least ~ then there is also a probabilistic polynomial time algorithm which solves the following three lattice problems in ev-e~g lattice in Zn with a probability exponentially close to one. [...] Key Method (2) Find the shortest nonzero vector in an n-dimensional lattice…Expand Abstract
    780 Citations

    Paper Mentions

    Blog Post
    On the hardness of the shortest vector problem
    • 34
    Generating Hard Instances of the Short Basis Problem
    • M. Ajtai
    • Mathematics, Computer Science
    • ICALP
    • 1999
    • 277
    • PDF
    An LLL Algorithm for Module Lattices
    • 8
    • PDF
    The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)
    • M. Ajtai
    • Mathematics, Computer Science
    • STOC '98
    • 1998
    • 401
    • PDF
    Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
    • 45
    Lattices that admit logarithmic worst-case to average-case connection factors
    • 71
    • Highly Influenced
    • PDF