An LLL algorithm with symmetries

Beth Romano, Jack A. Thorne

We give a generalisation of the Lenstra-Lenstra-Lovász (LLL) lattice-reduction algorithm that is valid for an arbitrary (split, semisimple) reductive group $G$. This can be regarde…