Factorization Algorithm for Semi-primes and the Cryptanalysis of Rivest-Shamir-Adleman (RSA) Cryptography

This paper introduces a new factoring algorithm called Anorld’s Factorization Algorithm that utilizes semi-prime numbers and their implications for the cryptanalysis of the Rivest-Shamir-Adleman (RSA) cryptosystem. While using the concepts of number theory and algorithmic design, we advance a novel approach that notably enhances the efficiency of factoring large semi-prime numbers compared to other algorithms that have been developed earlier. In our approach, we propose a three-step algorithm that factorizes relatively large semi-primes in polynomial time. We have introduced factorization up to 12-digit semi-prime using Wolfram|Alpha, a mathematical software suitable for exploring polynomials. Additionally, we have discussed the implications of the new algorithm for the security of RSA-based cryptosystems. In conclusion, our research work emphasizes the important role of factoring algorithms in the cryptanalysis of RSA cryptosystems and proposes a novel approach that bolsters the efficiency and effectiveness of semi-prime factorization, thereby informing the development of more powerful cryptographic protocols.