Algorithms 2010, 3(3), 224-243; doi:10.3390/a3030224
Article

Segment LLL Reduction of Lattice Bases Using Modular Arithmetic

Sanjay Mehrotra* email and Zhifeng Li
Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL 60208, USA
* Author to whom correspondence should be addressed.
Received: 28 May 2010 / Accepted: 29 June 2010 / Published: 12 July 2010
(This article belongs to the Special Issue Algorithms for Applied Mathematics)
PDF Full-text Download PDF Full-Text [396 KB, uploaded 12 July 2010 13:40 CEST]
Abstract: 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.
Keywords: Lattice; LLL basis reduction; reduced basis; successive minima; segments; modular arithmetic; fast matrix multiplication

Article Statistics

Click here to load and display the download statistics.

Cite This Article

MDPI and ACS Style

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

AMA Style

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

Chicago/Turabian Style

Mehrotra, Sanjay; Li, Zhifeng. 2010. "Segment LLL Reduction of Lattice Bases Using Modular Arithmetic." Algorithms 3, no. 3: 224-243.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert