Cryptology ePrint Archive: Report 2009/537

Cryptanalysis of two knapsack public-key cryptosystems

Jingguo Bi; Xianmeng Meng and Lidong Han

Abstract: In this paper, we cryptanalyze two knapsack cryptosystems. The first one is proposed by Hwang et al [4], which is based on a new permutation algorithm named Permutation Combination Algorithm. We show that this permutation algorithm is useless to the security of the cryptosystem. Because of the special super increasing structure, we can break this cryptosystem use the method provided by Shamir at Crypto'82. The second one is provided by Su et al [16], which is based on the elliptic curve discrete logarithm and knapsack problem. We show that one can recover the plaintext as long as he solve a knapsack problem.Unfounately, this knapsack problem can be solved by Shamir's method or the low density attack. Finally, we give a improved version of Su's cryptosystem to avoid these attacks.

Category / Keywords: public-key cryptography /

Date: received 2 Nov 2009

Contact author: bijingguo-001 at 163 com

Available format(s): PDF | BibTeX Citation

Version: 20091105:052714 (All versions of this report)

Short URL: ia.cr/2009/537

Discussion forum: Show discussion | Start new discussion