Lenstra–Lenstra–Lovász lattice basis reduction algorithm

The Lenstra–Lenstra–Lovász (LLL) lattice basis reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982. Given a basis $\mathbf = \$ with ''n''-dimensional integer coordinates, for a lattice L (a discrete subgroup of R^''n'') with $d \leq n$, the LLL algorithm calculates an ''LLL-reduced'' (short, nearly orthogonal) lattice basis in time $\mathcal O(d^5n\log^3 B)$ where $B$ is the largest length of $\mathbf_i$ under the Euclidean norm, that is, $B = \max\left(\, \mathbf_1\, _2, \, \mathbf_2\, _2, \dots, \, \mathbf_d\, _2\right)$.

The original applications were to give polynomial-time algorithms for factorizing polynomials with rational coefficients, for finding simultaneous rational approximations to real numbers, and for solving the integer linear programming problem in fixed dimensions.

LLL reduction

The precise definition of LLL-reduced is as follows: Given a basis
$\mathbf=\,$
define its Gram–Schmidt process orthogonal basis
$\mathbf^*=\,$
and the Gram-Schmidt coefficients
$\mu_=\frac,$ for any $1 \le j < i \le n$.

Then the basis $B$ is LLL-reduced if there exists a parameter $\delta$ in such that the following holds:

# (size-reduced) For $1 \leq j < i \leq n\colon \left, \mu_\\leq 0.5$. By definition, this property guarantees the length reduction of the ordered basis.
# (Lovász condition) For k = 2,3,..,n $\colon \delta \Vert \mathbf^*_\Vert^2 \leq \Vert \mathbf^*_k\Vert^2+ \mu_^2\Vert \mathbf^*_\Vert^2$.

Here, estimating the value of the $\delta$ parameter, we can conclude how well the basis is reduced. Greater values of $\delta$ lead to stronger reductions of the basis. Initially, A. Lenstra, H. Lenstra and L. Lovász demonstrated the LLL-reduction algorithm for $\delta = \frac$. Note that although LLL-reduction is well-defined for $\delta = 1$, the polynomial-time complexity is guaranteed only for $\delta$ in $(0.25,1)$.

The LLL algorithm computes LLL-reduced bases. There is no known efficient algorithm to compute a basis in which the basis vectors are as short as possible for lattices of dimensions greater than 4. However, an LLL-reduced basis is nearly as short as possible, in the sense that there are absolute bounds $c_i > 1$ such that the first basis vector is no more than $c_1$ times as long as a shortest vector in the lattice,
the second basis vector is likewise within $c_2$ of the second successive minimum, and so on.

Applications

An early successful application of the LLL algorithm was its use by Andrew Odlyzko and Herman te Riele in disproving Mertens conjecture.

The LLL algorithm has found numerous other applications in MIMO detection algorithms and cryptanalysis of public-key encryption schemes: knapsack cryptosystems, RSA with particular settings, NTRUEncrypt, and so forth. The algorithm can be used to find integer solutions to many problems.

In particular, the LLL algorithm forms a core of one of the integer relation algorithms. For example, if it is believed that ''r''=1.618034 is a (slightly rounded) root to an unknown quadratic equation with integer coefficients, one may apply LLL reduction to the lattice in $\mathbf^4$ spanned by ,0,0,10000r^2 ,1,0,10000r and ,0,1,10000/math>. The first vector in the reduced basis will be an integer linear combination of these three, thus necessarily of the form ,b,c,10000(ar^2+br+c)/math>; but such a vector is "short" only if ''a'', ''b'', ''c'' are small and $ar^2+br+c$ is even smaller. Thus the first three entries of this short vector are likely to be the coefficients of the integral quadratic polynomial which has ''r'' as a root. In this example the LLL algorithm finds the shortest vector to be , -1, -1, 0.00025and indeed $x^2-x-1$ has a root equal to the golden ratio, 1.6180339887....

Properties of LLL-reduced basis

Let $\mathbf=\$ be a $\delta$-LLL-reduced basis of a lattice $\mathcal L$. From the definition of LLL-reduced basis, we can derive several other useful properties about $\mathbf$.

