segment lll reduction of lattice bases using modular arithmetic段微光减少晶格基地利用模运算.pdfVIP

Algorithms 2010, 3, 224-243; doi:10.3390/a3030224 OPEN ACCESS algorithms ISSN 1999-4893 /journal/algorithms Article Segment LLL Reduction of Lattice Bases Using Modular Arithmetic Sanjay Mehrotra and Zhifeng Li Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL 60208, USA Author to whom correspondence should be addressed; E-Mail: mehrotra@; Tel.: +1-847-491-3155; Fax: +1-847-491-8005. Received: 28 May 2010 / Accepted: 29 June 2010 / Published: 12 July 2010 ´ Abstract: The algorithm of Lenstra, Lenstra, and Lovasz (LLL) transforms a given integer lattice basis into a reduced basis. Storjohann improved the worst case complexity of LLL algorithms by a factor of 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 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 . Keywords: Lattice; LLL basis reduction; reduced basis; successive minima; segments; modular arithmetic; fast matrix multiplication 1. Introduction Given row vectors an integer lattice (for short lattice) is defined as