DocumentCode
1929321
Title
Key Recovery Attack on a Knapsack Public Key Cryptosystem
Author
Ju, Chunfei ; Yuan, Hui
Author_Institution
Dept. of Eng. Technol., Xijing Univ., Xi´´an, China
fYear
2012
fDate
19-21 Sept. 2012
Firstpage
590
Lastpage
593
Abstract
A new knapsack public key cryptosystem is crypt analyzed. The cryptanalytic attack uses the Euclidean algorithm to obtain the greatest common divisor of some integers, and thus recovers the modulus. Then the attack reconstructs the multiplier by solving a linear congruence. Therefore, all the secret keys can be retrieved in polynomial time. Hence, the public key cryptosystem is insecure.
Keywords
computational complexity; knapsack problems; public key cryptography; Euclidean algorithm; cryptanalytic attack; key recovery attack; knapsack public key cryptosystem; linear congruence; polynomial time; Approximation algorithms; Computers; Encryption; Public key cryptography; Vectors; Euclidean algorithm; public key cryptography; trapdoor knapsack;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Networking and Collaborative Systems (INCoS), 2012 4th International Conference on
Conference_Location
Bucharest
Print_ISBN
978-1-4673-2279-9
Type
conf
DOI
10.1109/iNCoS.2012.89
Filename
6337988
Link To Document