Welcome to the resource topic for 2010/647
Title:
Improved Nguyen-Vidick Heuristic Sieve Algorithm for Shortest Vector Problem
Authors: Xiaoyun Wang, Mingjie Liu, Chengliang Tian, Jingguo Bi
Abstract:In this paper, we present an improvement of the Nguyen-Vidick heuristic sieve algorithm for shortest vector problem in general lattices, which time complexity is 2^0.3836n polynomial computations, and space complexity is 2^0.2557n. In the new algorithm, we introduce a new sieve technique with two-level instead of the previous one-level sieve, and complete the complexity estimation by calculating the irregular spherical cap covering.
ePrint: https://eprint.iacr.org/2010/647
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 .