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 with n-dimensional integer coordinates, for a lattice L (a discrete subgroup of Rⁿ) with , the LLL algorithm calculates an LLL-reduced (short, nearly orthogonal) lattice basis in time where is the largest length of under the Euclidean norm, that is, .

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

define its Gram–Schmidt process orthogonal basis

and the Gram-Schmidt coefficients for any .

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

1. (size-reduced) For . By definition, this property guarantees the length reduction of the ordered basis.
2. (Lovász condition) For k = 2,3,..,n .

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

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 such that the first basis vector is no more than times as long as a shortest vector in the lattice, the second basis vector is likewise within 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 the 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 spanned by and . The first vector in the reduced basis will be an integer linear combination of these three, thus necessarily of the form ; but such a vector is "short" only if a, b, c are small and 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, -1, 0.00025] and indeed has a root equal to the golden ratio, 1.6180339887....

Properties of LLL-reduced basis

Let be a -LLL-reduced basis of a lattice . From the definition of LLL-reduced basis, we can derive several other useful properties about .

1. The first vector in the basis cannot be much larger than the shortest non-zero vector: . In particular, for , this gives .
2. The first vector in the basis is also bounded by the determinant of the lattice: . In particular, for , this gives .
3. The product of the norms of the vectors in the basis cannot be much larger than the determinant of the lattice: let , then .

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({b₁, ..., b_n}) = {b₁^*, ..., b_n^*}; 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 <- 2; while k <= n do for j from k−1 to 1 do if |μ_k,j| > 1/2 then b_k <- b_k − ⌊μ_k,j⌉b_j; Update B^* and the related μ_i,j<nowiki/>'s as needed. (The naive method is to recompute B^* whenever b_i changes: B^* <- GramSchmidt({b₁, ..., b_n}) = {b₁^*, ..., b_n^*}) 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<nowiki/>'s as needed. k <- max(k−1, 2); end if end while return B the LLL reduced basis of {b₁, ..., b_n} OUTPUT the reduced basis b₁, b₂, ..., b_n in Z^m

Examples

Example from Z³

Let a lattice basis , be given by the columns of

then the reduced basis is

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]⁴

Likewise, for the basis over the complex integers given by the columns of the matrix below,

then the columns of the matrix below give an LLL-reduced basis.

Implementations

LLL is implemented in

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

See also

• Coppersmith method

Notes

References