A New RSA-Type Scheme Based on Singular Cubic Curves y^2≡x^3+bx^2 (mod n)
スポンサーリンク
概要
- 論文の詳細を見る
We propose an RSA-type scheme over the nonsingular part of a singular cubic curve E_n(0, b) : y^2≡x^3+bx^2 (mod n), where n is a product of form-free primes p and q. Our new scheme encrypts/decrypts messages of 2 log n bits by operations of the x and y coordinates. The decryption is carried out over F_p or a subgroup of a quadratic extension of F_p, depending on quadratic residuosity of message-dependent parameter b. The decryption speed in our new scheme is about 4.6 and 5.8 times faster than that in the KMOV scheme and the Demytko scheme, respectively. We prove that if b is a quadratic residue in Z_n, breaking our new scheme over E_n(0, b) is not easier than breaking the RSA scheme.
- 社団法人電子情報通信学会の論文
- 1995-01-25
著者
-
Koyama K
Ntt Communication Sci. Lab. Kyoto‐fu Jpn
-
KOYAMA Kenji
NTT Communication Science Laboratories
-
Kuwakado Hidenori
Ntt Communication Science Laboratories
-
Tsuruoka Yukio
NTT Communication Science Laboratories
-
Tsuruoka Y
Ntt Communication Sci. Lab. Atsugi‐shi Jpn
関連論文
- The Security of an RDES Cryptosystem against Linear Cryptanalysis (Special Section on Cryptography and Information Security)
- Special Section on Cryptography and Information Security
- Demonstrating Possession without Revealing Factors (Special Section on Cryptography and Information Security)
- Two Discrete Log Algorithms for Super-Anomalous Elliptic Curves and Their Applications(Special Section on Cryptography and Information Security)
- Efficient Cryptosystems over Elliptic Curves Based on a Product of Form-Free Primes (Special Section on Information Theory and Its Applications)
- A New RSA-Type Scheme Based on Singular Cubic Curves y^2≡x^3+bx^2 (mod n)
- Dynamic Swapping Schemes and Differential Cryptanalysis (Special Section on Information Theory and Its Applications)
- A New Version of FEAL, Stronger against Differential Cryptanalysis (Special Section on Cryptography and Information Security)
- A New RSA-Type Scheme Based on Singular Cubic Curves (y-αx)(y-βx )≡x^3 (mod n) (Special Section on Cryptography and Information Security)
- Fast Exponentiation Algorithms Based on Batch-Processing and Precomputation (Special Section on Cryptography and Information Security)
- A Signed Binary Window Method for Fast Computing over Elliptic Curves (Special Section on Cryptography and Information Security)
- Computing Short Lucas Chains for Elliptic Curve Cryptosystems (Special Section on Discrete Mathematics and Its Applications)
- Elliptic Curve Cryptosystems and Their Applications
- On the Solutions of the Diophantine Equation x^3+y^3+z^3=n
- How to Strengthen DES-like Cryptosystems against Differential Cryptanalysis (Special Section on Cryptography and Information Security)
- Improved Elliptic Curve Methods for Factoring and Their Performance (Special Section on Cryptography and Information Security)