The Lenstra–Lenstra–Lovász (LLL) Algorithm is a Polynomial-Time Algorithm that Finds a Short and Nearly Orthogonal Basis of a Lattice, which is Used for Applications Like Factoring Polynomials, Solving Integer Linear Programming Problems, and Cryptanalysis.
Coding the 1982 paper "Factoring Polynomials with Rational Coefficients" by Lenstra, Lenstra and Lovasz to understand LLL
We use LLL reduction to find the Hermite Normal Form of a matrix and solve linear diophantine equations.
Add a description, image, and links to the lenstra-lenstra-lovasz topic page so that developers can more easily learn about it.
To associate your repository with the lenstra-lenstra-lovasz topic, visit your repo's landing page and select "manage topics."