Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2008

Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases

Damien Stehlé
  • Function : Author
  • PersonId : 837772


The Hermite-Korkine-Zolotarev reduction plays a central role in strong lattice reduction algorithms. By building upon a technique introduced by Ajtai, we show the existence of Hermite-Korkine-Zolotarev reduced bases that are arguably least reduced. We prove that for such bases, Kannan's algorithm solving the shortest lattice vector problem requires~$d^{\frac{d}{2\e}(1+o(1))}$ bit operations in dimension~$d$. This matches the best complexity upper bound known for this algorithm. These bases also provide lower bounds on Schnorr's constants~$\alpha_d$ and~$\beta_d$ that are essentially equal to the best upper bounds. Finally, we also show the existence of particularly bad bases for Schnorr's hierarchy of reductions.
Fichier principal
Vignette du fichier
RR-6422.pdf (250.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00211875 , version 1 (22-01-2008)
inria-00211875 , version 2 (24-01-2008)


  • HAL Id : inria-00211875 , version 2
  • ARXIV : 0801.3331


Guillaume Hanrot, Damien Stehlé. Worst-Case Hermite-Korkine-Zolotarev Reduced Lattice Bases. [Research Report] RR-6422, INRIA. 2008, pp.25. ⟨inria-00211875v2⟩
379 View
284 Download



Gmail Facebook Twitter LinkedIn More