Cryptology ePrint Archive: Report 2009/605

Solving the Shortest Lattice Vector Problem in Time 2^2.465n

Xavier Pujol and 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.

Category / Keywords:

Date: received 7 Dec 2009, last revised 8 Feb 2010

Contact author: xavier pujol at ens-lyon fr

Available format(s): PDF | BibTeX Citation

Version: 20100208:074552 (All versions of this report)

Short URL: ia.cr/2009/605