THE LLL ALGORITHM

The Lenstra–Lenstra–Lovász (LLL) algorithm is a lattice reduction algorithm invented

by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982. It calculates an LLL-
reduced basis of a given lattice in polynomial time. It and/or its variants are implemented
in: Maple, Mathematica, GP/Pari, Magma, Number Theory Library (NTL), SAGE, etc.
The original applications of the LLL algorithm are 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. Then it 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.
The target is to understand the LLL algorithm and find some applications of the
algorithm. More precise, the requirements are as follows.
• Describe the LLL algorithm.
• Prove that this algorithm runs in polynomial time.
• Compute some examples using the LLL algorithm.
• Show some applications of the LLL algorithm.

References
[1] Eva Bayer-Fluckiger. Lattices and number fields. In Algebraic geometry: Hirzebruch 70 (Warsaw,
1998), volume 241 of Contemp. Math., pages 69–84. Amer. Math. Soc., Providence, RI, 1999.
[2] Lenstra, A. K.; Lenstra, H. W., Jr.; Lovász, L. (1982). Factoring polynomials with rational coeffi-
cients. Mathematische Annalen 261 (4): 515534.
[3] Hendrik W. Lenstra, Jr. Lattices. In Algorithmic number theory: lattices, number fields, curves and
cryptography, volume 44 of Math. Sci. Res. Inst. Publ., pages 127–181. Cambridge Univ. Press,
Cambridge, 2008.
[4] Chris Peikert .
LLL, Coppersmith.
http://www.cc.gatech.edu/~cpeikert/lic13/lec03.pdf.
Lecture note of the course CS 8803 LIC: Lattices in Cryptography (2013).
[5] Daniele Micciancio.
Basis reduction.
http://cseweb.ucsd.edu/classes/sp14/cse206A-a/lec5.pdf.
Lecture note of the course CSE206A: Lattices Algorithms and Applications (Spring 2014).
[6] Oded Regev.
The LLL algorithm .
http://www.cims.nyu.edu/~regev/teaching/lattices_fall_2004/ln/lll.pdf.
Lecture note of the course Lattices in Computer Science (Fall 2009).
[7] Phong Nguyen.
1
2

The LLL algorithm .

Lecture note May 2010, Luminy.
[8] D. Simon Selected applications of LLL in number theory” (PDF) (2007). LLL+25 Conference (Caen,
France),