J4 ›› 2009, Vol. 36 ›› Issue (3): 506-511.

• Original Articles • Previous Articles     Next Articles

New knapsack-type public-key cryptographic algorithm

ZHANG Wei-dong;WANG Bao-cang;HU Yu-pu   

  1. (Ministry of Education Key Lab. of Computer Network and Information Security, Xidian Univ., Xi'an  710071, China)
  • Received:2008-11-05 Revised:2008-12-12 Online:2009-06-20 Published:2009-07-04
  • Contact: ZHANG Wei-dong E-mail:wdzhang@xidian.edu.cn

Abstract:

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.

Key words: public key cryptography, trapdoor knapsack, security of data, reduction

CLC Number: 

  • TN911.22

Baidu
map