Abstract
A knapsack (or subset-sum) problem that is useful for cryptographic purposes, consists of a set of n positive integers a = {a1, a2, ... an}, called the knapsack a, and a sum s. The density d of a knapsack is defined to be n /log2 (ai)max. The knapsack problem then consists of finding the set, if any, of binary numbers x = {x1 , x2, ... , xn}, such that Σxi·ai = s.
Chapter PDF
Similar content being viewed by others
References
F. Jorissen, “De cryptanalyse van knapzak publieke sleutel geheimschriftvormende algoritmes”, M.Sc. Thesis, Katholieke Universiteit Leuven, Belgium, May 1985.
E.F. Brickell, “Solving Low Density Knapsacks”, Sandia National Laboratories, Albuquerque, USA.
R.K. Lenstra, H.W. Lenstra Jr., and L. Lovasz, “Factoring Polynomials with Rational Coefficients”, Mathematische Annalen, Vo1.261, no.4, pp.515–534, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jorissen, F., Vandewalle, J., Govaerts, R. (1988). Extension of Brickell’S Algorithm for Breaking High Density Knapsacks. In: Chaum, D., Price, W.L. (eds) Advances in Cryptology — EUROCRYPT’ 87. EUROCRYPT 1987. Lecture Notes in Computer Science, vol 304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39118-5_11
Download citation
DOI: https://doi.org/10.1007/3-540-39118-5_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19102-5
Online ISBN: 978-3-540-39118-0
eBook Packages: Springer Book Archive