Hardness of approximating the Shortest Vector Problem in high lp norms

We show that for every , there is a constant such that for all integers , it is NP-hard to approximate the Shortest Vector Problem in norm within factor under randomized reductions. For large values of , this improves the factor hardness shown by Micciancio [27].

[1]  Jin-Yi Cai,et al.  Approximating the SVP to within a Factor (1+1/dimxi) Is NP-Hard under Randomized Reductions , 1999, J. Comput. Syst. Sci..

[2]  Ravi Kumar,et al.  A sieve algorithm for the shortest lattice vector problem , 2001, STOC '01.

[3]  Uriel Feige,et al.  Approximating the domatic number , 2000, STOC '00.

[4]  Jacques Stern,et al.  The hardness of approximate optima in lattices, codes, and systems of linear equations , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[5]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[6]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[7]  Miklós Ajtai,et al.  Generating hard instances of lattice problems (extended abstract) , 1996, STOC '96.

[8]  Daniele Micciancio.  The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant , 2000, SIAM J. Comput..

[9]  Guy Kindler,et al.  Approximating CVP to Within Almost-Polynomial Factors is NP-Hard , 1998, Electron. Colloquium Comput. Complex..

[10]  H. Minkowski,et al.  Geometrie der Zahlen , 1896 .

[11]  Ravi Kannan,et al.  Improved algorithms for integer programming and related lattice problems , 1983, STOC.

[12]  Gary L. Miller,et al.  Solvability by Radicals is in Polynomial Time , 1985, J. Comput. Syst. Sci..

[13]  Miklós Ajtai,et al.  Generating Hard Instances of Lattice Problems , 1996, Electron. Colloquium Comput. Complex..

[14]  Lane A. Hemaspaandra.  Complexity theory , 2001, SIGA.

[15]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[16]  Dorit Aharonov,et al.  Lattice Problems in NP cap coNP , 2004, FOCS.

[17]  Jin-Yi Cai,et al.  A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor , 2003, Discret. Appl. Math..

[18]  Jin-Yi Cai,et al.  An improved worst-case to average-case connection for lattice problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[19]  Venkatesan Guruswami,et al.  Hardness of approximate hypergraph coloring , 2000, Electron. Colloquium Comput. Complex..

[20]  Jin-Yi Cai,et al.  Approximating the SVP to within a Factor is NP-Hard under Randomized Reductions , 1998 .

[21]  Jin-Yi Cai,et al.  Applications of a new transference theorem to Ajtai's connection factor , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[22]  Jeffrey C. Lagarias,et al.  Solving low density subset sum problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[23]  Ran Raz.  A Parallel Repetition Theorem , 1998, SIAM J. Comput..

[24]  Ravi Kannan,et al.  Minkowski's Convex Body Theorem and Integer Programming , 1987, Math. Oper. Res..

[25]  Shafi Goldwasser,et al.  Complexity of lattice problems - a cryptographic perspective , 2002, The Kluwer international series in engineering and computer science.

[26]  Oded Goldreich,et al.  On the limits of non-approximability of lattice problems , 1998, STOC '98.

[27]  Cynthia Dwork,et al.  A public-key cryptosystem with worst-case/average-case equivalence , 1997, STOC '97.

[28]  Jeffrey C. Lagarias,et al.  Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice , 1990, Comb..

[29]  Oded Goldreich,et al.  On the Limits of Nonapproximability of Lattice Problems , 2000, J. Comput. Syst. Sci..

[30]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[31]  Shafi Goldwasser,et al.  Complexity of lattice problems , 2002 .

[32]  C. P. Schnorr,et al.  A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms , 1987, Theor. Comput. Sci..

[33]  Carsten Lund,et al.  Efficient probabilistically checkable proofs and applications to approximations , 1993, STOC.

[34]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[35]  Irit Dinur,et al.  Approximating SVPinfinity to within almost-polynomial factors is NP-hard , 1998, Theor. Comput. Sci..

[36]  Subhash Khot.  Hardness of Approximating the Shortest Vector Problem in Lattices , 2004, FOCS.

[37]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[38]  Miklós Ajtai,et al.  The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract) , 1998, STOC '98.