Abstract

The LLL basis reduction algorithm was the first polynomial-time algorithm to compute a reduced basis of a given lattice, and hence also a short vector in the lattice. It approximates an NP-hard problem where the approximation quality solely depends on the dimension of the lattice, but not the lattice itself. The algorithm has applications in number theory, computer algebra and cryptography. In this paper, we provide an implementation of the LLL algorithm. Both its soundness and its polynomial running-time have been verified using Isabelle/HOL. Our implementation is nearly as fast as an implementation in a commercial computer algebra system, and its efficiency can be further increased by connecting it with fast untrusted lattice reduction algorithms and certifying their output. We additionally integrate one application of LLL, namely a verified factorization algorithm for univariate integer polynomials which runs in polynomial time.

BibTeX

@inproceedings{RTRBJD-JAR20,
 author    = "René Thiemann and Ralph Bottesch and Jose Divasón and Max W. Haslbeck and Sebastiaan J.C. Joosten and Akihisa Yamada",
 title     = "Formalizing the LLL Basis Reduction Algorithm and the LLL Factorization Algorithm in Isabelle/HOL",
 series    = "J Autom Reasoning",
 volume    = 64,
 pages     = "827--856",
 year      = 2020,
 doi       = "10.1007/s10817-020-09552-1"
}