Improved Inapproximability of Lattice and Coding Problems With Preprocessing

We show that the closest vector problem with preprocessing (CVPP) is NP-hard to approximate to within /spl radic/3-/spl epsi/ for any /spl epsi/>0. In addition, we show that the nearest codeword problem with preprocessing (NCPP) is NP-hard to approximate to within 3-/spl epsi/. These results improve previous results of Feige and Micciancio. We also present the first inapproximability result for the relatively nearest codeword problem with preprocessing (RNCP). Finally, we describe an n-approximation algorithm to CVPP.

[1]  Moni Naor,et al.  The hardness of decoding linear codes with preprocessing , 1990, IEEE Trans. Inf. Theory.

[2]  Daniele Micciancio,et al.  The hardness of the closest vector problem with preprocessing , 2001, IEEE Trans. Inf. Theory.

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

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

[5]  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.

[6]  Uriel Feige,et al.  The inapproximability of lattice and coding problems with preprocessing , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[7]  W. Banaszczyk.  New bounds in some transference theorems in the geometry of numbers , 1993 .

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

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

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

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

[12]  Madhu Sudan,et al.  Hardness of approximating the minimum distance of a linear code , 1999, IEEE Trans. Inf. Theory.

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

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

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