Cryptanalysis of two knapsack-type public-key cryptosystems
In this paper, we cryptanalyze two knapsacktype 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 a variant of the method provided by Shamir at Crypto82. 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.Unlbunately, this knapsack problem can be solved by Shamirs method or the low density attack. Finally, we give a improved version of Sus cryptosystem to avoid these attacks.
public key cryptosystem knapsack cryptanalysis
Jingguo Bi Xianmeng Meng Lidong Han
School of Mathematics Shandong University 250100 Jinan, China Dept.of Mathematics and Statistics Shandong University of Finance 250014 Jinan, P.R.China
国际会议
太原
英文
623-626
2010-10-22（万方平台首次上网日期，不代表论文的发表时间）