New transference theorems on lattices possessing $n^ϵ-unique$ shortest vectors

2 CRYPT - Cryptanalyse
LIAMA - Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées, Inria Paris-Rocquencourt
Abstract : In this paper, we first discuss lattices possessing nϵ-unique shortest vectors. We obtain three optimal transference theorems by establishing close relationships among successive minima, the covering radius and the minimal length of generating vectors. These results can be used to get finer reductions between and for this class of lattices. Our work improves related results in the literature. In the second part of this paper, we prove a new transference theorem for general lattices where an optimal lower bound relating the successive minima of a lattice with its dual is given. As an application, we compare the respective advantages of current upper bounds on the smoothing parameters related to discrete Gaussian measures on lattices and give a more appropriate bound for lattices with duals possessing -unique shortest vectors.
Keywords :
Type de document :
Article dans une revue
Discrete Mathematics, Elsevier, 2014, 315-316, pp.144-155. 〈10.1016/j.disc.2013.10.020〉

https://hal.inria.fr/hal-00922225
Contributeur : Phong Q. Nguyen <>
Soumis le : mercredi 25 décembre 2013 - 09:46:12
Dernière modification le : vendredi 25 mai 2018 - 12:02:06

Citation

Wei Wei, Chengliang Tian, Xiaoyun Wang. New transference theorems on lattices possessing $n^ϵ-unique$ shortest vectors. Discrete Mathematics, Elsevier, 2014, 315-316, pp.144-155. 〈10.1016/j.disc.2013.10.020〉. 〈hal-00922225〉

Métriques

Consultations de la notice