The convergence of slide-type reductions

Walter, Michael

The convergence of slide-type reductions

Walter M. 2021. The convergence of slide-type reductions. Public-Key Cryptography – PKC 2021. PKC: IACR International Conference on Practice and Theory of Public Key Cryptography, LNCS, vol. 12710, 45–67.

Download

2021_PKC_Walter.pdf 489.02 KB [Published Version]

DOI

10.1007/978-3-030-75245-3_3

Conference Paper | Published | English

Scopus indexed

Author

Walter, Michael^ISTA

Department

Pietrzak Group

Grant

Teaching Old Crypto New Tricks

Series Title

LNCS

Abstract

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.

Publishing Year

2021

Date Published

2021-05-01

Proceedings Title

Public-Key Cryptography – PKC 2021

Publisher

Springer Nature

Acknowledgement

This work was initiated in discussions with Léo Ducas, when the author was visiting the Simons Institute for the Theory of Computation during the program “Lattices: Algorithms, Complexity, and Cryptography”. We thank Thomas Espitau for pointing out a bug in a proof in an earlier version of this manuscript.

Volume

12710

Page

45-67

Conference

PKC: IACR International Conference on Practice and Theory of Public Key Cryptography

Conference Location

Virtual

Conference Date

2021-05-10 – 2021-05-13

ISBN

9783030752446

ISSN

03029743

eISSN

16113349

IST-REx-ID

9466

Cite this

Walter M. The convergence of slide-type reductions. In: Public-Key Cryptography – PKC 2021. Vol 12710. Springer Nature; 2021:45-67. doi:10.1007/978-3-030-75245-3_3

Walter, M. (2021). The convergence of slide-type reductions. In Public-Key Cryptography – PKC 2021 (Vol. 12710, pp. 45–67). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-75245-3_3

Walter, Michael. “The Convergence of Slide-Type Reductions.” In Public-Key Cryptography – PKC 2021, 12710:45–67. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-75245-3_3.

M. Walter, “The convergence of slide-type reductions,” in Public-Key Cryptography – PKC 2021, Virtual, 2021, vol. 12710, pp. 45–67.

Walter, Michael. “The Convergence of Slide-Type Reductions.” Public-Key Cryptography – PKC 2021, vol. 12710, Springer Nature, 2021, pp. 45–67, doi:10.1007/978-3-030-75245-3_3.

All files available under the following license(s):

Creative Commons Attribution 4.0 International Public License (CC-BY 4.0):