一种新的背包型公钥密码算法

基于一类易解背包问题构造了一个新的背包型公钥密码体制.该公钥密码体制未使用超递增背包序列,因此可以抵抗Shamir的密钥恢复攻击.证明该公钥密码具有较高的背包密度,因此可以抵抗低密度子集和攻击.证明了该密码体制能够抵抗一些暴力攻击及联立丢番图逼近攻击.该公钥密码的加密只使用了n个加法运算,解密只需要n个模2的除法运算,因此具有很快的加解密速度,而且易于软硬件实现.

New knapsack-type public-key cryptographic algorithm

A new knapsack-type public key cryptosystem is proposed, which is based on an easy knapsack problem. The cryptosystem is secure against Shamir's key-recovery attack in that it prevents the use of the super-increasing knapsack sequence in the construction of the cryptosystem. The cryptosystem is also invulnerable to the low-density subset-sum attack in that it obtains a relatively high density. It is shown that the cryptosystem withstands some brute-force attacks and the simultaneous Diophantine approximation attack. It only performs n addition operations for the cryptosystem to encrypt a plaintext, and the decryption algorithm only carries out n modular 2 divisions. Therefore, the cryptosystem is efficient with respect to the encryption and the decryption. Furthermore, the cryptosystem is suited for software and hardware implementations.