Advertisement

The Shortest Vector Problem in Lattices with Many Cycles

  • Mårten Trolin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2146)

Abstract

In this paper we investigate how the complexity of the shortest vector problem in a lattice A depends on the cycle structure of the additive group ℤn/A. We give a proof that the shortest vector problem is NP-complete in the max-norm for n-dimensional lattices A where ℤn/A has n — 1 cycles. We also give experimental data that show that the LLL algorithm does not perform significantly better on lattices with a high number of cycles.

Keywords

Lattices LLL algorithm shortest vector problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Ajtai. Generating Hard Instances of Lattice Problems. Proc. 28th ACM Symposium on Theory of Computing, pages 99–108, 1996.Google Scholar
  2. 2.
    M. Ajtai. The shortest vector problem in l 2 is NP-hard for randomized reductions. Proc. 30th ACM Symposium on the Theory of Computing, pages 10–19, 1998.Google Scholar
  3. 3.
    J-Y. Cai and A. Nerurkar. An Improved Worst-Case to Average-Case Connection for Lattice Problems. Proc. 38th IEEE Symposium on Foundations of Computer Science, pages 468–477, 1997.Google Scholar
  4. 4.
    O. Goldreich and S. Goldwasser. On the limits of non-approximability of lattice problems. Journal of Computer and System Sciences, Academic Press, 60(3):540–563, 2000. Can be obtained from http://www.eccc.uni-trier.de/eccc.zbMATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Kabatjanskii and Levenshtein. Bounds for Packings on a Sphere and in Space. Problems of Information Transmission 14, 1:1–17, 1978.Google Scholar
  6. 6.
    J.C. Lagarias. The Computational Complexity of Simultanous Diophantine Approximation Problems. SIAM Journal of Computing, 14:196–209, 1985.zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    A.K. Lenstra, H.W. Lenstra and L. Lovász. Factoring Polynomials with Rational Coefficients. Mathematische Annalen 261:515–534, 1982.zbMATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    D. Micciancio. The Shortest Vector in a Lattice is Hard to Approximate within Some Constant. Proc. 39th IEEE Symposium on Foundations of Computer Science, 1998, 92–98.Google Scholar
  9. 9.
    D. Micciancio. Lattice Based Cryptography: A Global Improvement. Technical report, Theory of Cryptography Library, 1999. Report 99-05. Can be obtained from http://eprint.iacr.org.
  10. 10.
    H. Minkowski. Über die positiven quadratischen Formen und über kettenbruchĎhn-liche Algorithmen. Grelles Journal ür die Reine und Angewandte Mathematik, 107:278–297, 1891.CrossRefGoogle Scholar
  11. 11.
    A. Paz and C.P. Schnorr. Approximating Integer Lattices by Lattices with Cyclic Lattice Groups. Automata, languages and programming (Karlsruhe), 1987, 386–393.Google Scholar
  12. 12.
    C.P. Schnorr. A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms. Theoretical Computer Science, 53:201–224, 1987.zbMATHMathSciNetCrossRefGoogle Scholar
  13. 13.
    V. Shoup. NTL: A Library for doing Number Theory. Can be obtained from http://www.shoup.net.
  14. 14.
    H.J.S. Smith. On Systems of Linear Indeterminate Equations and Congruences. Philosophical Transactions of the Royal Society of London, 151:293–326, 1861.CrossRefGoogle Scholar
  15. 15.
    A. Storjohann and G. Labahn. Asymptotically Fast Computation of Hermite Normal Forms of Integer Matrices. ISAAC’96, 1996, 259–266.Google Scholar
  16. 16.
    P. van Emde Boas. Another NP-complete partition problem and the copmlexity of computing short vectors in lattices. Technical Report 81-04. Mathematics Department, University of Amsterdam, 1981. Can be obtained from http://turing.wins.uva.nl/~peter.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Mårten Trolin
    • 1
  1. 1.Department of Numerical Analysis and Computer ScienceRoyal Institute of TechnologyStockholmSweden

Personalised recommendations