Bounding basis reduction properties

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. Keywords. basis reduction; lattices; BKZ algorithm; LLL algorithm MSC 2010 Classification. 11H55, 11Y16 Contents

• Type: Journal
• Year: 2016
• Where: IACR
• Authors: Arnold Neumaier
• Keywords: Biometrics, IACR 2016