Sieve algorithms are a class of randomized exponential time algorithms for the exact (or almost exact) solution of lattice problems. They improve the asymptotic running time of traditional enumeration algorithms, reducing the dependency of the running time on the lattice dimension from to single exponential for some constant . The improvement is achieved at the cost of introducing randomization and using exponential space. Sieve algorithms have been studied primarily as a method to find exact solutions to the shortest vector problem (SVP) in the euclidean norm, but they can be adapted to other norms and other lattice problems.
There are two main types of lattice sieve algorithms:
The Classic Sieve of (1). This method works by first building a long list of lattice vectors, and then throwing away vectors from the list in the process of finding shorter and shorter lattice vectors.
The List Sieve of (2). This method works by starting from an empty list, and appending shorter and shorter lattice vectors to it, as the list grows longer.
Somehow related to sieving, is a newer type of combinatorial algorithms which work by building a list of short random vectors (not necessarily in the lattice), and then try to produce short lattice vectors by taking linear combinations of the vectors in the list.
Current provable versions of lattice sieve algorithms (as well as combinatorial ones) are not particularly effective, due both to their high exponential space complexity, and other inefficiencies associated to the use of random perturbations. However, they are the basis of several heuristic variants that have been implemented and shown to offer an interesting alternative to traditional enumeration methods.
See slides from presentation of (2) for an illustration of how sieve algorithms work, the impact of random perturbations on performance of provable algorithms, and some performance data on practical implementations.
The first sieve algorithm for lattice problems was proposed in
which provably solves SVP in the Euclidean norm. It holds a special place in the historical development of lattice algorithms as the first method to solve a hard lattice problem in single exponential time . The constant in the exponent of the running time was initially rather large, but it has been improved in
Faster exponential time algorithms for the shortest vector problem
(Micciancio & Voulgaris - SODA 2010) [eccc, slides, code]
Algorithms for the shortest and closest lattice vector problems
(Hanrot, Pujol & Stehle - IWCC 2011) [pdf] (See also ePrint 2009/605)
first to (2) and then to (3). Combinatorial algorithms further improve this constant to .
Provable versions of sieve algorithms make use of random perturbations which greatly affect their performance. Heuristic variants of sieve algorithms avoid the use of perturbations, and while losing provable correctness and running time guarantees, they perform much better in practice. The first heuristic variant of sieve algorithms was proposed in
which demonstrated that this type of algorithms can be run in practice in moderately low dimension, though still not competitive with enumeration techniques. A much faster heuristic algorithm (the Gauss Sieve) was then proposed in (2), which has been the target of many implementations and experimental studies. Many other heuristic sieve algorithms have been subsequently proposed, improving (4) and (2) using various forms of hashing.
Improved Nguyen-Vidick heuristic sieve algorithm for shortest vector problem
(Wang, Liu, Tian & Bi - AsiaCCS 2011) [ePrint]
A three-level sieve algorithm for the shortest vector problem
(Zhang, Pan & Hu - SAC 2013) [ePrint, slides]
Sieving for shortest vectors in lattices using angular locality-sensitive hashing
(Laarhoven - Crypto 2015) [ePrint]
Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
(Laarhoven & de Weger - LatinCrypt 2015) [ePrint]
Speeding-up lattice sieving without increasing the memory, using sub-quadratic nearest neighbor search
(Becker, Gama & Joux - ePrint 2015/522)
Efficient (ideal) lattice sieving using cross-polytope LSH
(Becker & Laarhoven - ePrint 2015/823)
The paper (8) heuristically achieves the constant in the exponent of the running time, but the algorithm is not entirely practical.
Lattice sieve algorithms can be generalized to solve problems other than SVP (albeit only approximately, within a factor ), and work in arbitrary norms.
Sampling short lattice vectors and the closest lattice vector problem
(Ajtai, Kumar & Sivakumar - CCC 2002)
approximates CVP (in the Euclidean norm) within a factor in time .
Sampling methods for shortest vectors, closest vectors and successive minima
(Blömer & Naewe - TCS 410(18) 2009 / ICALP 2007)
improves the dependency of the running time on ε to , and extends the algorithm to any norm
Covering cubes and the closest vector problem
(Eisenbrand, Hahnle & Nieneier - SoCG 2011) [arXiv]
further improves dependency on to for approximate CVP in the norm
Some sieving algorithms for lattice problems
(Arvind & Joglekar - FSTTCS 2008)
further extends the SVP algorithm to arbitrary (not necessarily ) norms
A randomized sieving algorithm for approximate integer programming
(Dadush - Algorithmica 70(2), 2014 / Latin 2012)
extends sieve algorithms to solve approximate integer programming
Implementations and experimental evaluations of the Gauss Sieve and other algorithms are described in
Analysis of Gauss-sieve for solving the shortest vector problem in lattices
(Schneider - WALCOM 2011)
A parallel implementation of GaussSieve for the shortest vector problem in lattices
(Milde & Schneider - PaCT 2011)
Sieving for shortest vectors in ideal lattices
(Schneider - AfricaCrypt 2013) [ePrint]
Parallel Gauss sieve algorithm: solving the SVP challenge over a 128-dimensional ideal lattice
(Ishiguro, Kiyomoto, Miyake & Takagi - PKC 2014) [ePrint]
Tuning GaussSieve for speed
(Fitzpatrick, Bischof, Buchmann, Dagdelen, Gopfert, Mariano & Yang - LatinCrypt 2014) [ePrint]
A comprehensive empirical comparison of (parallel) ListSieve and GaussSieve
(Mariano, Dagdelen, Bischof - APCI&E 2014) [ePrint]
Lock-free GaussSieve for linear speedups in parallel high performance SVP calculation
(Mariano, Timnat, Bischof - SBAC-PAR 2014) [ePrint]
Parallel (probable) lock-free HashSieve: a practical sieving algorithm for the SVP
(Mariano, Laarhoven & Bischof - ICPP 2015) [ePrint]
Somehow related to sieve algorithms is a class of combinatorial algorithms that work by building a list of random short vectors (not necessarily in the lattice), and then attempting to find a short lattice vector by taking linear combinations of the vectors in the list. The approach is also related to the methods used to establish a connection between the worst-case and average-case complexity of lattice problems. However, its use in the context of algorithmic design is simplified by the fact that the target problem instances do not have to be uniformly random.
A first heuristic algorithm of this kind was proposed in
The algorithm is practical, but it is only analyzed under heuristic assumptions. A theoretical algorithm using related ideas together with Gaussian sampling techniques is given in
This algorithm provably solves SVP in time (achieving constant in the exponent) and it is the currently best theoretical bound on the complexity of SVP. Justs like sieve algorithms, it uses exponential space and randomness. It improves theoretical sieve algorithms by avoiding the use of perturbations, but it also introduces other inefficiencies that make it mostly of theoretical interest.
Bridging the gap between the theoretical running time of provable sieve/combinatorial algorithms and heuristic variants . Can the proof of the running time of heuristic algorithms be made rigorous? Can the running time of theoretical algorithms be further improved to match the constant in the exponent claimed by heuristics?
Finding a lattice sieve algorithm that solve other lattice problems (like CVP) exactly and in single exponential time. Currently, sieve algorithms provide exact solutions to SVP, but only guarantee -approximations to other lattice problems like CVP, SIVP. Exact solutions to CVP, etc. running in time have been discovered using alternative approaches based on Voronoi cell computations. But sieving techniques may lead to more efficient/practical algorithms.
Determining the smallest constant such that SVP can be solved in time is an important open problem. Heuristic versions of lattice sieve algorithms currently provide the best known constant , and are among the most promising approaches to fast SVP algorithms.
Much work on optimizing sieve algorithms has focused on the euclidean norm so far. It would be interesting to invesigate lattice sieve algorithms with respect to other norms (e.g. or ), and the best running time they can achieve.
Sieve algorithms use exponential space. While this seems intrinsic in the techniques employed by these algorithms, devising algorithms with similar running time, but using only polynomial space, is an important open problem.
Algorithms for the closest and shortest vector problems on general lattices
(Voulgaris - PhD Thesis, UCSD 2011)
Algorithms for lattice problems with respect to general norms
(Naewe - PhD Thesis, U. Paderborn 2011)