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

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.