Improved Analysis of Kannan's Shortest Lattice Vector Algorithm

Simple item page
dc.creatorHanrot, Guillaume
dc.creatorStehlé, Damien
dc.date2007-05-07
dc.date2007-05-09
dc.date.accessioned2026-07-07T13:03:56Z
dc.date.available2026-07-07T13:03:56Z
dc.descriptionThe 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.
dc.identifierhttps://arxiv.org/abs/0705.0965
dc.identifierhttp://arxiv.org/abs/0705.0965
dc.identifierDans Advances in Cryptology - Crypto'07 4622 (2007) 170-186
dc.identifierdoi:10.1007/978-3-540-74143-5_10
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/226983
dc.subjectCryptography and Security
dc.subjectComputational Complexity
dc.titleImproved Analysis of Kannan's Shortest Lattice Vector Algorithm
dc.typetext

Files

Collections

arXiv