Improved Analysis of Kannan's Shortest Lattice Vector Algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Improved Analysis of Kannan's Shortest Lattice Vector Algorithm

Damien Stehlé
  • Function : Author
  • PersonId : 837772


The security of lattice-based cryptosystems such as NTRU, GGH and Ajtai-Dwork essentially relies upon the intractability of computing a shortest non-zero lattice vector and a closest lattice vector to a given target vector in high dimensions. The best algorithms for these tasks are due to Kannan, and, though remarkably simple, their complexity estimates have not been improved since more than twenty years. Kannan's algorithm for solving the shortest vector problem is in particular crucial in Schnorr's celebrated block reduction algorithm, on which are based the best known attacks against the lattice-based encryption schemes mentioned above. Understanding precisely Kannan's algorithm is of prime importance for providing meaningful key-sizes. In this paper we improve the complexity analyses of Kannan's algorithms and discuss the possibility of improving the underlying enumeration strategy.
Fichier principal
Vignette du fichier
RR-6186.pdf (231.59 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00145049 , version 1 (07-05-2007)
inria-00145049 , version 2 (09-05-2007)



Guillaume Hanrot, Damien Stehlé. Improved Analysis of Kannan's Shortest Lattice Vector Algorithm. Advances in Cryptology - Crypto'07, Aug 2007, Santa Barbara, United States. pp.170-186, ⟨10.1007/978-3-540-74143-5_10⟩. ⟨inria-00145049v2⟩
314 View
279 Download



Gmail Facebook X LinkedIn More