Gaussian Difference Dynamics: Breaking the 2 n/2 Barrier for the Shortest Vector Problem and Discrete Gaussian Sampling
cs.DS, cs.CR
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- Smooth Sailing through Spherical Shells: Provable Random-Lattice Sieving in Time 2 0.292n
- infinity norm SVP in (3 n)
- Solving the Shortest Vector Problem in 2 0.6039n Time via Mid-point Hessian
- One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time
- Discrete Gaussian Sampling Reduces to CVP and SVP
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time