Solving Random Subset Sum Problem by $l_{p}$-norm SVP Oracle - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014
No file

Dates and versions

hal-00936030 , version 1 (24-01-2014)

Identifiers

  • HAL Id : hal-00936030 , version 1

Cite

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⟩
593 View
0 Download

Share

Gmail Facebook X LinkedIn More