Segment LLL reduction of lattice bases using modular arithmetic (Q1662551): Difference between revisions
From MaRDI portal
Latest revision as of 10:20, 16 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Segment LLL reduction of lattice bases using modular arithmetic |
scientific article |
Statements
Segment LLL reduction of lattice bases using modular arithmetic (English)
0 references
20 August 2018
0 references
Summary: The algorithm of Lenstra, Lenstra, and Lovász (LLL) transforms a given integer lattice basis into a reduced basis. Storjohann improved the worst case complexity of LLL algorithms by a factor of \(O(n)\) using modular arithmetic. Koy and Schnorr developed a segment-LLL basis reduction algorithm that generates lattice basis satisfying a weaker condition than the LLL reduced basis with \(O(n)\) improvement than the LLL algorithm. In this paper we combine Storjohann's modular arithmetic approach with the segment-LLL approach to further improve the worst case complexity of the segment-LLL algorithms by a factor of \(n^{0.5}\).
0 references
lattice
0 references
LLL basis reduction
0 references
reduced basis
0 references
successive minima
0 references
segments
0 references
modular arithmetic
0 references
fast matrix multiplication
0 references