A Generalize Estimating the Ø(n) of Upper/Lower Bound to RSA Public Key Cryptosystem

Jie Fang ； Chenglian Liu

《International Journal of Network Security》 20卷2期 (2018/03) Pp. 332-336

https://doi.org/10.6633/IJNS.201803.20(2).14

摘要

The RSA-768 (270 decimal digits) was factored by Klein-jung et al. on December 12, 2009, while the RSA-704 (212 decimal digits) was factored by Bai et al. on July 2, 2012. The RSA-200 (663 bits) was factored by Bahr et al. on May 9, 2005, while he RSA-210 (696 bits) was factored by Propper on September 26, 2013. In this paper the author will discuss an estimation method to approach the lower/upper bound of Ø(n) to the RSA parameters. Our contribution may help researchers lock the (n) and the challenge RSA shortly.

關鍵字

Euler's Totient Function ； Factoring ； RSA Cryptosystem