Lattice basis reduction with dynamic approximation

Werner Backes, Susanne Wetzel

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

1 Scopus citations

Abstract

In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the new heuristic is more efficient in reducing large problem instances and extends the applicability of the Schnorr-Euchner algorithm such that problem instances that the state-of-the-art method fails to reduce can be solved using our new technique.

Original languageEnglish
Title of host publicationAlgorithm Engineering - 4th International Workshop, WAE 2000, Proceedings
EditorsStefan Naher, Dorothea Wagner
Pages63-73
Number of pages11
DOIs
StatePublished - 2001
Event4th International Workshop on Algorithm Engineering, WAE 2000 - Saarbrucken, Germany
Duration: 5 Sep 20008 Sep 2000

Publication series

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

Conference

Conference4th International Workshop on Algorithm Engineering, WAE 2000
Country/TerritoryGermany
CitySaarbrucken
Period5/09/008/09/00

Fingerprint

Dive into the research topics of 'Lattice basis reduction with dynamic approximation'. Together they form a unique fingerprint.

Cite this