On the reduction of a random basis

Akhavi, Ali; Marckert, Jean-François; Rouault, Alain

ESAIM: Probability and Statistics, Tome 13 (2009), pp. 437-458.

For $p\le n$, let $b_1^{\left(n\right)},...,b_p^{\left(n\right)}$ be independent random vectors in ${ℝ}^n$ with the same distribution invariant by rotation and without mass at the origin. Almost surely these vectors form a basis for the euclidean lattice they generate. The topic of this paper is the property of reduction of this random basis in the sense of Lenstra-Lenstra-Lovász (LLL). If ${\widehat{b}}_1^{\left(n\right)},...,{\widehat{b}}_p^{\left(n\right)}$ is the basis obtained from $b_1^{\left(n\right)},...,b_p^{\left(n\right)}$ by Gram-Schmidt orthogonalization, the quality of the reduction depends upon the sequence of ratios of squared lengths of consecutive vectors $r_j^{\left(n\right)}=\parallel {\widehat{b}}_{n-j+1}^{\left(n\right)}{\parallel }^2/{\parallel {\widehat{b}}_{n-j}^{\left(n\right)}\parallel }^2$, $j=1,...,p-1$. We show that as $n\to \infty$ the process $(r_j^{\left(n\right)}-1,j\ge 1)$ tends in distribution in some sense to an explicit process $({ℛ}_j-1,j\ge 1)$; some properties of the latter are provided. The probability that a random random basis is $s$-LLL-reduced is then showed to converge for $p=n-g$, and $g$ fixed, or $g=g\left(n\right)\to +\infty$.

Classification : 15A52, 15A03, 60B12, 60F99, 06B99, 68W40
Mots clés : random matrices, random basis, orthogonality index, determinant, lattice reduction

[1] J. Abbott and T. Mulders, How tight is Hadamard bound? Experiment. Math. 10 (2001) 331-336. | MR | Zbl

[2] A. Akhavi, Analyse comparative d'algorithmes de réduction sur les réseaux aléatoires. Ph.D. thesis, Université de Caen (1999).

[3] A. Akhavi, Random lattices, threshold phenomena and efficient reduction algorithms. Theor. Comput. Sci. 287 (2002) 359-385. | MR | Zbl

[4] A. Akhavi, J.-F. Marckert and A. Rouault. On the reduction of a random basis, in D. Applegate, G.S. Brodal, D. Panario and R. Sedgewick Eds. Proceedings of the ninth workshop on algorithm engineering and experiments and the fourth workshop on analytic algorithmics and combinatorics. New Orleans (2007). | MR

[5] T.W. Anderson, An introduction to multivariate statistical analysis. Wiley Series in Probability and Statistics, Third edition. John Wiley (2003). | MR | Zbl

[6] N.R. Chaganthy, Large deviations for joint distributions and statistical applications. Sankhya 59 (1997) 147-166. | MR | Zbl

[7] L. Chaumont and M. Yor, Exercises in probability. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge (2003). | MR | Zbl

[8] H. Daudé and B. Vallée, An upper bound on the average number of iterations of the LLL algorithm. Theor. Comput. Sci. 123 (1994) 95-115. | MR | Zbl

[9] J.D. Dixon, How good is Hadamard's inequality for determinants? Can. Math. Bull. 27 (1984) 260-264. | MR | Zbl

[10] J.L. Donaldson, Minkowski reduction of integral matrices. Math. Comput. 33 (1979) 201-216. | MR | Zbl

[11] A. Edelman and N.R. Rao, Random matrix theory. Acta Numerica (2005) 1-65. | MR | Zbl

[12] Y.H. Gan, C. Ling, and W.H. Mow, Complex Lattice Reduction Algorithm for Low-Complexity MIMO Detection. IEEE Trans. Signal Processing 57 (2009) 2701-2710.

[13] J. Hadamard, Résolution d'une question relative aux déterminants. Bull. Sci. Math. 17 (1893) 240-246. | JFM

[14] R. Kannan, Algorithmic geometry of numbers, in Annual review of computer science, Vol. 2. Annual Reviews, Palo Alto, CA (1987) 231-267. | MR

[15] D.E. Knuth, The art of computer programming, Vol. 2. Addison-Wesley Publishing Co., Reading, Mass., second edition. Seminumerical algorithms, Addison-Wesley Series in Computer Science and Information Processing (1981). | MR | Zbl

[16] H. Koy and C.P. Schnorr, Segment LLL-Reduction of Lattice Bases. Lect. Notes Comput. Sci. 2146 (2001) 67. | MR | Zbl

[17] H.W. Lenstra Jr., Integer programming and cryptography. Math. Intelligencer 6 (1984) 14-19. | MR | Zbl

[18] H.W. Lenstra Jr., Flags and lattice basis reduction. In European Congress of Mathematics, Vol. I (Barcelona, 2000). Progr. Math. 201 37-51. Birkhäuser, Basel (2001). | MR | Zbl

[19] A.K. Lenstra, H.W. Lenstra Jr. and L. Lovász, Factoring polynomials with rational coefficients. Math. Ann. 261 (1982) 515-534. | EuDML | MR | Zbl

[20] G. Letac, Isotropy and sphericity: some characterisations of the normal distribution. Ann. Statist. 9 (1981) 408-417. | MR | Zbl

[21] R.J. Muirhead, Aspects of multivariate statistical theory. John Wiley (1982). | MR | Zbl

[22] H. Napias, A generalization of the LLL-algorithm over euclidean rings or orders. Journal de théorie des nombres de Bordeaux 8 (1996) 387-396. | EuDML | Numdam | MR | Zbl

[23] P.Q. Nguyen and J. Stern, The two faces of lattices in cryptology. In Cryptography and lattices (Providence, RI, 2001). Lect. Notes Comput. Sci. 2146 (2001) 146-180. Springer. | MR | Zbl

[24] A. Rouault, Asymptotic behavior of random determinants in the Laguerre, Gram and Jacobi ensembles. ALEA Lat. Am. J. Probab. Math. Stat. 3 (2007) 181-230 (electronic). | Zbl

[25] C.P. Schnorr, A hierarchy of polynomial time basis reduction algorithms. Theory of algorithms, Colloq. Pécs/Hung, 1984. Colloq. Math. Soc. János Bolyai 44 (1986) 375-386. | MR | Zbl

[26] B. Vallée, Un problème central en géométrie algorithmique des nombres : la réduction des réseaux. Autour de l'algorithme de Lenstra Lenstra Lovasz. RAIRO Inform. Théor. Appl. 3 (1989) 345-376. English translation by E. Kranakis in CWI-Quarterly - 1990 - 3. | EuDML | Numdam | Zbl