DMCA
An Average-case Analysis of the Gaussian Algorithm for Lattice Reduction (1996)
| Citations: | 47 - 9 self |
BibTeX
@MISC{Daude96anaverage-case,
author = {Hervé Daude and Philippe Flajolet and Brigitte Vallée},
title = {An Average-case Analysis of the Gaussian Algorithm for Lattice Reduction},
year = {1996}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
.The Gaussian algorithm for lattice reduction in dimension 2 is analysed under its standard version. It is found that, when applied to random inputs in a continuous model, the complexity is constant on average, the probability distribution decays geometrically, and the dynamics is characterized by a conditional invariant measure. The proofs make use of connections between lattice reduction, continued fractions, continuants, and functional operators. Analysis in the discrete model and detailed numerical data are also presented. Une analyse en moyenne de l'algorithme de Gauss de r'eduction des r'eseaux R'esum'e. L'algorithme de r'eduction des r'eseaux en dimension 2 qui est du `a Gauss est analys'e sous sa forme dite standard. Il est 'etabli ici que, sous un mod`ele continu, sa complexit'e est constante en moyenne et que la distribution de probabilit'es associ'ee decroit g'eom'etriquement tandis que la dynamique est caract'eris'ee par une densit'e conditionnelle invariante. Les preuves f...
Keyphrases
lattice reduction gaussian algorithm average-case analysis eduction de ee par une densit dite standard probability distribution conditionnelle invariante standard version ele continu etabli ici que etriquement tandis que la dynamique functional operator qui est du sou un mod detailed numerical data discrete model continuous model e associ sou sa ee decroit conditional invariant measure sa complexit
