From multiple encryption to knapsacks -- efficient dissection of composite problems

DOI10.1007/978-3-642-34931-7_2MaRDI QIDQ2876920zbMATH OpenOpenAlexFDO

Authors Orr Dunkelman

Publication date 20 August 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34931-7_2

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
• Efficient dissection of bicomposite problems with cryptanalytic applications
• Improved Generic Algorithms for Hard Knapsacks
• New generic algorithms for hard knapsacks
• Time-memory-processor trade-offs

Cited in

(4)

• Efficient dissection of bicomposite problems with cryptanalytic applications
• Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
• Generation of solved instances of Multiconstraint Knapsack problem and its applications to Private Key Cipher
• Two is better than one: How to securely combine two assumptions

This page was built for publication: From multiple encryption to knapsacks -- efficient dissection of composite problems

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