Summary
The 2018 International Symposium on Information Theory and Its Applications　(ISITA2018)
2018
Session Number:We-PM-1-2
Session:
Number:We-PM-1-2.2
Security of Knapsack Cryptosystem Using Subset-Sum Decision Problem against Alternative-Solution Attack
Yasuyuki Murakami, Ryuichi Sakai,
pp.646-649
Publication Date:2018/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.55.We-PM-1-2.2
PDF download
Summary:
In 2012, Murakami, Hamasho and Kasahara proposed a knapsack PKC based on the subset sum decision problem. Nagao and Morii proposed an attack which is effective for this type of the knapsack scheme by computing integer solutions of the knapsack problem. This attack is referred to as alternativesolution attack. In 2016, Murakami proposed a new scheme of the knapsack PKCs(M16 schemes) based on the subset sum decision problem. In this paper, we shall evaluate the security of the M16 schemes against the alternative-solution attack by computer experiment. As the result, it is seen that M16 Basic Scheme can be broken with the alternative-solution attack and that M16 Weight- Limited Scheme can not be broken with the alternative-solution attack.