Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

IACR
2016

favoriteEmaildiscussreport

36views Biometrics» more IACR 2016»

Bounding basis reduction properties

8 years 7 months ago

Bounding basis reduction properties

Download eprint.iacr.org

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 Classiﬁcation. 11H55, 11Y16 Contents

Arnold Neumaier

Real-time Traffic

Biometrics | IACR 2016 |

claim paper

Related Content

» Basis Reduction and the Complexity of BranchandBound

» Certification of the QR factor R and of lattice basis reducedness

» Error bound for multistage synthesis of narrow bandwidth Gabor filters

» On the reduction of a random basis

» Certified Reduced Basis Methods and Output Bounds for the Harmonic Maxwells Equations

» Distributed Symbolic Bounded Property Checking

» Proving More Properties with Bounded Model Checking

» Regret Minimizing Audits A LearningTheoretic Basis for Privacy Protection

» Analysis of Basis Pursuit Via Capacity Sets

» Auxiliary Variational Information Maximization for Dimensionality Reduction

Post Info
More Details (n/a)

Added	03 Apr 2016
Updated	03 Apr 2016
Type	Journal
Year	2016
Where	IACR
Authors	Arnold Neumaier

Comments (0)