Segment LLL Reduction of Lattice Bases Using Modular Arithmetic

Segment LLL Reduction of Lattice Bases Using Modular Arithmetic

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 gene...

Full description

Bibliographic Details
Main Authors: Sanjay Mehrotra, Zhifeng Li
Format: Article
Language:English
Published: MDPI AG 2010-07-01
Series:Algorithms
Subjects:
Lattice
LLL basis reduction
reduced basis
successive minima
segments
modular arithmetic
fast matrix multiplication
Online Access:http://www.mdpi.com/1999-4893/3/3/224/

Internet

http://www.mdpi.com/1999-4893/3/3/224/

Similar Items