 | The ACM Journal of Experimental Algorithmics |
Volume 7, Article 1, 2002
Heuristics on Lattice Basis Reduction in Practice
by
and
http://www.jea.acm.org/2002/BackesLattice/
Abstract:
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.
Keywords: Lattice basis reduction, dynamic approximation, modular and iterative
heuristics, general reduction heuristics
- Sources:
- The LaTeX version of the article;
this is a Unix file that contains the LaTeX source;
note that you must be a subscriber (institutional or individual) to access this file.
- The Postscript
version or PDF
version of the article;
note that you must be a subscriber (institutional or individual) to access
these files.
- The HTML version of the article;
note that you must be a subscriber (institutional or individual) to access
this file.
- The bibliography given in the article.
Received
|
Accepted
|
Final Revision
|
Published
|
|
|
|
|
Last updated and validated May 11, 2002, by editor@jea.acm.org