Related Experiment Video
Updated: Dec 11, 2025

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
Published on: March 18, 2019
Formalizing the LLL Basis Reduction Algorithm and the LLL Factorization Algorithm in Isabelle/HOL
René Thiemann1, Ralph Bottesch1, Jose Divasón2
1University of Innsbruck, Innsbruck, Austria.
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.
Related Concept Videos
Fundamental Theorem of Algebra
Block Diagram Reduction
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
Partial Fractions
Synthetic Disvision of Polynomials
Thevinin's Theorem
Theorems of Pappus and Guldinus: Problem Solving

