Next Article in Journal
An O(n)-Round Strategy for the Magnus-Derek Game
Next Article in Special Issue
Computation of the Metric Average of 2D Sets with Piecewise Linear Boundaries
Previous Article in Journal / Special Issue
Algorithmic Solution of Stochastic Differential Equations
Open AccessArticle

Segment LLL Reduction of Lattice Bases Using Modular Arithmetic

Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL 60208, USA
*
Author to whom correspondence should be addressed.
Algorithms 2010, 3(3), 224-243; https://doi.org/10.3390/a3030224
Received: 28 May 2010 / Accepted: 29 June 2010 / Published: 12 July 2010
(This article belongs to the Special Issue Algorithms for Applied Mathematics)
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 n0.5. View Full-Text
Keywords: Lattice; LLL basis reduction; reduced basis; successive minima; segments; modular arithmetic; fast matrix multiplication Lattice; LLL basis reduction; reduced basis; successive minima; segments; modular arithmetic; fast matrix multiplication
Show Figures

Figure 1

MDPI and ACS Style

Mehrotra, S.; Li, Z. Segment LLL Reduction of Lattice Bases Using Modular Arithmetic. Algorithms 2010, 3, 224-243.

Show more citation formats Show less citations formats

Article Access Map

1
Only visits after 24 November 2015 are recorded.
Back to TopTop