Skip to Main content Skip to Navigation
Conference papers

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
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-00936030
Contributor : Phong Q. Nguyen <>
Submitted on : Friday, January 24, 2014 - 1:26:00 PM
Last modification on : Tuesday, March 17, 2020 - 3:01:46 AM

Identifiers

  • 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), IACR, Mar 2014, Buenos Aires, Argentina. ⟨hal-00936030⟩

Share

Metrics

Record views

825