Sieve, Enumerate, Slice, and Lift: Hybrid Lattice Algorithms for SVP via CVPP
Ontology highlight
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 Practically, the main obstacles for observing a speedup in moderate dimensions appear to be that the leading constant in the
SUBMITTER: Nitaj A
PROVIDER: S-EPMC7335001 | biostudies-literature | 2020 Jun
REPOSITORIES: biostudies-literature
ACCESS DATA