Abstract
Most of the interesting algorithmic problems in the geometry of numbers are NP-hard as the lattice dimension increases. This article deals with the low-dimensional case. We study a greedy lattice basis reduction algorithm for the Euclidean norm, which is arguably the most natural lattice basis reduction algorithm, because it is a straightforward generalization of the well-known two-dimensional Gaussian algorithm. Our results are two-fold. From a mathematical point of view, we show that up to dimension four, the output of the greedy algorithm is optimal: the output basis reaches all the successive minima of the lattice. However, as soon as the lattice dimension is strictly higher than four, the output basis may not even reach the first minimum. More importantly, from a computational point of view, we show that up to dimension four, the bit-complexity of the greedy algorithm is quadratic without fast integer arithmetic: this allows to compute various lattice problems (e.g. computing a Minkowski-reduced basis and a closest vector) in quadratic time, without fast integer arithmetic, up to dimension four, while all other algorithms known for such problems have a bit-complexity which is at least cubic. This was already proved by Semaev up to dimension three using rather technical means, but it was previously unknown whether or not the algorithm was still polynomial in dimension four. Our analysis, based on geometric properties of low-dimensional lattices and in particular Voronoï cells, arguably simplifies Semaev’s analysis in dimensions two and three, unifies the cases of dimensions two, three and four, but breaks down in dimension five.
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
Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proc. of the 28th Symposium on the Theory of Computing, pp. 99–108. ACM Press, New York (1996)
Ajtai, M.: The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract). In: Proc. of the 30th Symposium on the Theory of Computing, pp. 10–19. ACM Press, New York (1998)
Akhavi, A., Moreira dos Santos, C.: Another view of the Gaussian algorithm. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 474–487. Springer, Heidelberg (2004)
Cassels, J.W.S.: An Introduction to the Geometry of Numbers. Springer, Berlin (1959)
Gauss, C.F.: Disquisitiones Arithmeticæ. Leipzig (1801)
Gruber, M., Lekkerkerker, C.G.: Geometry of Numbers. North-Holland, Amsterdam (1987)
Helfrich, B.: Algorithms to construct Minkowski reduced and Hermite reduced lattice bases. Th. Computer Science 41, 125–139 (1985)
Hermite, C.: Extraits de lettres de M. Hermite à M. Jacobi sur différents objets de la théorie des nombres, deuxième lettre. J. Reine Angew. Math. 40, 279–290 (1850)
Hermite, C.: Œuvres. Gauthier-Villars, Paris (1905)
Kaib, M., Schnorr, C.P.: The generalized Gauss reduction algorithm. J. of Algorithms 21(3), 565–578 (1996)
Korkine, A., Zolotareff, G.: Sur les formes quadratiques. Math. Ann. 6, 336–389 (1873)
Lagarias, J.C.: Worst-case complexity bounds for algorithms in the theory of integral quadratic forms. J. of Algorithms 1, 142–186 (1980)
Lenstra, A.K., Lenstra Jr., H.W., Lovász, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 513–534 (1982)
Martinet, J.: Perfect Lattices in Euclidean Spaces. Springer, Heidelberg (2002)
Micciancio, D.: The shortest vector problem is NP-hard to approximate to within some constant. In: Proc. of the 39th Symposium on the Foundations of Computer Science, pp. 92–98. IEEE, Los Alamitos (1998)
Micciancio, D., Goldwasser, S.: Complexity of lattice problems: A cryptographic perspective. Kluwer Academic Publishers, Boston (2002)
Minkowski, H.: Geometrie der Zahlen. Teubner-Verlag, Leipzig (1896)
Nguyen, P.Q., Stern, J.: The two faces of lattices in cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 146–180. Springer, Heidelberg (2001)
Ryskov, S.S.: On Hermite, Minkowski and Venkov reduction of positive quadratic forms in n variables. Soviet Math. Doklady 13, 1676–1679 (1972)
Schnorr, C.P.: A hierarchy of polynomial lattice basis reduction algorithms. Th. Computer Science 53, 201–224 (1987)
Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Programming 66, 181–199 (1994)
Schnorr, C.P., Hörner, H.H.: Attacking the Chor-Rivest cryptosystem by improved lattice reduction. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 1–12. Springer, Heidelberg (1995)
Schönhage, A., Strassen, V.: Schnelle Multiplikation grosser Zahlen. Computing 7, 281–292 (1971)
Semaev, I.: A 3-dimensional lattice reduction algorithm. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 181–193. Springer, Heidelberg (2001)
Siegel, C.L.: Lectures on the Geometry of Numbers. Springer, Heidelberg (1989)
Stogrin, M.I.: Regular Dirichlet-Voronoï partitions for the second triclinic group. American Mathematical Society, Providence (1975); English translation of the Proceedings of the Steklov Institute of Mathematics (123) (1973)
Vallée, B.: Une Approche Géométrique de la Réduction de Réseaux en Petite Dimension. PhD thesis, Université de Caen (1986)
Vallée, B.: Gauss’ algorithm revisited. J. of Algorithms 12(4), 556–572 (1991)
van derWaerden, B.L.: Die Reduktionstheorie der positiven quadratischen Formen. Acta Mathematica 96, 265–309 (1956)
Voronoï, G.: Nouvelles applications des paramètres continus à la théorie des formes quadratiques. J. Reine Angew. Math. 134, 198–287 (1908)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, P.Q., Stehlé, D. (2004). Low-Dimensional Lattice Basis Reduction Revisited. In: Buell, D. (eds) Algorithmic Number Theory. ANTS 2004. Lecture Notes in Computer Science, vol 3076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24847-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-24847-7_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22156-2
Online ISBN: 978-3-540-24847-7
eBook Packages: Springer Book Archive