对二元一次不定方程背包方案的格攻击  

Lattice Attack Based on Linear Indeterminate Equation Knapsack Cryptosystems

作　　者：秦颖[1] 潘瑜[2] 

机构地区：[1]青海师范大学计算机学院,西宁810000 [2]江苏理工学院计算机工程学院,常州213001

出　　处：《计算机系统应用》2013年第7期173-176,共4页Computer Systems & Applications

摘　　要：研究分析背包密度大于0.9408的背包密码方案的安全性非常重要.针对基于二元一次不定方程的难解函数的新型背包公钥密码算法,由公钥和密文构造一个格来攻击该方案,通过采用NTL库验证上述格攻击算法的效率,从而证明了该攻击方法的有效性.进而说明此新型背包公钥密码体制是不安全的.It is very important to research and analyze one of Knapsack Cryptosystems in which the density of knapsack is greater than 0.9408. For the new knapsack public-key algorithm which is based on linear indeterminate equation in two variables, public key and ciphertext are used to construct a lattice to attack the scheme and the NTL library to verify the efficiency of the lattice attack algorithm, which finally illustrates the effectiveness of the attack method. It then proves the new knapsack public-key cryptosystem is insecure.

关 键 词：背包公钥密码 LLL算法 背包密度 NTL库 

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