Finding Shortest Lattice Vectors in the Presence of Gaps

Wei Wei 1 Mingjie Liu 2 Xiaoyun Wang 3, 4
1 CAS - Chinese Academy of Sciences [Beijing]
2 Beijing Research Institute of Telemetry [Beijing]
3 Institute for Advanced Study [Tsinghua]
4 CRYPT - Cryptanalyse
LIAMA - Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées, Inria Paris-Rocquencourt
Type de document :
Communication dans un congrès
Kaisa Nyberg. Topics in Cryptology - CT-RSA 2015, The Cryptographer's Track at the RSA Conference 2015, Apr 2015, San Francisco, United States. Springer, 9048, pp.239-257, 2015, Lecture Notes in Computer Science. 〈10.1007/978-3-319-16715-2_13〉
Liste complète des métadonnées
https://hal.inria.fr/hal-01256083
Contributeur : Phong Q. Nguyen <>
Soumis le : jeudi 14 janvier 2016 - 13:02:58
Dernière modification le : mercredi 10 octobre 2018 - 14:28:12

Identifiants

Collections

INRA | CIRAD | INRIA | LIAMA | INRIA-ROCQ

Citation

Wei Wei, Mingjie Liu, Xiaoyun Wang. Finding Shortest Lattice Vectors in the Presence of Gaps. Kaisa Nyberg. Topics in Cryptology - CT-RSA 2015, The Cryptographer's Track at the RSA Conference 2015, Apr 2015, San Francisco, United States. Springer, 9048, pp.239-257, 2015, Lecture Notes in Computer Science. 〈10.1007/978-3-319-16715-2_13〉. 〈hal-01256083〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

160

Contact


archive-ouverte@inria.fr