Cryptology ePrint Archive: Report 2020/487

Sieve, Enumerate, Slice, and Lift: Hybrid Lattice Algorithms for SVP via CVPP

Emmanouil Doulgerakis and Thijs Laarhoven and Benne de Weger

Abstract: Motivated by recent results on solving large batches of closest vector problem (CVP) instances, we study how these techniques can be combined with lattice enumeration to obtain faster methods for solving the shortest vector problem (SVP) on high-dimensional lattices.

Theoretically, under common heuristic assumptions we show how to solve SVP in dimension $d$ with a cost proportional to running a sieve in dimension $d - \Theta(d / \log d)$, resulting in a $2^{\Theta(d / \log d)}$ speedup and memory reduction compared to running a full sieve. Combined with techniques from [Ducas, Eurocrypt 2018] we can asymptotically get a total of $[\log(13/9) + o(1)] \cdot d / \log d$ dimensions \textit{for free} for solving SVP.

Practically, the main obstacles for observing a speedup in moderate dimensions appear to be that the leading constant in the $\Theta(d / \log d)$ term is rather small; that the overhead of the (batched) slicer may be large; and that competitive enumeration algorithms heavily rely on aggressive pruning techniques, which appear to be incompatible with our algorithms. These obstacles prevented this asymptotic speedup (compared to full sieving) from being observed in our experiments. However, it could be expected to become visible once optimized CVPP techniques are used in higher dimensional experiments.

Category / Keywords: foundations / lattice sieving, lattice enumeration, randomized slicer, shortest vector problem (SVP), closest vector problem (CVP)

Original Publication (in the same form): Africacrypt 2020

Date: received 26 Apr 2020, last revised 26 Apr 2020

Contact author: e doulgerakis at tue nl

Available format(s): PDF | BibTeX Citation

Version: 20200428:121532 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]