This talk introduces the Lenstra–Lenstra–Lovász (LLL) algorithm and its role in lattice basis reduction. We describe how LLL serves as a high-dimensional generalization of Euclid’s algorithm for the greatest common divisor. By focusing on the two main operations -- size reduction and swapping -- we explain how the algorithm efficiently finds short, nearly orthogonal vectors in a lattice.
