Cryptanalysis of short secret exponents modulo RSA primes

Chien Yuan Chen, Cheng-Yuan Ku*, David C. Yen

*Corresponding author for this work

研究成果: Article同行評審

3 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)225-233
頁數9
期刊Information sciences
160
發行號1-4
DOIs
出版狀態Published - 22 三月 2004

指紋 深入研究「Cryptanalysis of short secret exponents modulo RSA primes」主題。共同形成了獨特的指紋。

引用此