# The first vector in the basis cannot be much larger than the shortest non-zero vector: $\Vert\mathbf_1 \Vert \le (2 / (\sqrt))^ \cdot \lambda_1(\mathcal L)$. In particular, for $\delta = 3/4$, this gives $\Vert\mathbf_1 \Vert \le 2^ \cdot \lambda_1(\mathcal L)$.
# The first vector in the basis is also bounded by the determinant of the lattice: $\Vert\mathbf_1 \Vert \le (2 / (\sqrt))^ \cdot (\det(\mathcal L))^$. In particular, for $\delta = 3/4$, this gives $\Vert\mathbf_1 \Vert \le 2^ \cdot (\det(\mathcal L))^$.
# The product of the norms of the vectors in the basis cannot be much larger than the determinant of the lattice: let $\delta = 3/4$, then $\prod_^n \Vert\mathbf_i \Vert \le 2^ \cdot \det(\mathcal L)$.

LLL algorithm pseudocode

The following description is based on , with the corrections from the errata.

INPUT
a lattice basis b₀, b₁, ..., b_''n'' in Z^''m''
a parameter ''δ'' with 1/4 < ''δ'' < 1, most commonly ''δ'' = 3/4
PROCEDURE
B^* <- GramSchmidt() = ; ''and do not normalize''
''μ''_''i'',''j'' <- InnerProduct(b_''i'', b_''j''^*)/InnerProduct(b_j^*, b_''j''^*); ''using the most current values of'' b_''i'' and b_''j''^*
''k'' <- 1;
while ''k'' <= ''n'' do
for ''j'' from ''k''−1 to 0 do
if , ''μ''_''k'',''j'', > 1/2 then
b_''k'' <- b_''k'' − ⌊''μ''_''k'',''j''⌉b_''j'';
''Update'' B^* ''and the related'' ''μ''_''i'',''j'''''s as needed.''
''(The naive method is to recompute'' B^* ''whenever'' b_''i'' ''changes:''
B^* <- GramSchmidt() = )
end if
end for
if InnerProduct(b_''k''^*, b_''k''^*) > (''δ − μ²''_{''k'',''k''−1}) InnerProduct(b_''k''−1^*, b_''k''−1^*) then
''k'' <- ''k'' + 1;
else
Swap b_''k'' and b_''k''−1;
''Update'' B^* ''and the related'' ''μ''_''i'',''j'''''s as needed.''
''k'' <- max(''k''−1, 1);
end if
end while
return B the LLL reduced basis of
OUTPUT
the reduced basis b₀, b₁, ..., b_''n'' in Z^''m''

Examples

Example from Z³

Let a lattice basis $\mathbf_1,\mathbf_2, \mathbf_3 \in \mathbf^$, be given by the columns of
$\begin 1 & -1& 3\\ 1 & 0 & 5\\ 1 & 2 & 6 \end$
then the reduced basis is
$\begin 0 & 1& -1\\ 1 & 0 & 0\\ 0 & 1 & 2 \end,$
which is size-reduced, satisfies the Lovász condition, and is hence LLL-reduced, as described above. See W. Bosma. for details of the reduction process.

Example from Z 'i''sup>4

Likewise, for the basis over the complex integers given by the columns of the matrix below,
$\begin -2+2i & 7+3i & 7+3i & -5+4i\\ 3+3i & -2+4i & 6+2i & -1+4i\\ 2+2i & -8+0i & -9+1i & -7+5i\\ 8+2i & -9+0i & 6+3i & -4+4i \end,$
then the columns of the matrix below give an LLL-reduced basis.
$\begin -6+3i & -2+2i & 2-2i & -3+6i \\ 6-1i & 3+3i & 5-5i & 2+1i \\ 2-2i & 2+2i & -3-1i & -5+3i \\ -2+1i & 8+2i & 7+1i & -2-4i \\ \end.$

Implementations

LLL is implemented in
Arageli
as the function lll_reduction_int
fpLLL
as a stand-alone implementation
*FLINT as the function fmpz_lll
* GAP as the function LLLReducedBasis
* Macaulay2 as the function LLL in the package LLLBases
*Magma as the functions LLL and LLLGram (taking a gram matrix)
*Maple as the function IntegerRelations LL/code>
*Mathematica as the function LatticeReduce
Number Theory Library (NTL)
as the function LLL
* PARI/GP as the function qflll
Pymatgen
as the function analysis.get_lll_reduced_lattice
*SageMath as the method LLL driven by fpLLL and NTL
* Isabelle/HOL in the 'archive of formal proofs' entry LLL_Basis_Reduction. This code exports to efficiently executable Haskell.

See also

* Coppersmith method

Notes

References

*
*
*
*
*

{{DEFAULTSORT:Lenstra-Lenstra-Lovasz Lattice Basis Reduction Algorithm
Theory of cryptography
Computational number theory
Lattice points