[1]MERKLE R C, HELLMAN M H. Hiding information and signatures in trapdoor knapsacks[J]. IEEE Transactions on Information Theory, 1978,24(5):525-530.[2]COSTER M J, JOUX A, LAMACCHIA B A, et al. Improved low-density subset sum algorithms[J]. Computational Complexity, 1992, 2(2): 111-128.[3]ODLYZKO A M. The rise and fall of knapsack cryptosystems[EB/OL]. [2010-05-10]. http://www.dtc.umn.edu/~odlyzko/doc/arch/knapsack.survey.pdf.[4]LAI M K. Knapsack Cryptosystems: The Past and the Future [EB/OL]. [2011-09-15]. http://www.ics.uci.edu/~mingl/knapsack.html.[5]王保仓,韦永壮,胡予濮. 基于随机背包的公钥密码[J]. 电子与信息学报,2010,32(7):1580-1584.[6]LENSTRA A K, LENSTRA H W, Jr, LOVASZ L. Factoring polynomials with rational coefficients[J]. Mathematische Annalen,1982,261(4):513-534.[7]王保仓,巨春飞. 对一个背包公钥密码的格攻击[J].计算机应用研究,2010,27(4):1466-1492.[8]SHANNON C E. Communication theory of secrecy systems[J]. Bell System Technical Journal,1949,28(4):656-715.[9]SHAMIR A. A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem[J]. IEEE Transactions on Information Theory,1984,30(5):699-704.[10]SCHNEIER B.应用密码学[M]. 吴世忠,祝世雄,张文政,等译.北京:机械工业出版社,2000:185-250.[11]LAGARIAS J C. Knapsack public key cryptosystems and diophantine approximation[C]// Proceedings of CRYPTO '83. Berlin: Springer-Verlag, 1984:3-23.[12]王保仓,韦永壮,胡予濮. 基于中国剩余定理的快速公钥加密算法[J].西安电子科技大学学报:自然科学版,2008,35(3):449-454.[13]章照止.破译一个新的背包公钥密码系统[J]. 系统科学与数学,1991,11(1):91-96.[14]韩立东,刘明洁,毕经国. 两种背包型的公钥密码算法的安全性分析[J].电子与信息学报,2010,32(6):1485-1488.[15]何敬民,卢开澄.背包公钥系统的安全性与设计[J]. 清华大学学报:自然科学版,1988,28(1):89-97. |