On the Strength of the Strong RSA Assumption
スポンサーリンク
概要
- 論文の詳細を見る
The strong RSA assumption is an assumption that, the following problem is hard to solve: Given an RSA modulus and a ciphertext, find a pair of plaintext and exponent corresponding to them. It differs from the standard RSA assumption in a sense that in the strong version, no exponent is given as an input. The strong RSA assumption is considered to be stronger than the RSA assumption, but their exact relationship is not known, We investigate the strength of the strong RSA assumption and show that the strong RSA assumption restricted to low exponents is equivalent to the assumption that RSA problem is intractable for any low exponent. We also show that in terms of algebraic computation, the strong RSA assumption is properly stronger than the RSA assumption if there exists an RSA modulus n such that gcd(φ(n),3) = 1 and RSA problem is intractable.
- 社団法人電子情報通信学会の論文
- 2003-05-01
著者
-
Mambo Masahiro
Information Synergy Center And Graduate School Of Information Sciences Tohoku University
-
Mambo Masahiro
Information Synergy Center And The Graduate School Of Information Sciences Tohoku University
-
Shizuya Hiroki
Information Synergy Center And The Graduate School Of Information Sciences Tohoku University
-
Shizuya Hiroki
Information Synergy Center And Graduate School Of Information Sciences Tohoku University
-
ITAGAKI Shintaro
Graduate School of InformationSciences, Tohoku University
-
Itagaki Shintaro
Graduate School Of Informationsciences Tohoku University
関連論文
- A Note on the Relationships among Certified Discrete Log Cryptosystems
- On the Strength of the Strong RSA Assumption
- On the Security of Girault Key Agreement Protocols against Active Attacks
- The Computational Difficulty of Solving Cryptographic Primitive Problems Related to the Discrete Logarithm Problem(Public Key Cryptography)(Cryptography and Information Security)
- Complexity Analysis of the Cryptographic Primitive Problems through Square-Root Exponent(Discrete Mathematics and Its Applications)