非超递增序列背包加密算法研究  

Research on encryption algorithm of non super-increasing sequence knapsack

作　　者：栗风永[1] 徐江峰[1] 

机构地区：[1]郑州大学信息工程学院,河南郑州450001

出　　处：《计算机工程与设计》2011年第2期481-483,488,共4页Computer Engineering and Design

基　　金：河南省教委自然科学基金项目(2006520014)

摘　　要：为了提高背包加密体制的安全性,对基于超递增序列的背包加密算法进行了分析,指出了利用非超递增序列构造背包所存在的难题,提出一种无冲突非超递增序列的构造方法,并给出严格的证明。依据该方法提出了一种基于无冲突非超递增序列的背包公钥加密算法,有效地避免了利用非超递增序列构造背包的过程中出现的难题。理论分析和仿真实验结果表明,该算法具有高的安全性能,在抵抗Shamir攻击和低密度攻击方面都具有良好的性能。In order to improve knapsack＇ s security, through analyzing the super-increasing sequence and pointing out the problems of using non super-increasing sequence to construct knapsack, a new method is proposed to construct conflict-free and non super-increasing sequenceandrigorousproofisgiven, on this basis, an improved knapsack public-key encryption algorithm based on non super-increasing sequence is presented, the problems are solved, which appear in constructing knapsack by using non super-increasing sequence. Theo- retical analyses and simulated experiment show that, the proposed algorithm has excellent performances against attacks, in particular Shamir attacks and low-density attacks.

关 键 词：公钥加密 非超递增序列 背包 冲突 低密度攻击 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]