Faster algorithm for solving hard knapsacks for moderate message length

DOI10.1007/978-3-642-31448-3_4MaRDI QIDQ2907361zbMATH OpenOpenAlexFDO

Authors Yuji Nagashima, Noboru Kunihiro

Publication date 7 September 2012

Published in Information Security and Privacy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31448-3_4

zbMATH Keywords

hard knapsacksknapsack cryptosystemsubset sum problem

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Improved Generic Algorithms for Hard Knapsacks
• New generic algorithms for hard knapsacks
• scientific article; zbMATH DE number 3880121
• Extension of Brickell’S Algorithm for Breaking High Density Knapsacks
• An Improved Low-Density Subset Sum Algorithm

Cited in

(1)

• New generic algorithms for hard knapsacks

This page was built for publication: Faster algorithm for solving hard knapsacks for moderate message length

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