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).
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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 29-July 1, 2007
C.F. Gauss. Disquisitiones arithmeticae. (leipzig 1801), art. 171. Yale University. Press, 1966. English translation by A.A. Clarke
H. Minkowski. Geometrie der zahlen. Leizpig, Tuebner, 1910
A.K. Lenstra, H.W. Lenstra, L. Lovász. Factoring polynomials with rational coefficients. Mathematische Ann., 261, 1982, pp 513–534
J.C. Lagarias, A.M. Odlyzko. Solving low-density subset sum problems. Journal of the ACM, 32(1), 1985, pp 229–246
S. Landau, G.L. Miller. Solvability of radicals is in polynomial time. Journal of Computer and Systems Sciences, 30(2), 1985, pp 179–208
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 polynomial-time basis reduction algorithms. In Proc. of Conference on Algorithms, P\(\acute{\mathrm{e}}\)ecs (Hungary), 1985, pp 375–386
R. Kannan. Minkowski’s convex body theorem and integer programming. Mathematics of Operations Research, 12:415–440, 1987
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 NP-complete problem and the complexity of computing short vectors in a lattice. Tech. Report 81-04, Mathematische Instiut, University of Amsterdam, 1981
M. Ajtai. The shortest vector problem in L 2 is NP-hard 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 NP-hard 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 NP-hard to approximate to within some constant. In Proc. of the 39th IEEE Symposium on Foundations of Computer Science, 1998
S. Khot. Hardness of approximating the shortest vector problem in lattices. Journal of the ACM, 52(5), 2005, pp 789–808
I. Haviv, O. Regev. Tensor-based 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 public-key cryptosystem with worst-case/average-case 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 worst-case to average-case 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 almost-polynomial factors is NP-hard. 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
O. Regev. Improved inapproximability of lattice and coding problems with preprocessing. IEEE Transactions on Information Theory, 50(9), 2004, pp 2031–2037
M. Alekhnovich, S. Khot, G. Kindler, N. Vishnoi. Hardness of approximating the closest vector problem with pre-processing. In Proc. of the 46th IEEE Symposium on Foundations of Computer Science, 2005
D. Aharonov, O. Regev. Lattice problems in NP ∩ coNP. Journal of the ACM, 52(5), 2005, pp 749–765
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 NP-hard. Proc. of the 4th Italian Conference on Algorithms and Complexity, LNCS, vol 1767, Springer, 2000
W. Banaszczyk. New bounds in some transference theorems in the geometry of numbers. Mathematische Annalen, vol. 296, 1993, pp 625–635
O. Goldreich, S. Goldwasser. On the limits of non-approximability of lattice problems. In Proc. of the 30th Annual ACM Symposium on the Theory of Computing, 1998, pp 1–9
V. Guruswami, D. Micciancio, O. Regev. The complexity of the covering radius problem on lattices. Computational Complexity 14(2), 2005, pp 90–121
S. Arora and S. Safra. Probabilistic checking of proofs : A new characterization of NP. Journal of the ACM, 45(1), 1998, pp 70–122
S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3), 1998, pp 501–555
R. Raz. A parallel repetition theorem. SIAM Journal of Computing, 27(3), 1998, pp 763–803
J. Milnor, D. Husemoller. Symmetric bilinear forms. Springer, Berlin, 1973
J.C. Lagarias, H.W. Lenstra, C.P. Schnorr. Korkine-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica, vol 10, 1990, pp 333–348
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Khot, S. (2009). Inapproximability Results for Computational Problems on Lattices. In: Nguyen, P., Vallée, B. (eds) The LLL Algorithm. Information Security and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02295-1_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-02295-1_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02294-4
Online ISBN: 978-3-642-02295-1
eBook Packages: Computer ScienceComputer Science (R0)