A Classical Approach to Factorizing Large Co-Primes

Abstract

Last year when I undertook a course for Quantum Computing & Machine Learning, it came to my knowledge that security of RSA tokens are heavily dependent on the fact that it is NP hard problem to factorize a large (> 128 bits) coprime number. Since then, I have been inclined to invent/discover a classical approach that debunks the NP hard problem for factorizing large coprime numbers. This paper is an attempt to illustrate the approach that can be developed into a computational algorithm as a solution to accurately determine factors of large coprime numbers.