Modelling the LLL Algorithm by Sandpiles - GREYC amacc Access content directly
Conference Papers Year : 2010

Modelling the LLL Algorithm by Sandpiles

Abstract

The LLL algorithm aims at finding a "reduced" basis of a Euclidean lattice and plays a primary role in many areas of mathemat-ics and computer science. However, its general behaviour is far from being well understood. There are already many experimental observa-tions about the number of iterations or the geometry of the output, that raise challenging questions which remain unanswered and lead to natural conjectures which are yet to be proved. However, until now, there exist few experimental observations about the precise execution of the algo-rithm. Here, we provide experimental results which precisely describe an essential parameter of the execution, namely the "logarithm of the decreasing ratio". These experiments give arguments towards a "regu-larity" hypothesis (R). Then, we propose a simplified model for the LLL algorithm based on the hypothesis (R), which leads us to discrete dy-namical systems, namely sandpiles models. It is then possible to obtain a precise quantification of the main parameters of the LLL algorithm. These results fit the experimental results performed on general input bases, which indirectly substantiates the validity of such a regularity hypothesis and underlines the usefulness of such a simplified model.
Fichier principal
Vignette du fichier
ACTI-MADRITSCH-2010-2.pdf (303.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01082028 , version 1 (12-11-2014)

Identifiers

Cite

Manfred Madritsch, Brigitte Vallée. Modelling the LLL Algorithm by Sandpiles. Comptes Rendus de la Conférence LATIN 2010, Apr 2010, Oaxaca, Mexico. pp.267 - 281, ⟨10.1007/978-3-642-12200-2_25⟩. ⟨hal-01082028⟩
162 View
223 Download

Altmetric

Share

Gmail Facebook X LinkedIn More