Computing an LLL-reduced basis of the orthogonal lattice
classification
💻 cs.SC
keywords
latticebasesbasisalgorithminputorthogonalaboveapplication
pith:WYLFHVMC Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{WYLFHVMC}
Prints a linked pith:WYLFHVMC badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.