Approximating the densest sublattice from Rankin's inequality - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles LMS Journal of Computation and Mathematics Year : 2014

Approximating the densest sublattice from Rankin's inequality

Abstract

We present a higher-dimensional generalization of the Gama{Nguyen algorithm (STOC '08) for approximating the shortest vector problem in a lattice. This generalization approximates the densest sublattice by using a subroutine solving the exact problem in low dimension, such as the Dadush{Micciancio algorithm (SODA '13). Our approximation factor corresponds to a natural inequality on Rankin's constant derived from Rankin's inequality.

Dates and versions

hal-01057710 , version 1 (25-08-2014)

Identifiers

Cite

Jianwei Li, Phong Q. Nguyen. Approximating the densest sublattice from Rankin's inequality. LMS Journal of Computation and Mathematics, 2014, Special Issue A (Algorithmic Number Theory Symposium XI), 7 (A), pp.92-111. ⟨10.1112/S1461157014000333⟩. ⟨hal-01057710⟩
199 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More