文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Improved low-density subset sum algorithms
侵权投诉

Improved low-density subset sum algorithms

The general subset sum problem is NP-complete. However, there are two algorithms, one due to Brickell and the other to Lagarias and Odlyzko, which in polynomial time solve almost all subset sum problems of sufficiently low density. Both methods rely on bas

Discrete Mathematics, R. D. Ringeisen and F. S. Roberts, eds., SIAM (1988), 3-23.

3] E. F. Brickell and A. M. Odlyzko, Cryptanalysis: a survey of recent results, Proc. IEEE 76 (1988), 578-593. 4] B. Chor and R. Rivest, A knapsack-type public key cryptosystem based on arithmetic in nite elds, IEEE Trans. Information Theory IT-34 (1988), 901-909. 5] Y. Desmedt, What happened with knapsack cryptographic schemes?, Performance Limits in Communication, Theory and Practice, J. K. Skwirzynski, ed., Kluwer (1988), 113-134. 6] P. van Emde Boas, Another NP-complete partition problem and the complexity of computing short vectors in a lattice, Rept. 81-04, Dept. of Mathematics, Univ. of Amsterdam, 1981. 7] A. M. Frieze, On the Lagarias-Odlyzko algorithm for the subset sum problem, SIAM J. Comput. 15(2) (May 1986), 536-539. 8] M. L. Furst and R. Kannan, Succinct certi cates for almost all subset sum problems, SIAM J. Comput. 18 (1989), 550-558. 9] M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company (1979). 10] J. Hastad, B. Just, J. C. Lagarias, and C. P. Schnorr, Polynomial time algorithms for nding integer relations among real numbers, SIAM J. Comput. 18(5) (October 1989), 859-881. 11] J. C. Lagarias and A. M. Odlyzko, Solving low-density subset sum problems, J. Assoc. Comp. Mach. 32(1) (January 1985), 229-246. 12] B. A. LaMacchia, Basis Reduction Algorithms and Subset Sum Problems, SM Thesis, Dept. of Elect. Eng. and Comp. Sci., Massachusetts Institute of Technology, Cambridge, MA (1991). 13] A. K. Lenstra, H. W. Lenstra, and L. Lovasz, Factoring polynomials with rational coe cients, Math. Ann. 261 (1982), 515-534.

上一页第2页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email