TY - JOUR
T1 - Heuristics on lattice basis reduction in practice
AU - Backes, Werner
AU - Wetzel, Susanne
N1 - Publisher Copyright:
© 2002, Association for Computing Machinery. All rights reserved.
PY - 2002
Y1 - 2002
N2 - In this paper we provide a survey on LLL lattice basis reduction in practice. 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 general heuristics 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 provide a survey on LLL lattice basis reduction in practice. 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 general heuristics for determining which variant of the reduction algorithm, for varied parameter choices, yields the most efficient reduction strategy for reducing a particular problem instance.
KW - Dynamic approximation
KW - General reduction heuristics
KW - Lattice basis reduction
KW - Modular and iterative heuristics
UR - http://www.scopus.com/inward/record.url?scp=33746695240&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33746695240&partnerID=8YFLogxK
U2 - 10.1145/944618.944619
DO - 10.1145/944618.944619
M3 - Article
AN - SCOPUS:33746695240
SN - 1084-6654
VL - 7
JO - ACM Journal of Experimental Algorithmics
JF - ACM Journal of Experimental Algorithmics
M1 - 944619
ER -