A New Knapsack Public-Key Cryptosystem

摘要：

A new knapsack-type public key cryptosystem is proposed by constructing an easy knapsack problem. The cryptosystem is shown to be secure against Shamirs key-recovery attack in that it does not use a super-increasing knapsack sequence in the construction process. The cryptosystem is also invulnerable to low-density attack in that it obtains a relatively high density. It is shown that the cryptosystem resists 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.

关键词： public key cryptosystem knapsack problem lowdensity attack lattice reduction

作者: Weidong Zhang Baocang Wang Yupu Hu

作者单位: Key Laboratory of Computer Networks and Information Security,Ministry of Education,Xidian University,Xian,710071,China

会议类型: 国际会议

会议名称: The Fifth International Conference on Information Assurance and Security(第五届信息保障与安全国际会议)

会议地点: 西安

会议语种:英文

页码: 53-56

在线出版日期: 2009-08-18（万方平台首次上网日期，不代表论文的发表时间）