Faster LLL-type Reduction of Lattice Bases

@inproceedings{Neumaier2016FasterLR,
  title={Faster LLL-type Reduction of Lattice Bases},
  author={A. Neumaier and D. Stehl{\'e}},
  booktitle={ISSAC '16},
  year={2016}
}
  • A. Neumaier, D. Stehlé
  • Published in ISSAC '16 2016
  • Materials Science, Computer Science, Mathematics
  • We describe an asymptotically fast variant of the LLL lattice reduction algorithm. It takes as input a basis B ∈ Z<sup>n x n</sup> and returns a (reduced) basis C of the Euclidean lattice L spanned by B, whose first vector satisfies |c<sub>1</sub>| ≤ (1+c) (4/3)<sup>(n-1)/4</sup> (det L)<sup>1/n</sup> for any fixed c>0. It terminates within O(n<sup>4+ε</sup> β<sup>1+ε</sup>) bit operations for any ε >0, with β = log max<sub>i</sub> |b<sub>i</sub>|. It does rely on fast integer arithmetic but… CONTINUE READING
    18 Citations
    Algebraic and Euclidean Lattices: Optimal Lattice Reduction and Beyond
    • 1
    • PDF
    Computing a Lattice Basis Revisited
    • 2
    Explicit Relation between Low-Dimensional LLL-Reduced Bases and Shortest Vectors
    Lattice Reduction Algorithms
    • 4
    • PDF
    A Complete Analysis of the BKZ Lattice Reduction Algorithm
    • 2
    • PDF
    Fast Matrix Multiplication and Symbolic Computation
    • 12
    • PDF
    Computing LLL-Reduced Basis for Orthogonal Lattice
    • 1
    Computing an LLL-reduced Basis of the Orthogonal Latice

    References

    SHOWING 1-3 OF 3 REFERENCES
    Segment LLL-Reduction of Lattice Bases
    • 52
    • Highly Influential
    • PDF
    Practical, Predictable Lattice Basis Reduction
    • 63
    • Highly Influential
    • PDF
    Factorization of Univariate Integer Polynomials by Diophantine Aproximation and an Improved Basis Reduction Algorithm
    • 107
    • Highly Influential