Evaluating the performance of the practical lattice reduction algorithms

We investigate the current state-of-art performance of lattice reduction algorithms. We perform experiments to examine the limit of the practical lattice reduction algorithms such as Recursive-BKZ. We report a better attack on SWIFFT lattices based on a recent improvement of BKZ reduction. We also participate in several lattice challenges that evaluate the performance of the lattice-reduction algorithms. Our experimental results thus compare and sometimes concretize the previous similar work in this area.