IACR News item: 06 March 2015
Thijs Laarhoven, Benne de Weger
ePrint Report
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.
Additional news items may be found on the IACR news page.