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.