Solving Random Subset Sum Problem by $l_{p}$-norm SVP Oracle

Gengran Hu 1, 2 Yanbin Pan 1, 2 Feng Zhang 1, 2
1 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
PKC 2014 - 17th IACR International Conference on Practice and Theory of Public-Key Cryptography (2014), Mar 2014, Buenos Aires, Argentina. Springer, 2014, PKC 2014 - 17th IACR International Conference on Practice and Theory of Public-Key Cryptography (2014)
Liste complète des métadonnées

https://hal.inria.fr/hal-00936030
Contributeur : Phong Q. Nguyen <>
Soumis le : vendredi 24 janvier 2014 - 13:26:00
Dernière modification le : mercredi 10 octobre 2018 - 14:28:12

Identifiants

  • HAL Id : hal-00936030, version 1

Collections

Citation

Gengran Hu, Yanbin Pan, Feng Zhang. Solving Random Subset Sum Problem by $l_{p}$-norm SVP Oracle. PKC 2014 - 17th IACR International Conference on Practice and Theory of Public-Key Cryptography (2014), Mar 2014, Buenos Aires, Argentina. Springer, 2014, PKC 2014 - 17th IACR International Conference on Practice and Theory of Public-Key Cryptography (2014). 〈hal-00936030〉

Partager

Métriques

Consultations de la notice

589