A generalized slide reduction that handles every block size now gives the fastest provable algorithms for δ-approximate SVP in the cryptographic range n^{1/2+ε} ≤ δ ≤ n^{O(1)}.
Enumerative lattice algorithms in any norm via M -ellipsoid coverings
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Slide Reduction, Revisited---Filling the Gaps in SVP Approximation
A generalized slide reduction that handles every block size now gives the fastest provable algorithms for δ-approximate SVP in the cryptographic range n^{1/2+ε} ≤ δ ≤ n^{O(1)}.