New algorithms break mathematical barriers for lattice problems

New randomized algorithms improve the speed and space needed for discrete Gaussian sampling and the Shortest Vector Problem.

New classical randomized algorithms break the 2n/22^{n/2} barrier. These algorithms work for discrete Gaussian sampling (DGS) and the Shortest Vector Problem (SVP).

The algorithms use Gaussian difference dynamics (GDD). This is a framework for tracking expected counts and pairwise clustering of vectors through repeated differencing.

For shifted DGS on arbitrary lattices with width σ≥αη1/2(L)\sigma \ge \alpha\eta_{1/2}(L) and fixed α>1\alpha > 1, the time is (3/2)n/2+o(n)(3/2)^{n/2+o(n)}. The space used is (4/3)n/2+o(n)(4/3)^{n/2+o(n)}.

For SVP on arbitrary lattices, the algorithm returns a shortest nonzero vector with high probability. It takes 20.4130n+o(n)2^{0.4130n+o(n)} time and 20.3138n+o(n)2^{0.3138n+o(n)} space.

The GDD framework uses a closed recursion for the first two counting moments. These moments control quantities relative to a Gaussian reference.

Transitions occur on thin spherical shells. At these shells, Gaussian rejection weights can be renormalized at subexponential cost.

Key facts

  • The algorithms break the 2n/22^{n/2} barrier for DGS and SVP.
  • The SVP algorithm takes 20.4130n+o(n)2^{0.4130n+o(n)} time and 20.3138n+o(n)2^{0.3138n+o(n)} space.
  • The GDD framework tracks expected counts and pairwise clustering through repeated differencing.

All sections

Edition