A New Product-Sum Public-Key Cryptosystem Using Message Extension(Special Section on Information Theory and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• Recently, Kasahara and Murakami proposed new product-sum public-key cryptosystems using the Chinese remainder theorem as the trapdoor. We proposed 'Yaezakura'as the high-density product-sum PKC applying the method using the reduced bases. In this paper, we propose another high-density scheme with the Chinese remainder theorem trapdoor using the message extension. We also show that the proposed scheme is invulnerable to the low-density attack. In the proposed scheme, the sender can freely select the positions of the dummy messages.

• 社団法人電子情報通信学会の論文
• 2001-10-01

著者

• Kasahara Masao

  Osaka Gakuin Univ. Suita‐shi Jpn

• KASAHARA Masao

  the Department of Electronics and Information Science, Kyoto Institute of Technology

• Murakami Y

  Forum Advanced Information Technology Murata Machinery Co. Ltd.

• MURAKAMI Yasuyuki

  Forum Advanced Information Technology, Murata Machinery Co., Ltd.

• KATAYANAGI Kiyoko

  the Department of Electronics and Information Science, Faculty of Engineering and Design, Kyoto Inst

• Katayanagi Kiyoko

  Department Of Electronics And Information Science Faculty Of Engineering And Design Kyoto Institute

• Kasahara Masao

  Department of Faculty of Informatics, Osaka Gakuin University

関連論文

• A New Product-Sum Type Public Key Cryptosystem Based on Reduced Bases : Special Section on Cryptography and Information Security
• A New Probabilistic ID-Based Non-interactive Key Sharing Scheme(Special Section on Cryptography and Information Security)
• An Upper Bound on Frame Error Rate for Generalized Concatenated Convolutional Codes
• A Method for Evaluating Minimum Free Chernov Distance of Trellis-Codes for Discrete Memoryless Channel (Special Section on Information Theory and Its Applications)
• An Upper Bound on Bit Error Rate for Concatenated Convolutional Code
• A Class of Trellis-Codes for Partial Response Channel
• Matched Design Method for Concatenated Trellis-Coded Modulation
• High Rate Binary Coset Code Used for Inner Code
• Multi-Dimensional Block Shaping
• An 8-Dimensional Trellis-Coded 8-PSK with Non-zero Crossing Constraint (Special Section on Information Theory and Its Applications)
• New Product-Sum Type Public-Key Cryptosystems with Selectable Encryption Key Based on Chinese Remainder Theorem
• A New Product-Sum Public-Key Cryptosystem Using Message Extension(Special Section on Information Theory and Its Applications)
• Some Optimal and Quasi-Optimal Binary Codes from Cyclic Codes over GF (2^m)
• On the Unequal Error Protection Capability of a q-Ary Image 0f a L0W-Rate q^m-Ary Cyclic Code (Special Section on Information Theory and Its Applications)
• New Methods of Generating Primes Secure against Both P - 1 and P + 1 Methods (Special Section on Information Theory and Its Applications)

もっと見る 閉じる

スポンサーリンク