TY - GEN
T1 - New results on lattice basis reduction in practice
AU - Backes, Werner
AU - Wetzel, Susanne
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2000.
PY - 2000
Y1 - 2000
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84946821098&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84946821098&partnerID=8YFLogxK
U2 - 10.1007/10722028_7
DO - 10.1007/10722028_7
M3 - Conference contribution
AN - SCOPUS:84946821098
SN - 3540676953
SN - 9783540676959
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 135
EP - 152
BT - Algorithmic Number Theory - 4th International Symposium, ANTS-IV, Proceedings
A2 - Bosma, Wieb
T2 - 4th International Symposium on Algorithmic Number Theory, ANTS 2000
Y2 - 2 July 2000 through 7 July 2000
ER -