New results on lattice basis reduction in practice

Werner Backes, Susanne Wetzel

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

3 Scopus citations

Abstract

In this paper we introduce several new heuristics as to speed up known lattice basis reduction methods and improve the quality of the computed reduced lattice basis in practice. We analyze substantial experimental data and to our knowledge, we are the first to present a general heuristic for determining which variant of the reduction algorithm, for varied parameter choices, yields the most efficient reduction strategy for reducing a particular problem instance.

Original languageEnglish
Title of host publicationAlgorithmic Number Theory - 4th International Symposium, ANTS-IV, Proceedings
EditorsWieb Bosma
Pages135-152
Number of pages18
DOIs
StatePublished - 2000
Event4th International Symposium on Algorithmic Number Theory, ANTS 2000 - Leiden, Netherlands
Duration: 2 Jul 20007 Jul 2000

Publication series

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

Conference

Conference4th International Symposium on Algorithmic Number Theory, ANTS 2000
Country/TerritoryNetherlands
CityLeiden
Period2/07/007/07/00

Fingerprint

Dive into the research topics of 'New results on lattice basis reduction in practice'. Together they form a unique fingerprint.

Cite this