Notice of Violation of IEEE Publication PrinciplesModified Integer Factorization Algorithm Using V-Factor Method

Abstract

RSA is the asymmetric cryptography system. The security of RSA public key cryptosystem is based on the assumption that factoring of a large number (modulus). Integer Factorization is an important problem mainly due to its connection with RSA algorihm of Public key cryptography. We present a new special purpose algorithm (VFactor) for factoring. We compare this algorithm with Fermat's Factorization algorithm (FFM) and trial division algorithm (TDM) and we show that VFactor's runtime depends on the difference of factors and is independent of size of the modulus. So it's effective whenever factors are close to each other. In that case VFactor outperforms FFM and TDM. Keywords: Integer factorization, RSA algorithm, Fermat's Method of Factorization, Public key cryptography, TDM.