BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices

The Shortest Vector Problem is a crucial part of the lattice theory and a central lattice problem in analyzing lattice-based cryptography. This work provides a new algorithm that finds a short vector by calling the sieve oracle in projected sublattices orthogonal to each other. We first propose the Block Sieve algorithm. With blockwise sieving, proper insertion and reduction, the coordinates of the right end of vector v can be recovered. The algorithm moves the block to recover the other coordinates. We continue to optimize the algorithm and propose the Progressive Block Sieve algorithm, employing techniques such as skipping to accelerate the procedure. In a d-dimensional lattice, smaller sieve calls in ( $$d-\varTheta ({d}/\ln {d})$$ )-dimensional sublattices are enough to find a short vector. We compare the experimental results on different lattices to test the performance of the new approach. On challenge lattices, our algorithm takes less time and fewer tours than original reduction algorithms to reach a similar outcome. As an application of the new algorithm, we test the performance of solving Learning With Errors problem. Our algorithm is able to solve the instances about 5% faster than sieving.