New approach of factoring the RSA cryptosystem

• Published in: AIMS mathematics Vol. 10; no. 7; pp. 15512 - 15538
• Main Authors: Nurul Nur Hanisah Adenan, Muhammad Rezal Kamel Ariffin, Wan Nur Aqlili Ruzai, Muhammad Asyraf Asbullah, Sook-Chin Yip, Terry Shue Chien Lau
• Format: Journal Article
• Language: English
• Published: AIMS Press 01.07.2025
• Subjects: continued fraction, coppersmith's technique and lattice reduction; euler's totient function; integer factorization problem; rsa
• ISSN: 2473-6988
• DOI: 10.3934/math.2025696

The invention of the Rivest–Shamir–Adleman (RSA) cryptosystem was a groundbreaking advancement in cryptography. While the RSA remains relevant in securing global communications and digital transactions, with widespread use in public parameter infrastructure (PKI) and secure online exchanges, its vulnerability to algebraic attacks must be addressed. In this paper, we propose an equation, thereby revealing its potential application in the factorization of the modulus $ N $. By introducing this equation, we demonstrate a method in the first attack named the continued fraction for recovering the primes $ p $ and $ q $ without necessitating the original $ \phi(N) $ used in the RSA encryption. The results were extended to the case where a condition exists such that multiple sets of public parameters were used against a constant private parameter. We retrieved the primes $ p_i's $ and $ q_i's $ of the moduli $ N_i $ via the lattice reduction technique. This breakthrough could potentially expose the prime factors while circumventing standard cryptographic barriers. Our findings open new possibilities for cryptographic analysis and challenge the presumed security of widely used RSA systems.