The Gaussian algorithm for lattice reduction in dimension 2 is precisely analysed under a class of realistic probabilistic models, which are of interest when applying the Gauss algorithm "inside'' the LLL algorithm. The proofs deal with the underlying dynamical systems and transfer operators. All the main parameters are studied: execution parameters which describe the behaviour of the algorithm itself as well as output parameters, which describe the geometry of reduced bases.
CITATION STYLE
Vallée, B., & Vera, A. (2007). Lattice reduction in two dimensions: analyses under realistic probabilistic models. Discrete Mathematics & Theoretical Computer Science, DMTCS Proceedings vol. AH,...(Proceedings). https://doi.org/10.46298/dmtcs.3549
Mendeley helps you to discover research relevant for your work.