scientific article; zbMATH DE number 3880121

MaRDI QIDQ3345787zbMATH OpenFDO

Authors Ernest F. Brickell

Publication date 1983

zbMATH Keywords

density of a knapsack problemknapsack based cryptosystems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Communication, information (94A99)

Recommendations

• Solving low density knapsacks
• An Improved Low-Density Subset Sum Algorithm
• Modification of the Lagarias-Odlyzko method for solving the generalized knapsack problem and the systems of knapsack problems
• Extension of Brickell’S Algorithm for Breaking High Density Knapsacks
• Solving low-density subset sum problems

Cited in

(9)

• New Definition of Density on Knapsack Cryptosystems
• New generic algorithms for hard knapsacks
• Extension of Brickell’S Algorithm for Breaking High Density Knapsacks
• LLL-solver
• Knapsack public key cryptosystems and Diophantine approximation
• About some features of the transformed problems images
• Modification of the Lagarias-Odlyzko method for solving the generalized knapsack problem and the systems of knapsack problems
• Faster algorithm for solving hard knapsacks for moderate message length
• Solving low density knapsacks

This page was built for publication:

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