Welcome to the resource topic for 2013/536
Title:
A Three-Level Sieve Algorithm for the Shortest Vector Problem
Authors: Feng Zhang, Yanbin Pan, Gengran Hu
Abstract:In AsiaCCS 2011, Wang \textit{et al.} proposed a two-level heuristic sieve algorithm for the shortest vector problem in lattices, which improves the Nguyen-Vidick sieve algorithm. Inspired by their idea, we present a three-level sieve algorithm in this paper, which is shown to have better time complexity. More precisely, the time complexity of our algorithm is 2^{0.3778n+o(n)} polynomial-time operations and the corresponding space complexity is 2^{0.2833n+o(n)} polynomially many bits.
ePrint: https://eprint.iacr.org/2013/536
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .