Adelic reduction of module lattices
We give a strict generalization of the LLL algorithm over number fields, based on the reduction theory of $\GL(n)$ over the adele ring of a number field. Our algorithm is free of heuristics, with rigorous bounds on output quality and complexity. As a consequence, we obtain a hierarchy of reductions from module-(H)SVP t...