An Efficient LLL Gram Using Buffered Transformations

In this paper we introduce an improved variant of the LLL algorithm. Using the Gram matrix to avoid expensive correction steps necessary in the Schnorr-Euchner algorithm and introducing the use of buffered transformations allows us to obtain a major improvement in reduction time. Unlike previous work, we are able to achieve the improvement while obtaining a strong reduction result and maintaining the stability of the reduction algorithm.

• Type: Conference
• Year: 2007
• Where: CASC
• Authors: Werner Backes, Susanne Wetzel
• Keywords: CASC 2007, Expensive Correction Steps, LLL Algorithm, Mathematics, Reduction Algorithm