A Greedy Global Framework for LLL

ePrint Report: A Greedy Global Framework for LLL

Sanjay Bhattacherjee, Julio Hernandez-Castro, Jack Moyler

LLL-style lattice reduction algorithms employ two operations on ordered basis vectors - size reduction and reordering - to improve the basis quality by iteratively finding shorter and more orthogonal vectors. These algorithms typically have two design features. First, they work with a local or global measure of basis quality. Second, they reorder a subset of the basis vectors based on the basis quality before and after …

algorithms design eprint report features framework global greedy jack local measure operations quality report size work