A knapsack public-key cryptosystem with cyclic code over $GF(2)$

スポンサーリンク

概要

• 論文の詳細を見る

• It is required to invent the public-key cryptosystem (PKC) that is based on an {\it NP\/}-hard problem so that the quantum computer might be realized. The knapsack PKC is based on the subset sum problem which is {\it NP\/}-hard. In this paper, we propose a knapsack PKC with a cyclic code over $GF(2)$ using the Chinese remainder theorem. The proposed scheme is secure against Shamirs attack and Adlemans attack and invulnerable to the low-density attack. Furthermore, the proposed scheme can reduce the size of public key by almost $25\% \sim 50\%$ of the conventional scheme using a linear code.

著者

• Murakami Yasuyuki

  Department Of Chemistry University Of Tsukuba

• Nasako Takeshi

  Graduate School of Engineering, Osaka Electro-Communication University

関連論文

• A knapsack public-key cryptosystem with cyclic code over $GF(2)$
• Silylium Ions Stabilized by an Si-X-Si Three-center Bond (X=Halogen or Hydrogen)
• New Methods of Generating Primes Secure against Both P - 1 and P + 1 Methods (Special Section on Information Theory and Its Applications)
• An ID-based key sharing scheme based on discrete logarithm problem over a product of three primes

スポンサーリンク