Paper 2025/244 Original: eprint.iacr.org/2025/244 ↗
Provable Speedups for SVP Approximation Under Random Local Blocks
Abstract
We point out if assuming every local block appearing in the slide reduction algorithms [ALNS20] is `random' (as usual in the cryptographic background), then the combination of the slide reduction algorithms [ALNS20] and Pouly-Shen 's algorithm [PoSh24] yields exponentially faster provably correct algorithms for $\delta$-approximate SVP for all approximation factors $n^{1/2+\varepsilon} \leq \delta \leq n^{O(1)}$, which is the regime most relevant for cryptography.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2025-02-16: last updated
- 2025-02-16: published
- Short URL
- https://ia.cr/2025/244
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2025/244,
author = {Jianwei Li},
title = {Provable Speedups for SVP Approximation Under Random Local Blocks},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/244},
year = {2025},
url = {https://eprint.iacr.org/2025/244}
}