Abstract
We introduce here a rewrite system in the group of unimodular matrices, i.e., matrices with integer entries and with determinant equal to ± 1. We use this rewrite system to precisely characterize the mechanism of the Gaussian algorithm, that finds shortest vectors in a two–dimensional lattice given by any basis. Putting together the algorithmic of lattice reduction and the rewrite system theory, we propose a new worst–case analysis of the Gaussian algorithm. There is already an optimal worst–case bound for some variant of the Gaussian algorithm due to Vallée [16] ValGaussRevisit. She used essentially geometric considerations. Our analysis generalizes her result to the case of the usual Gaussian algorithm. An interesting point in our work is its possible (but not easy) generalization to the same problem in higher dimensions, in order to exhibit a tight upper-bound for the number of iterations of LLL–like reduction algorithms in the worst case. Moreover, our method seems to work for analyzing other families of algorithms. As an illustration, the analysis of sorting algorithms are briefly developed in the last section of the paper.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akhavi, A.: Étude comparative d’algorithmes de réduction sur des réseaux aléatoires. PhD thesis, Université de Caen (1999)
Akhavi, A.: Worst-case complexity of the optimal LLL algorithm. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 476–490. Springer, Heidelberg (2000)
Daudé, H., Flajolet, P., Vallée, B.: An average-case analysis of the Gaussian algorithm for lattice reduction. Comb., Prob. & Comp. 123, 397–433 (1997)
Daudé, H., Vallée, B.: An upper bound on the average number of iterations of the LLL algorithm. Theoretical Computer Science 123(1), 95–115 (1994)
Kaib, M., Schnorr, C.P.: The generalized Gauss reduction algorithm. J. of Algorithms 21, 565–578 (1996)
Kannan, R.: Improved algorithm for integer programming and related lattice problems. In: 15th Ann. ACM Symp. on Theory of Computing, pp. 193–206 (1983)
Lagarias, J.C.: Worst-case complexity bounds for algorithms in the theory of integral quadratic forms. J. Algorithms 1, 142–186 (1980)
Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538–548 (1983)
Lenstra, H.W.: Flags and lattice basis reduction. In: Proceedings of the 3rd European Congress of Mathematics - Barcelona, July 2000, pp. 37–51. Birkhäuser, Basel (2000)
Lenstra, K., Lenstra, H.W., Lovász, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 513–534 (1982)
Magnus, W.: Über n-dimensionale Gittertransformationen. Acta Math. 64, 353–357 (1934)
Magnus, W., Karrass, A., Solitar, D.: Combinatorial group theory, 2nd revised edn. Dover, New York (1976)
Nguyen, P., Stern, J.: The two faces of lattices in cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, p. 146. Springer, Heidelberg (2001)
Nielsen, J.: Die Gruppe der dreidimensionale Gittertransformationen. Kgl Danske Videnskabernes Selskab., Math. Fys. Meddelelser 12, 1–29 (1924)
Nielsen, J.: Die Isomorphismengruppe der freien Gruppen. Math. Ann. 91, 169–209 (1924); translated in english by J. Stillwell in J. Nielsen collected papers 1
Vallée, B.: Gauss’ algorithm revisited. J. of Algorithms 12, 556–572 (1991)
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
Akhavi, A., Dos Santos, C.M. (2004). Another View of the Gaussian Algorithm. In: Farach-Colton, M. (eds) LATIN 2004: Theoretical Informatics. LATIN 2004. Lecture Notes in Computer Science, vol 2976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24698-5_51
Download citation
DOI: https://doi.org/10.1007/978-3-540-24698-5_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21258-4
Online ISBN: 978-3-540-24698-5
eBook Packages: Springer Book Archive