Find out how to access previewonly content
Date:
07 Oct 2009
Inapproximability Results for Computational Problems on Lattices
 Subhash Khot
 … show all 1 hide
Abstract
In this article, we present a survey of known inapproximability results for computational problems on lattices, viz. the Shortest Vector Problem (SVP), the Closest Vector Problem (CVP), the Closest Vector Problem with Preprocessing (CVPP), the Covering Radius Problem (CRP), the Shortest Independent Vectors Problem (SIVP), and the Shortest Basis Problem (SBP).
 D. Micciancio, S. Goldwasser. Complexity of lattice problems, A cryptographic perspective. Kluwer Academic Publishers, 2002
 R. Kumar, D. Sivakumar. Complexity of SVP – A reader’s digest. SIGACT News, 32(3), Complexity Theory Column (ed. L. Hemaspaandra), 2001, pp 40–52
 O. Regev. On the Complexity of Lattice Problems with polynomial Approximation Factors. In Proc. of the LLL+25 Conference, Caen, France, June 29July 1, 2007
 C.F. Gauss. Disquisitiones arithmeticae. (leipzig 1801), art. 171. Yale University. Press, 1966. English translation by A.A. Clarke
 Minkowski, H (1910) Geometrie der zahlen. Leizpig, Tuebner
 Lenstra, AK, Lenstra, HW, Lovász, L (1982) Factoring polynomials with rational coefficients. Mathematische Ann. 261: pp. 513534
 Lagarias, JC, Odlyzko, AM (1985) Solving lowdensity subset sum problems. Journal of the ACM 32: pp. 229246 CrossRef
 Landau, S, Miller, GL (1985) Solvability of radicals is in polynomial time. Journal of Computer and Systems Sciences 30: pp. 179208 CrossRef
 H.W. Lenstra. Integer programming with a fixed number of variables. Tech. Report 81–03, Univ. of Amsterdam, Amstredam, 1981
 R. Kannan. Improved algorithms for integer programming and related lattice problems. In Proc. of the 15th Annual ACM Symposium on Theory of Computing, 1983, pp 193–206
 C.P. Schnorr. A hierarchy of polynomialtime basis reduction algorithms. In Proc. of Conference on Algorithms, P \(\acute{\mathrm{e}}\) ecs (Hungary), 1985, pp 375–386
 Kannan, R (1987) Minkowski’s convex body theorem and integer programming. Mathematics of Operations Research 12: pp. 415440 CrossRef
 M. Ajtai, R. Kumar, D. Sivakumar. A sieve algorithm for the shortest lattice vector problem. In Proc. of the 33rd Annual ACM Symposium on the Theory of Computing, 2001, pp 601–610
 P. van Emde Boas. Another NPcomplete problem and the complexity of computing short vectors in a lattice. Tech. Report 8104, Mathematische Instiut, University of Amsterdam, 1981
 M. Ajtai. The shortest vector problem in L _{2} is NPhard for randomized reductions. In Proc. of the 30th Annual ACM Symposium on the Theory of Computing, 1998, pp 10–19
 J.Y. Cai, A. Nerurkar. Approximating the SVP to within a factor \((1 + 1/{\mathrm{dim}}^{\varepsilon })\) is NPhard under randomized reductions. In Proc. of the 13th Annual IEEE Conference on Computational Complexity, 1998, pp 151–158
 D. Micciancio. The shortest vector problem is NPhard to approximate to within some constant. In Proc. of the 39th IEEE Symposium on Foundations of Computer Science, 1998
 Khot, S (2005) Hardness of approximating the shortest vector problem in lattices. Journal of the ACM 52: pp. 789808 CrossRef
 I. Haviv, O. Regev. Tensorbased hardness of the Shortest Vector Problem to within almost polynomial factors. To appear in Proc. of the 39th Annual ACM Symposium on the Theory of Computing, 2007
 M. Ajtai. Generating hard instances of lattice problems. In Proc. of the 28th Annual ACM Symposium on the Theory of Computing, 1996, pp 99–108
 M. Ajtai, C. Dwork. A publickey cryptosystem with worstcase/averagecase equivalence. In Proc. of the 29th Annual ACM Symposium on the Theory of Computing, 1997, pp 284–293
 J.Y. Cai, A. Nerurkar. An improved worstcase to averagecase connection for lattice problems. In 38th IEEE Symposium on Foundations of Computer Science, 1997
 J.Y. Cai. Applications of a new transference theorem to Ajtai’s connection factor. In Proc. of the 14th Annual IEEE Conference on Computational Complexity, 1999
 O. Regev. New lattice based cryptographic constructions. To appear in Proc. of the 35th Annual ACM Symposium on the Theory of Computing, 2003
 O. Goldreich, D. Micciancio, S. Safra, J.P. Seifert. Approximating shortest lattice vectors is not harder than approximating closest lattice vectors. Information Processing Letters, 1999
 S. Arora, L. Babai, J. Stern, E.Z. Sweedyk. The hardness of approximate optima in lattices, codes and systems of linear equations. Journal of Computer and Systems Sciences (54), 1997, pp 317–331
 I. Dinur, G. Kindler, S. Safra. Approximating CVP to within almostpolynomial factors is NPhard. In Proc. of the 39th IEEE Symposium on Foundations of Computer Science, 1998
 D. Micciancio. The hardness of the closest vector problem with preprocessing. IEEE Transactions on Information Theory, vol 47(3), 2001, pp 1212–1215
 U. Feige and D. Micciancio. The inapproximability of lattice and coding problems with preprocessing. Computational Complexity, 2002, pp 44–52
 Regev, O (2004) Improved inapproximability of lattice and coding problems with preprocessing. IEEE Transactions on Information Theory 50: pp. 20312037 CrossRef
 M. Alekhnovich, S. Khot, G. Kindler, N. Vishnoi. Hardness of approximating the closest vector problem with preprocessing. In Proc. of the 46th IEEE Symposium on Foundations of Computer Science, 2005
 Aharonov, D, Regev, O (2005) Lattice problems in NP ∩ coNP. Journal of the ACM 52: pp. 749765 CrossRef
 I. Haviv, O. Regev. Hardness of the covering radius problem on lattices. In Proc. of the 21st Annual IEEE Computational Complexity Conference, 2006
 J. Blömer, J.P. Seifert. On the complexity of compuing short linearly independent vectors and short bases in a lattice. In Proc. of the 31st Annual ACM Symposium on the Theory of Computing, 1999, pp 711–720
 O. Regev, R. Rosen. Lattice problems and norm embeddings. In Proc. of the 38th Annual ACM Symposium on the Theory of Computing, 2006
 I. Dinur. Approximating SVP_{ ∞ } to within almost polynomial factors is NPhard. Proc. of the 4th Italian Conference on Algorithms and Complexity, LNCS, vol 1767, Springer, 2000
 Banaszczyk, W (1993) New bounds in some transference theorems in the geometry of numbers. Mathematische Annalen 296: pp. 625635 CrossRef
 O. Goldreich, S. Goldwasser. On the limits of nonapproximability of lattice problems. In Proc. of the 30th Annual ACM Symposium on the Theory of Computing, 1998, pp 1–9
 Guruswami, V, Micciancio, D, Regev, O (2005) The complexity of the covering radius problem on lattices. Computational Complexity 14: pp. 90121 CrossRef
 Arora, S, Safra, S (1998) Probabilistic checking of proofs : A new characterization of NP. Journal of the ACM 45: pp. 70122 CrossRef
 Arora, S, Lund, C, Motwani, R, Sudan, M, Szegedy, M (1998) Proof verification and the hardness of approximation problems. Journal of the ACM 45: pp. 501555 CrossRef
 Raz, R (1998) A parallel repetition theorem. SIAM Journal of Computing 27: pp. 763803 CrossRef
 Milnor, J, Husemoller, D (1973) Symmetric bilinear forms. Springer, Berlin
 Lagarias, JC, Lenstra, HW, Schnorr, CP (1990) KorkineZolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica 10: pp. 333348 CrossRef
 Title
 Inapproximability Results for Computational Problems on Lattices
 Book Title
 The LLL Algorithm
 Book Subtitle
 Survey and Applications
 Pages
 pp 453473
 Copyright
 2010
 DOI
 10.1007/9783642022951_14
 Print ISBN
 9783642022944
 Online ISBN
 9783642022951
 Series Title
 Information Security and Cryptography
 Series ISSN
 16197100
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag Berlin Heidelberg
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors

 Phong Q. Nguyen ^{(ID1)}
 Brigitte Vallée ^{(ID2)}
 Editor Affiliations

 ID1. Dépt. Mathématiques et d'Informatique, Ecole Normale Supérieure
 ID2. Dept. Informatique, Université de Caen
 Authors

 Subhash Khot ^{(1)}
 Author Affiliations

 1. New York University, New York, NY, 10012, USA
Continue reading...
To view the rest of this content please follow the download PDF link above.