Two Discrete Log Algorithms for Super-Anomalous Elliptic Curves and Their Applications(Special Section on Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
Super-anomalous elliptic curves over a ring Z / nZ(n=Π^k_<i=1>pi^<ei>)are defined by extending anomalous elliptic curves over a prime filed F_p.They have n points over a ring Z / nZ and pi points over F_<pi> for all pi.We generalize Satoh-Araki-Smart algorithm [10], [11]and Ruck algorithm[9], which solve a discrete logarithm problem over anomalous elliptic curves.We prove that a "discrete logarithm problem over super-anomalous elliptic curves" can be solved in deterministic polynomial time without knowing prime factors of n.
- 社団法人電子情報通信学会の論文
- 2000-01-25
著者
-
Kunihiro Noboru
Ntt Communication Science Laboratories
-
KOYAMA Kenji
NTT Communication Science Laboratories
関連論文
- 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)
- Window and Extended Window Methods for Addition Chain and Addition-Subtraction Chain (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)
- New Methods for Generating Short Addition Chains(Special Section on Cryptography and Information Security)
- 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)