You are looking at a specific version 20130227:123235 of this paper.
See the latest version.
Paper 2012/666
Estimating the Φ(n) of Upper/Lower Bound in its RSA Cryptosystem
Chenglian Liu and Ziwei Ye
Abstract
The RSA-768 (270 decimal digits) was factored by Kleinjung et al. on December 12 2009, and the RSA-704 (212 decimal digits) was factored by Bai et al. on July 2, 2012. And the RSA-200 (663 bits) was factored by Bahr et al. on May 9, 2005. Until right now, there is no body successful to break the RSA-210 (696 bits) currently. In this paper, we would discuss an estimation method to approach lower/upper bound of Φ(n) in the RSA parameters. Our contribution may help researchers lock the Φ(n) and the challenge RSA shortly.
Metadata
- Available format(s)
- PDF PS
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- RSA cryptosystemEuler's totient functionFactoring
- Contact author(s)
- chenglian liu @ gmail com
- History
- 2013-02-27: revised
- 2012-11-28: received
- See all versions
- Short URL
- https://ia.cr/2012/666
- License
-
CC BY