Cryptology ePrint Archive: Report 2013/536

A Three-Level Sieve Algorithm for the Shortest Vector Problem

Feng Zhang and Yanbin Pan and Gengran Hu

Abstract: In AsiaCCS 2011, Wang 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.

Category / Keywords: public-key cryptography / Lattice, Shortest Vector Problem, Sieve Algorithm, Sphere Covering

Original Publication (in the same form): Lecture Notes in Computer Science

Date: received 27 Aug 2013

Contact author: zhangfeng at amss ac cn, panyanbin@amss ac cn

Available format(s): PDF | BibTeX Citation

Version: 20130830:092922 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]