TY - JOUR
T1 - Cryptanalysis of short secret exponents modulo RSA primes
AU - Chen, Chien Yuan
AU - Ku, Cheng-Yuan
AU - Yen, David C.
PY - 2004/3/22
Y1 - 2004/3/22
N2 - In this manuscript, one way to attack on the short secret exponent d q modulo a larger RSA prime q is presented. When dq < (2q3p)1/2 and e < (pq)1/2, dq can be discovered from the continued fraction of epq, 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 < (23) 1/2q4/9.
AB - In this manuscript, one way to attack on the short secret exponent d q modulo a larger RSA prime q is presented. When dq < (2q3p)1/2 and e < (pq)1/2, dq can be discovered from the continued fraction of epq, 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 < (23) 1/2q4/9.
KW - Continued fraction method
KW - Cryptography
KW - RSA (Ron Rivest, Adi Shamir, and Len Adleman) system
UR - http://www.scopus.com/inward/record.url?scp=1342285565&partnerID=8YFLogxK
U2 - 10.1016/j.ins.2003.08.016
DO - 10.1016/j.ins.2003.08.016
M3 - Article
AN - SCOPUS:1342285565
SN - 0020-0255
VL - 160
SP - 225
EP - 233
JO - Information sciences
JF - Information sciences
IS - 1-4
ER -