Segment LLL Reduction of Lattice Bases Using Modular Arithmetic

Algorithms

Sanjay Mehrotra¹ 

关键词: Lattice;    LLL basis reduction;    reduced basis;    successive minima;    segments;    modular arithmetic;    fast matrix multiplication;   

DOI  :  10.3390/a3030224

来源: mdpi

【 摘 要 】

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 .

【 授权许可】

CC BY   
© 2010 by the authors; licensee MDPI, Basel, Switzerland.