An efficient LLL gram using buffered transformations

Werner Backes, Susanne Wetzel

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationComputer Algebra in Scientific Computing - 10th International Workshop, CASC 2007, Proceedings
Pages31-44
Number of pages14
DOIs
StatePublished - 2007
Event10th International Workshop on Computer Algebra in Scientific Computing, CASC 2007 - Bonn, Germany
Duration: 16 Sep 200720 Sep 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4770 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th International Workshop on Computer Algebra in Scientific Computing, CASC 2007
Country/TerritoryGermany
CityBonn
Period16/09/0720/09/07

Fingerprint

Dive into the research topics of 'An efficient LLL gram using buffered transformations'. Together they form a unique fingerprint.

Cite this