Chengliang Tian

Learn More
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<sup>0.3836<i>n</i></sup> polynomial computations, and space complexity is 2<sup>0.2557<i>n</i></sup>. In the new algorithm, we introduce a new sieve technique with two-level instead of the(More)
We prove three optimal transference theorems on lattices possessing n-unique shortest vectors which relate to the successive minima, the covering radius and the minimal length of generating vectors respectively. The theorems result in reductions between GapSVP γ and GapSIVPγ for this class of lattices. Furthermore, we prove a new transference theorem giving(More)
  • 1