Welcome to the resource topic for 2009/605
Title:
Solving the Shortest Lattice Vector Problem in Time 2^2.465n
Authors: Xavier Pujol, Damien Stehle
Abstract:The Shortest lattice Vector Problem is central in lattice-based cryptography, as well as in many areas of computational mathematics and computer science. We present an algorithm for solving it in time 2^2.465n and space 2^1.233n, where n is the lattice dimension. This improves the best previously known algorithm, by Micciancio and Voulgaris [SODA 2010], which runs in time 2^3.199n and space 2^1.325n.
ePrint: https://eprint.iacr.org/2009/605
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 .