Notice of Violation of IEEE Publication Principles: Modified Integer Factorization Algorithm Using V-Factor Method

Notice of Violation of IEEE Publication Principles

"Modified Integer Factorization Algorithm using V-Factor Method"
by Prashant Sharma, Amit Kumar Gupta and Ashish Vijay
in the Proceedings of the Second International Conference on Advanced Computing and Communication Technology, January 2012, pp. 423-425

After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE's Publication Principles.

This paper is a duplication of the original text from the paper cited below. The original text was copied without attribution (including appropriate references to the original author(s) and/or paper title) and without permission.

Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article:

"VFactor: A Simple Algorithm for Integer Factorization"
by Vikas Pareek and Manisha Sharma
in the Proceedings of the International Conference on Computer Engineering and Technology (ICCET), November 2010


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.