Slide Reduction, Revisited---Filling the Gaps in SVP Approximation
Data Structures and Algorithms
2019-08-13 v1 Cryptography and Security
Abstract
We show how to generalize Gama and Nguyen's slide reduction algorithm [STOC '08] for solving the approximate Shortest Vector Problem over lattices (SVP). As a result, we show the fastest provably correct algorithm for -approximate SVP for all approximation factors . This is the range of approximation factors most relevant for cryptography.
Keywords
Cite
@article{arxiv.1908.03724,
title = {Slide Reduction, Revisited---Filling the Gaps in SVP Approximation},
author = {Divesh Aggarwal and Jianwei Li and Phong Q. Nguyen and Noah Stephens-Davidowitz},
journal= {arXiv preprint arXiv:1908.03724},
year = {2019}
}