@inproceedings{6d97760b46684258a4acb104b1302629,
title = "Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing",
abstract = "Recently, it was shown that angular locality-sensitive hashing (LSH) can be used to significantly speed up lattice sieving, leading to heuristic time and space complexities for solving the shortest vector problem (SVP) of $2^{0.3366n + o(n)}$. We study the possibility of applying other LSH methods to sieving, and show that with the recent spherical LSH method of Andoni et al.\ we can heuristically solve SVP in time and space $2^{0.2972n + o(n)}$. We further show that a practical variant of the resulting SphereSieve is very similar to Wang et al.'s two-level sieve, with the key difference that we impose an order on the outer list of centers. Keywords: lattices, shortest vector problem, sieving algorithms, (approximate) nearest neighbor problem, locality-sensitive hashing",
author = "T.M.M. Laarhoven and {Weger, de}, B.M.M.",
year = "2015",
doi = "10.1007/978-3-319-22174-8_6",
language = "English",
isbn = "978-3-319-22173-1",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "101--118",
editor = "K. Lauter and F. Rodr{\'i}guez-Henr{\'i}quez",
booktitle = "Progress in Cryptology - LATINCRYPT 2015 (Fourth International Conference on Cryptology and Information Security in Latin America, Guadalajara, Mexico, August 23-26, 2015)",
address = "Germany",
}