Abstract
A new algorithm for the solution of the knapsack problem is described. The algorithm is based upon successive reductions modulo suitably chosen integers. Thus the original knapsack problem is transformed into a system of modified knapsack problems. Very often a partial solution to the system can be found. The system and the original knapsack can then be reduced to a lower dimensionality and the algorithm repeated.
So far we have not been able to characterize the class of knapsack problems for which the algorithm is effective. There are indications, however, that most knapsack problems for which we know that there is one and only one solution may be solved fast by the use of the new algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Reference
R.C. Merkle and M.E. Hellman: “Hiding Information and Signatures in Trap-Door Knapsacks”, IEEE Trans. on Information Theory, Vol. IT-24, pp. 525–530, September 1978.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ingemarsson, I. (1983). A New Algorithm for the Solution of the Knapsack Problem. In: Beth, T. (eds) Cryptography. EUROCRYPT 1982. Lecture Notes in Computer Science, vol 149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39466-4_22
Download citation
DOI: https://doi.org/10.1007/3-540-39466-4_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11993-7
Online ISBN: 978-3-540-39466-2
eBook Packages: Springer Book Archive