Solving random subset sum problem by l_p-norm SVP oracle

DOI10.1007/978-3-642-54631-0_23zbMATH Open1335.94051OpenAlexW154360706MaRDI QIDQ5402983FDOQ5402983

Authors: G. Hu, Yanbin Pan, Feng Zhang 

Publication date: 25 March 2014

Published in: Public-Key Cryptography – PKC 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54631-0_23

Recommendations

• Solving low-density multiple subset sum problems with SVP oracle
• Improved low-density subset sum algorithms
• scientific article; zbMATH DE number 1256724
• Solving low-density subset sum problems
• scientific article; zbMATH DE number 4074814

zbMATH Keywords

latticeSVP\(l_p\)-normrandom subset sum problems

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Cited In (1)

• Solving low-density multiple subset sum problems with SVP oracle

This page was built for publication: Solving random subset sum problem by \(l_p\)-norm SVP oracle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402983)