Gesellschaft für Informatik e.V.

Lecture Notes in Informatics


Sicherheit 2010 Sicherheit, Schutz und Zuverlässigkeit P-170, 241-252 (2010).

Gesellschaft für Informatik, Bonn
2010


Copyright © Gesellschaft für Informatik, Bonn

Contents

Extended lattice reduction experiments using the BKZ algorithm

Michael Schneider and Johannes Buchmann

Abstract


We present experimental results using lattice reduction algorithms. We choose the BKZ algorithm, that is the algorithm considered the strongest one in this area in practice. It is an important task to analyze the practical behaviour of lattice reduction algorithms, as the theoretical predictions are far from being practical. Our work helps choosing the right parameters for lattice reduction in practice. The experiments in this paper go beyond the results of Gama and Nguyen in their Eurocrypt 2008 paper. We give evidence of some facts stated in their work, concerning the runtime and the output quality of lattice reduction algorithms.


Full Text: PDF

Gesellschaft für Informatik, Bonn
ISBN 978-3-88579-264-2


Last changed 04.10.2013 18:32:24