TY - GEN
T1 - An efficient LLL gram using buffered transformations
AU - Backes, Werner
AU - Wetzel, Susanne
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=38149096957&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38149096957&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-75187-8_4
DO - 10.1007/978-3-540-75187-8_4
M3 - Conference contribution
AN - SCOPUS:38149096957
SN - 9783540751861
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 31
EP - 44
BT - Computer Algebra in Scientific Computing - 10th International Workshop, CASC 2007, Proceedings
T2 - 10th International Workshop on Computer Algebra in Scientific Computing, CASC 2007
Y2 - 16 September 2007 through 20 September 2007
ER -