LUC public key encryption: a secure alternative to RSA
Dr. Dobb's Journal
A new elliptic curve based analogue of RSA
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Attacks on Shamir's “RSA for paranoids”
Information Processing Letters
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Public-key cryptosystems based on cubic finite field extensions
IEEE Transactions on Information Theory
Attacks of simple block ciphers via efficient heuristics
Information Sciences: an International Journal
Unconditionally secure cryptosystems based on quantum cryptography
Information Sciences: an International Journal
Improving timing attack on RSA-CRT via error detection and correction strategy
Information Sciences: an International Journal
| Hi-index | 0.00 |
In this manuscript, one way to attack on the short secret exponent dq modulo a larger RSA prime q is presented. When dq p/3q)½ and e pq)½, dq can be discovered from the continued fraction of e/pq, where e and pq denote the public exponent and the modulus, correspondingly. Furthermore, the same way to attack on an unbalanced RSA is also discussed. According to cryptanalysis presented in this study, the unbalanced RSA will be resolved if dq ½ q4/9.