Abstract
In this short extended abstract, we give two notes on low-density subset sum algorithm. One is, by extending the variables range from {0, 1}to {− 1,0,1} and allowing the weight be negative, to prove that almost all extended subset sum problems of density <0.488... would be solved in polynomial time with a single call to a lattice oracle. Another is, by only allowing the weights be negative, to point out that almost all corresponding subset sum problems whose density is smaller than the same density bound 0.9408... as [CLOS] would be solved in polynomial time by calling lattice oracle. These two extened subset sum problems have clear significance in cryptanalysis, since breaking some cryptosystems can be reduced to solving one of them. As a example, we give a application of our notes in cryptanalysis of Idempotent Element cryptosystem proposed by Pieprzyk and Rutkowski [PR].
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Brickell, E.F., Solving Low Density Knapsacks, Advances in Cryptology Proc. of Crypto' 83, Plenum Press, New York (1984), pp.25–37.
Brickell, E.F. and A.M. Odlyzko, Cryptanalysis: a Survey of Recent Results, Proc. IEEE, 76 (1988) 10, pp.578–593.
Coster, M.J., B.A. LaMacchia, A.M. Odlyzko and C.P. Schnorr, An Improved low-Density Subset Sum Algorithm, Advances in Cryptology — Eurocrypt' 91, LNCS 547, Springer-Verlag, pp.54–67.
Frieze, A.M., On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem, SIAM J. Comput., 15 (1986) 2.
Joux, S. and J. Stern, Improveing the Critical Density of the Lagarias-Odlyzko Attack Against Subset Sum Problem, Proc. of Fundamentals of Computation Theory ' 91.
Li Daxing, The Cryptanalysis of a New Type Multiplication Knapsack Scheme, J. of China Institute of Communications, 12 (1991) 4, pp.59–63 (in Chinese).
Lenstra, A.K., H.W. Lenstra, and L. Lovasz, Factoring Polynomials with Rational Coefficients, Math. Ann., 261 (1982), pp.515–534.
Lagarias J.C. and A.M. Odlyzko, Solving Low-Density Subset Sum Problems, J. ACM, 31 (1985) 1, pp.229–246.
Pieprzyk, J., Algebraical Structrures of Cryptographic Transformations, Proc. Eurocrypt' 84.
Pieprzyk, J. and D. Rutkowski, Design of Public Key Cryptosystem Using Idempotent Elements, Computers & Security, 4 (1985), pp.297–308.
Seberry, J. and J. Pieprzyk, Cryptography, Prentice Hall, New York, 1989, pp.105–106.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daxing, L., Shaohan, M. (1994). Two notes on low-density subset sum algorithm. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_178
Download citation
DOI: https://doi.org/10.1007/3-540-58325-4_178
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58325-7
Online ISBN: 978-3-540-48653-4
eBook Packages: Springer Book Archive