An LLL-reduction algorithm with quasi-linear time complexity - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

An LLL-reduction algorithm with quasi-linear time complexity

(1, 2) , (1, 2) , (1, 2)
1
2

Abstract

We devise an algorithm, L1 tilde, with the following specifications: It takes as input an arbitrary basis B=(b_i)_i in Z^{d x d} of a Euclidean lattice L; It computes a basis of L which is reduced for a mild modification of the Lenstra-Lenstra-Lovász reduction; It terminates in time O(d^{5+eps} beta + d^{omega+1+eps} beta^{1+eps}) where beta = log max ||b_i|| (for any eps > 0 and omega is a valid exponent for matrix multiplication). This is the first LLL-reducing algorithm with a time complexity that is quasi-linear in the bit-length beta of the entries and polynomial in the dimension d. The backbone structure of L1 tilde is able to mimic the Knuth-Schönhage fast gcd algorithm thanks to a combination of cutting-edge ingredients. First the bit-size of our lattice bases can be decreased via truncations whose validity are backed by recent numerical stability results on the QR matrix factorization. Also we establish a new framework for analyzing unimodular transformation matrices which reduce shifts of reduced bases, this includes bit-size control and new perturbation tools. We illustrate the power of this framework by generating a family of reduction algorithms.
Fichier principal
Vignette du fichier
L1-hal.pdf (553.73 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ensl-00534899 , version 1 (10-11-2010)
ensl-00534899 , version 2 (07-04-2011)

Identifiers

Cite

Andrew Novocin, Damien Stehlé, Gilles Villard. An LLL-reduction algorithm with quasi-linear time complexity. STOC'11 - 43rd annual ACM symposium on Theory of computing, 2011, San Jose, United States. pp.403-412, ⟨10.1145/1993636.1993691⟩. ⟨ensl-00534899v2⟩
699 View
2217 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More