[Resource Topic] 2020/1409: The Convergence of Slide-type Reductions

Welcome to the resource topic for 2020/1409

The Convergence of Slide-type Reductions

Authors: Michael Walter


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.

ePrint: https://eprint.iacr.org/2020/1409

Talk: https://www.youtube.com/watch?v=e_6Wa0it_VQ

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .