安全背包公钥密码的要点和设计  

The Outline and Design of Secure Knapsack Public-key Cryptosystems

作　　者：费向东[1] 潘郁[1] 

机构地区：[1]南京工业大学经济与管理学院,江苏南京210009

出　　处：《信息网络安全》2012年第9期81-84,共4页Netinfo Security

基　　金：江苏省软科学研究计划项目[BR2010080]

摘　　要：为提高背包密码的安全性,文章依据背包密码以往失败的原因,提出了一个背包密码的可证明安全性的启发性方法,据此设计了一个新型背包密码。该密码由模乘运算实现混乱,由基于二元一次不定方程的难解函数实现扩散,充分隐藏初始序列及其冗余度,攻击者破译该背包密码的难度规约为求解此难解函数,同时能达到较高的背包密度,常规的破译方法无效。In order to boost the security of knapsack public-key cryptosystem （KPC for short）, this paper listed the security outline of KPC according to the causes that they had failed. A heuristic provable security method of KPC was proposed. Accordingly a new KPC was designed. Modular multiplication was adopted for confusion and a difficult solution function based on linear indifinite equation in two unknowns for diffusion thus the redundancy of the initial sequence was concealed adequately. The difficulty for an adversary to break it is reduced to that of breaking the difficult solution function.Meanwhile a higher knapsack density was reached. Conventional attacks were avoided.

关 键 词：背包公钥密码 可证明安全性 模乘运算 

分 类 号：TN918.1[电子电信—通信与信息系统]