Security of a Class of Knapsack Public-Key Cryptosystems against Low-Density Attack

スポンサーリンク

概要

• 論文の詳細を見る

• In 2003, Kobayashi et al. proposed a new class of knapsack public-key cryptosystems over Gaussian integer ring. This scheme using two-sequences as the public key. In 2005, Sakamoto and Hayashi proposed an improved version of Kobayashis scheme. In this paper, we propose the knapsack PKC using l-sequences as the public key and present the low-density attack on it. We have described Schemes R and G for l=2, in which the public keys are constructed over rational integer ring and over Gaussian integer ring, respectively. We discusses on the difference of the security against the low-density attack. We show that the security levels of Schemes R and G differ only slightly.

• 2008-10-01

著者

• Kasahara Masao

  Osaka Gakuin Univ. Osaka Jpn

• MURAKAMI Yasuyuki

  Osaka Electoro-Communication University

• Kasahara Masao

  Osaka Gakuin University

• Murakami Yasuyuki

  Osaka Electro-communication University

• NASAKO Takeshi

  Osaka Electro-Communication University

関連論文

• A Further Improvement on Implementation of Diffie-Hellman Type ID-NIKS
• Security of a Class of Knapsack Public-Key Cryptosystems against Low-Density Attack
• A Construction of Public-Key Cryptosystem Using Algebraic Coding on the Basis of Superimposition and Randomness(Public Key Cryptography, Cryptography and Information Security)
• A New ID-Based Key Sharing Scheme based on DH Problem over Composite Modulus
• A New Trapdoor in Modular Knapsack Public-Key Cryptosystem
• Knapsack Public-Key Cryptosystem Using Chinese Remainder Theorem
• A Note on Security of Public-Key Cryptosystem Provably as Secure as Subset Sum Problem

スポンサーリンク