Extension of Brickell’S Algorithm for Breaking High Density Knapsacks

DOI10.1007/3-540-39118-5_11MaRDI QIDQ5000237zbMATH OpenOpenAlexFDO

Authors Frank Jorissen, Joos Vandewalle, René Govaerts

Publication date 10 July 2021

Published in Advances in cryptology -- EUROCRYPT '87. Workshop on the theory and application of cryptographic techniques, Amsterdam, Netherlands, April 13--15, 1987. Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-39118-5_11

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 3910295
• A note on the extension complexity of the knapsack polytope
• An implementation of exact knapsack separation
• New generic algorithms for hard knapsacks
• An exact algorithm for large multiple knapsack problems
• Improved Generic Algorithms for Hard Knapsacks
• An exact algorithm for large unbounded knapsack problems
• scientific article; zbMATH DE number 4093181
• A new enumeration scheme for the knapsack problem
• scientific article; zbMATH DE number 3993303

Cites work

• scientific article; zbMATH DE number 3880121 (Why is no real title available?)
• Factoring polynomials with rational coefficients

Cited in

(7)

• Solving low density knapsacks
• New generic algorithms for hard knapsacks
• Safer parameters for the Chor-Rivest cryptosystem
• Solving low-density subset sum problems
• scientific article; zbMATH DE number 3880121 (Why is no real title available?)
• Faster algorithm for solving hard knapsacks for moderate message length
• New Definition of Density on Knapsack Cryptosystems

This page was built for publication: Extension of Brickell’S Algorithm for Breaking High Density Knapsacks

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