MVFactorV2: An improved integer factorization algorithm to speed up computation time

RSA is a public key cryptosystem that the security is based on the difficulty of integer factorization. Many integer factorization algorithms were introduced to break RSA. However, VFactor is a modified integer factorization algorithm, which can factor the modulus faster than Trail Division Algorithm and Fermat´s factorization Algorithm. The key concept of VFactor is to find a product of two odd integers until the result, which is equal to the modulus is found. We proposed Modified VFactor (MVFactor), which is modified from VFactor to decrease the computation time when compared with VFactor. For MVFactor, the product of two integers will not be computed when the least significant digit of one out of two integers is equal to 5, because it is not a prime. In this research, Modified VFactor Version 2 (MVFactorV2) is proposed. This method will not compute a product of two integers when one out of two integers is certainly not a prime. Moreover, this method is integrated with the method that is used in MVFactor to decrease time to be faster. The experiment results show that MVFactorV2 can factor the modulus faster than VFactor and MVFactor.