Factoring semiprimes and possible implications for RSA

While most of the presently known factorization methods employ advanced mathematical tools in all phases of their respective processes the proposed algorithm is very simple and direct. The technique only applies to semiprimes or the product of two different but equal-sized primes and is based on reversing the decimal digits of the modulus. Since balanced RSA is an example of a semiprime and given that this algorithm requires little memory and is easily parallelized, we outline the basic requirements for a distributed computing experiment to factor a RSA-1024 bit modulus.