Computing an LLL-reduced basis of the orthogonal lattice
Symbolic Computation
2018-05-10 v1
Abstract
As a typical application, the Lenstra-Lenstra-Lovasz lattice basis reduction algorithm (LLL) is used to compute a reduced basis of the orthogonal lattice for a given integer matrix, via reducing a special kind of lattice bases. With such bases in input, we propose a new technique for bounding from above the number of iterations required by the LLL algorithm. The main technical ingredient is a variant of the classical LLL potential, which could prove useful to understand the behavior of LLL for other families of input bases.
Keywords
Cite
@article{arxiv.1805.03418,
title = {Computing an LLL-reduced basis of the orthogonal lattice},
author = {Jingwei Chen and Damien Stehlé and Gilles Villard},
journal= {arXiv preprint arXiv:1805.03418},
year = {2018}
}
Comments
ISSAC'18