Small Secret Key Attack on a Takagi's Variant of RSA
スポンサーリンク
概要
- 論文の詳細を見る
For a variant of RSA with modulus N = prq and ed ≡ 1 (mod(p-1)(q-1)), we show that d is to be recovered if d < N(2-√2)/(r+1). (Note that φ(N) ≠ (p-1)(q-1).) Boneh-Durfees result for the standard RSA is obtained as a special case for r=1. Technically, we develop a method for finding a small root of a trivariate polynomial equation f(x, y, z)=x(y-1)(z-1)+1 ≡ 0 (mod e) under the condition that yrz=N. Our result cannot be obtained from the generic method of Jochemsz-May.
- （社）電子情報通信学会の論文
- 2009-01-01
著者
-
ITOH Kouichi
FUJITSU LABORATORIES Ltd.
-
KUNIHIRO Noboru
The University of Tokyo
-
KUROSAWA Kaoru
Ibaraki University
-
Kunihiro Noboru
The University Of Electro-communications
-
Kurosawa Kaoru
Ibaraki Univ. Hitachi‐shi Jpn
関連論文
- Collision-Based Power Attack for RSA with Small Public Exponent
- New Conditions for Secure Knapsack Schemes against Lattice Attack
- Cryptanalysis of Two MD5-Based Authentication Protocols: APOP and NMAC
- New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
- Small Secret CRT-Exponent Attacks on Takagis RSA
- New Conditions for Secure Knapsack Schemes against Lattice Attack
- Practical Password Recovery Attacks on MD4 Based Prefix and Hybrid Authentication Protocols
- A Strict Evaluation on the Number of Conditions for SHA-1 Collision Search
- Deterministic Polynomial Time Equivalence between Factoring and Key-Recovery Attack on Takagi's RSA
- New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
- Collision-Based Power Attack for RSA with Small Public Exponent
- Tag-KEM from Set Partial Domain One-Way Permutations
- A Practical Countermeasure against Address-bit Differential Power Analysis (特集:プライバシを保護するコンピュータセキュリティ技術)
- Compact Architecture for ASIC Implementation of the MISTY1 Block Cipher
- Small Secret Key Attack on a Takagi's Variant of RSA
- Security of the Five-Round KASUMI Type Permutation
- Provably Secure Untraceable Electronic Cash against Insider Attacks(Discrete Mathematics and Its Applications)
- Public Key Encryption Schemes from the (B)CDH Assumption with Better Efficiency
- Between Hashed DH and Computational DH : Compact Encryption from Weaker Assumption
- How to Construct Super-Pseudorandom Permutations with Short Keys(Symmetric Cryptography,Cryptography and Information Security)
- An Electronic Voting Protocol Preserving Voter's Privacy(Applications of Information Security Techniques)
- How to Shorten a Ciphertext of Reproducible Key Encapsulation Mechanisms in the Random Oracle Model
- Uniqueness Enhancement of PUF Responses Based on the Locations of Random Outputting RS Latches
- Compact Architecture for ASIC and FPGA Implementation of the KASUMI Block Cipher
- Undeniable and Unpretendable Signatures
- On the Hardness of Subset Sum Problem from Different Intervals
- Uniqueness Enhancement of PUF Responses Based on the Locations of Random Outputting RS Latches