International Association for Cryptologic Research (IACR)
Abstract
The paper describes improved analysis techniques for basis reduction
that allow one to prove strong complexity bounds and reduced basis
guarantees for traditional reduction algorithms and some of their
variants. This is achieved by a careful exploitation of the linear
equations and inequalities relating various bit sizes before and after
one or more reduction steps