A New Product-Sum Type Public Key Cryptosystem Based on Reduced Bases : Special Section on Cryptography and Information Security
スポンサーリンク
概要
- 論文の詳細を見る
The encryption and the decryption of the product-sum type public key cryptosystems can be performed extremely fast. However, when the density is low, the cryptosystem should be broken by the low-density attack. In this paper, we propose a new class of the product-sum type public key cryptosystems based on the reduced bases, which is invulnerable to the low-density attack.
- 社団法人電子情報通信学会の論文
- 2001-01-01
著者
-
Sakai R
Osaka Electro‐communication Univ. Neyagawa‐shi Jpn
-
Sakai Ryuichi
The Author Is With The Department Of Light-wave Science Osaka Electro-communication University
-
Kasahara Masao
Osaka Gakuin Univ. Suita‐shi Jpn
-
SUZUKI Daisuke
The authors are with the Department of Electronics and Information Science, Faculty of Engineering a
-
MURAKAMI Yasuyuki
The authors are with the Department of Electronics and Information Science, Faculty of Engineering a
-
KASAHARA Masao
The authors are with the Department of Electronics and Information Science, Faculty of Engineering a
-
Murakami Y
Forum Advanced Information Technology Murata Machinery Co. Ltd.
-
Murakami Yasuyuki
The Authors Are With The Department Of Electronics And Information Science Faculty Of Engineering An
-
Kasahara Masao
The Authors Are With The Department Of Electronics And Information Science Faculty Of Engineering An
-
Suzuki Daisuke
The Authors Are With The Department Of Electronics And Information Science Faculty Of Engineering An
-
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)
- A New Class of Non-interactive ID-Based Key Sharing Schemes and Its Performances
- 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)
- New Multiplicative Knapsack-Type Public Key Cryptosystems : Special Section on Cryptography and Information Security
- Person Authentication Scheme with Image of Face Casted by Light from Various Directions (Special Issue on Biometric Person Authentication)