Back to Search
Start Over
Improving convergence and practicality of slide-type reductions.
- Source :
-
Information & Computation . Mar2023, Vol. 291, pN.PAG-N.PAG. 1p. - Publication Year :
- 2023
-
Abstract
- The best lattice reduction algorithm known in theory for approximating the Shortest Vector Problem (SVP) over lattices is the slide reduction algorithm (STOC '08 & CRYPTO '20). In this paper, we first improve the running time analysis of computing slide-reduced bases based on potential functions. This analysis applies to a generic slide reduction algorithm that includes (natural variants of) slide reduction and block-Rankin reduction (ANTS '14). We then present a rigorous dynamic analysis of generic slide reduction using techniques originally applied to a variant of BKZ (CRYPTO '11). This provides guarantees on the quality of the current lattice basis during execution. This dynamic analysis not only implies sharper convergence for these algorithms to find a short nonzero vector (rather than a fully reduced basis), but also allows to heuristically model/trace the practical behaviour of slide reduction. Interestingly, this dynamic analysis inspires us to introduce a new slide reduction variant with better time/quality trade-offs. This is confirmed by both our experiments and simulation, which also show that our variant is competitive with state-of-the-art reduction algorithms. To the best of our knowledge, this work is the first attempt of improving the practical performance of slide reduction beyond speeding up the SVP oracle. [ABSTRACT FROM AUTHOR]
- Subjects :
- *CRYPTOCURRENCIES
*POTENTIAL functions
*DYNAMICAL systems
*ALGORITHMS
Subjects
Details
- Language :
- English
- ISSN :
- 08905401
- Volume :
- 291
- Database :
- Academic Search Index
- Journal :
- Information & Computation
- Publication Type :
- Academic Journal
- Accession number :
- 162241646
- Full Text :
- https://doi.org/10.1016/j.ic.2023.105012