Abstract
Let al,...,an and s be a set of integers. The knapsack (or subset sum) problem is to find a 0–1 vector (εl,...,εn) such that Σ εiai = s or to show that such a vector does not exist. The integers al,...,an are sometimes referred to as weights. The general knapsack problem is known to be NP complete [5,6]. Several cryptosystems based on the knapsack problem have been designed [9,12,16]. In April, 1982, Adi Shamir [14] announced a method for breaking the Merkle-Hellman cryptosystem. Since that time there has been a flurry of activity to extend his results to include all of the proposed knapsack based cryptosystems [1,2,3,7,13].
This work performed at Sandia National Laboratories supported by the U.S. Department of Energy under contract number DE-AC04-76DP00789.
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.
References
L. M. Adleman, “On Breaking the Generalized Knapsack Public Key Cryptosystems,” Proceedings of the 15th Annual Symposium on Theory of Computing (1983), 402–412.
E. F. Brickell, “Are Most Low Density Knapsacks Solvable in Polynomial Time?,” to appear in Congressus Numerantium (1983).
E. F. Brickell and G. J. Simmons, “A Status Report on Knapsack Based Public Key Cryptosystems,” Congressus Numerantium, Vol. 37 (1983), 3–72.
W. Diffie and M. E. Hellman, “New Directions in Cryptography,” IEEE Trans. Inform. Theory IT-22, 6 (Nov. 1976), 644–654.
M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco (1979).
R. M. Karp, “Reducibility Among Combinatorial Problems,” in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher (Eds.), Plenum Press, New York (1972), 85–104.
J. C. Lagarias, “Knapsack Public Key Cryptosystems and Diophantine Approximation,” to appear Advances in Cryptography (1983).
J. C. Lagarias and A. M. Odlyzko, “Solving ‘Low-Density’ Subset Sum Problems,” to appear.
A. Lempel, “Cryptology in Transition: A Survey,” Comput. Surv. 11, 4 (Dec. 1979), 285–304.
H. W. Lenstra, Jr., “Integer Programming with a Fixed Number of Variables,” Univ. of Amsterdam Tech. Report 81–03 (April 1981); to appear, Math. of Operations Research.
A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovasz, “Factoring Polynomials with Rational Coefficients,” Mathematische Annalen, Vol. 261, No. 4 (1982), 515–534.
R. C. Markle and M. Hellman, “Hiding Information and Signatures in Trapdoor Knapsacks,” IEEE Trans. Inform. Theory IT-24, 5 (Sept. 1978), 525–530.
A. M. Odlyzko, “Cryptanalytic Attacks on the Multiplicative Knapsack Cryptosystem and on Shamir’s Fast Signature System,” to appear.
L. A. Santalo, Integral Geometry and Geometric Probability, Addison-Wesley Publishing Company (1976).
A. Shamir, “A Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem,” Proc. 23rd Annual Symposium on Foundations of Computer Science (1982), 145–152.
A. Shamir, “The Strongest Knapsack-Based Cyrptosystem?,” (extended abstract) paper presented at Crypto’82, Santa Barbara, CA (August 1982).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Plenum Press, New York
About this chapter
Cite this chapter
Brickell, E.F. (1984). Solving Low Density Knapsacks. In: Chaum, D. (eds) Advances in Cryptology. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-4730-9_2
Download citation
DOI: https://doi.org/10.1007/978-1-4684-4730-9_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-4732-3
Online ISBN: 978-1-4684-4730-9
eBook Packages: Springer Book Archive