Slide Reduction, Revisited—Filling the Gaps in SVP Approximation - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Slide Reduction, Revisited—Filling the Gaps in SVP Approximation

(1) , (2) , (3, 4) , (5)
1
2
3
4
5

Abstract

We show how to generalize Gama and Nguyen's slide reduction algorithm [STOC '08] for solving the approximate Shortest Vector Problem over lattices (SVP) to allow for arbitrary block sizes, rather than just block sizes that divide the rank n of the lattice. This leads to significantly better running times for most approximation factors. We accomplish this by combining slide reduction with the DBKZ algorithm of Micciancio and Walter [Eurocrypt '16]. We also show a different algorithm that works when the block size is quite large-at least half the total rank. This yields the first non-trivial algorithm for sublinear approximation factors. Together with some additional optimizations, these results yield significantly faster provably correct algorithms for δ-approximate SVP for all approximation factors n 1/2+ε ≤ δ ≤ n O(1) , which is the regime most relevant for cryptography. For the specific values of δ = n 1−ε and δ = n 2−ε , we improve the exponent in the running time by a factor of 2 and a factor of 1.5 respectively.
Fichier principal
Vignette du fichier
Slide reduction from ALNS.pdf (531.94 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03068203 , version 1 (15-12-2020)

Identifiers

Cite

Divesh Aggarwal, Jianwei Li, Phong Q Nguyen, Noah Stephens-Davidowitz. Slide Reduction, Revisited—Filling the Gaps in SVP Approximation. CRYPTO 2020 - 40th Annual International Cryptology Conference, Aug 2020, Santa Barbara / Virtual, United States. pp.274-295, ⟨10.1007/978-3-030-56880-1_10⟩. ⟨hal-03068203⟩
403 View
97 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More