Large Semi Primes Factorization with Its Implications to RSA Cryptosystems

Abstract

RSA’s strong cryptosystem works on the principle that there are no trivial solutions to integer factorization. Furthermore, factorization of very large semi primes cannot be done in polynomial time when it comes to the processing power of classical computers. In this paper, we present the analysis of Fermat’s Last Theorem and Arnold’s Theorem. Also highlighted include new techniques such as Arnold’s Digitized Summation Technique (A.D.S.T.) and a top-to-bottom, bottom-to-top approach search for the prime factors. These drastically reduce the time taken to factorize large semi primes as for the case in RSA Cryptosystem.