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 theprocessing power of classical computers. In this paper, we present the analysis of Fermat’s Last Theorem andArnold’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 reducethe time taken to factorize large semi primes as for the case in RSA Cryptosystem
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: BOHR International Journal of Smart Computing and Information Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
