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â€¦ (More)

It is well known that search SVP is equivalent to optimization SVP. However, the former reduction from search SVP to optimization SVP by Kannan needs polynomial times calls to the oracle that solvesâ€¦ (More)

It is well known that almost all random subset sum instances with density less than 0.6463... can be solved with an l2-norm SVP oracle by Lagarias and Odlyzko. Later, Coster et al. improved the boundâ€¦ (More)

The hardness of Shortest Vector Problem (SVP) is the base for the security of some crypto schemes. SVP has been proved to be NP-hard under the randomized reductions. For general lattice, the boundâ€¦ (More)