## CryptoDB

### Paper: The Convergence of Slide-type Reductions

Authors: Michael Walter Search ePrint Search Google In this work, we apply the dynamical systems analysis of Hanrot et al. (CRYPTO'11) to a class of lattice block reduction algorithms that includes (natural variants of) slide reduction and block-Rankin reduction. This implies sharper bounds on the polynomial running times (in the query model) for these algorithms and opens the door to faster practical variants of slide reduction. We give heuristic arguments showing that such variants can indeed speed up slide reduction significantly in practice. This is confirmed by experimental evidence, which also shows that our variants are competitive with state-of-the-art reduction algorithms.
##### BibTeX
@article{pkc-2021-30970,
title={The Convergence of Slide-type Reductions},
booktitle={Public-Key Cryptography - PKC 2021},
publisher={Springer},
author={Michael Walter},
year=2021
}