= Lenstra–Lenstra–Lovász lattice basis reduction algorithm
{wiki=Lenstra–Lenstra–Lovász_lattice_basis_reduction_algorithm}
The Lenstra–Lenstra–Lovász (LLL) algorithm is a polynomial-time algorithm for lattice basis reduction. It is named after its creators Arjen K. Lenstra, Hendrik W. Lenstra Jr., and László Lovász, who introduced it in 1982. The algorithm is significant in computational number theory and has applications in areas such as cryptography, coding theory, integer programming, and combinatorial optimization. \#\#\# Key Concepts 1.
Back to article page
