DocumentCode :
1807387
Title :
A New Knapsack Public-Key Cryptosystem
Author :
Zhang, Weidong ; Wang, Baocang ; Hu, Yupu
Author_Institution :
Key Lab. of Comput. Networks & Inf. Security, Xidian Univ., Xi´´an, China
Volume :
2
fYear :
2009
fDate :
18-20 Aug. 2009
Firstpage :
53
Lastpage :
56
Abstract :
A new knapsack type public key cryptosystem is proposed by constructing an easy knapsack problem. The cryptosystem is shown to be secure against Shamir´s 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.
Keywords :
computational complexity; knapsack problems; public key cryptography; Shamirs key recovery attack; brute force attack resistance; decryption algorithm; hardware implementation; knapsack public key cryptosystem; low density attack invulnerability; simultaneous Diophantine approximation attack; software implementation; Computer networks; Computer science education; Computer security; Hardware; Information security; Laboratories; Proposals; Public key cryptography; Quantum computing; Resists; knapsack problem; lattice reduction; low-density attack; public key cryptosystem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Assurance and Security, 2009. IAS '09. Fifth International Conference on
Conference_Location :
Xi´an
Print_ISBN :
978-0-7695-3744-3
Type :
conf
DOI :
10.1109/IAS.2009.300
Filename :
5283412
Link To Document :
بازگشت