Hardness of approximating the shortest vector problem in lattices

@article{Khot2004HardnessOA,
  title={Hardness of approximating the shortest vector problem in lattices},
  author={S. Khot},
  journal={45th Annual IEEE Symposium on Foundations of Computer Science},
  year={2004},
  pages={126-135}
}
  • S. Khot
  • Published 2004
  • Mathematics, Computer Science
  • 45th Annual IEEE Symposium on Foundations of Computer Science
  • Let p > 1 be any fixed real. We show that assuming NP /spl nsube/ RP, it is hard to approximate the shortest vector problem (SVP) in l/sub p/ norm within an arbitrarily large constant factor. Under the stronger assumption NP /spl nsube/ RTIME(2/sup poly(log n)/), we show that the problem is hard to approximate within factor 2/sup log n1/2 - /spl epsi// where n is the dimension of the lattice and /spl epsi/> 0 is an arbitrarily small constant. This greatly improves all previous results in l/sub… CONTINUE READING
    The complexity of the covering radius problem on lattices and codes
    • 19
    • PDF
    Worst-case to average-case reductions based on Gaussian measures
    • 324
    • PDF
    Limits on the Hardness of Lattice Problems in ℓp Norms
    • 83
    • PDF
    Worst-Case to Average-Case Reductions Based on Gaussian Measures
    • 523
    • PDF
    Lattices that admit logarithmic worst-case to average-case connection factors
    • 72
    • PDF
    Efficient reductions among lattice problems
    • 53
    • PDF
    Hardness of the covering radius problem on lattices
    • 25
    • Highly Influenced
    • PDF
    Hardness of bounded distance decoding on lattices in lp norms
    Inapproximability Results for the Weight Problems of Subgroup Permutation Codes

    References

    Publications referenced by this paper.
    SHOWING 1-4 OF 4 REFERENCES
    Lattice problems in NP ∩ coNP
    • 153
    • Highly Influential
    • PDF
    Generating Hard Instances of Lattice Problems
    • M. Ajtai
    • Mathematics, Computer Science
    • 1996
    • 645
    • Highly Influential
    Factoring polynomials with rational coefficients
    • 3,637
    • Highly Influential
    • PDF
    Applications of a new transference theorem to Ajtai's connection factor
    • J. Cai
    • Mathematics, Computer Science
    • 1999
    • 17
    • Highly Influential