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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Ajtai. Generating Hard Instances of Lattice Problems. Proc. 28th ACM Symposium on Theory of Computing, pages 99–108, 1996.
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.
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.
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.
Kabatjanskii and Levenshtein. Bounds for Packings on a Sphere and in Space. Problems of Information Transmission 14, 1:1–17, 1978.
J.C. Lagarias. The Computational Complexity of Simultanous Diophantine Approximation Problems. SIAM Journal of Computing, 14:196–209, 1985.
A.K. Lenstra, H.W. Lenstra and L. Lovász. Factoring Polynomials with Rational Coefficients. Mathematische Annalen 261:515–534, 1982.
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.
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.
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.
A. Paz and C.P. Schnorr. Approximating Integer Lattices by Lattices with Cyclic Lattice Groups. Automata, languages and programming (Karlsruhe), 1987, 386–393.
C.P. Schnorr. A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms. Theoretical Computer Science, 53:201–224, 1987.
V. Shoup. NTL: A Library for doing Number Theory. Can be obtained from http://www.shoup.net.
H.J.S. Smith. On Systems of Linear Indeterminate Equations and Congruences. Philosophical Transactions of the Royal Society of London, 151:293–326, 1861.
A. Storjohann and G. Labahn. Asymptotically Fast Computation of Hermite Normal Forms of Integer Matrices. ISAAC’96, 1996, 259–266.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Trolin, M. (2001). The Shortest Vector Problem in Lattices with Many Cycles. In: Silverman, J.H. (eds) Cryptography and Lattices. CaLC 2001. Lecture Notes in Computer Science, vol 2146. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44670-2_14
Download citation
DOI: https://doi.org/10.1007/3-540-44670-2_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42488-8
Online ISBN: 978-3-540-44670-5
eBook Packages: Springer Book Archive