[Resource Topic] 2012/666: Estimating the Φ(n) of Upper/Lower Bound in its RSA Cryptosystem

Welcome to the resource topic for 2012/666

Title:
Estimating the Φ(n) of Upper/Lower Bound in its RSA Cryptosystem

Authors: Chenglian Liu, 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.

ePrint: https://eprint.iacr.org/2012/666

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .