Comparison Performance of MFFV2 and MVFactor for Factoring the Modulus

Abstract

The aim of this research is to find the better modified integer factorization between two algorithms we recently proposed. These two algorithms are able to decrease time to search for two prime factors of the modulus. Factoring the modulus leads to breaking of RSA which the security is based on integer factorization. Both of these algorithms are called Modified Fermat Factorization Version 2 (MFFV2) and Modified VFactor (MVFactor) that can finish all value of the modulus. Furthermore, MFFV2 and MVFactor can factor the modulus very quickly whenever the difference between two large prime factors of the modulus is not too far. However, to find the better method, MFFV2 and MVFactor will be compared to each other. The experiments are divided into two parts. First is for the modulus with the same size of two prime factors. The results show that the speed of MVFactor is faster than MFFV2. Nevertheless, the computation speed of the bigger size modulus of MVFactor becomes lower than MFFV2, but not too much. The other part is for the modulus with the difference size of two prime factors. The experiment results show that MVFactor can factor the modulus very rapidly when compared with MFFV2 for all possible value of the modulus.