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

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.

[1]  S. C. Coutinho.  The Mathematics of Ciphers: Number Theory and RSA Cryptography , 1999 .

[2]  Arjen K. Lenstra,et al.  Integer Factoring , 2000, Encyclopedia of Cryptography and Security.

[3]  Eran Tromer,et al.  Factoring large numbers with the TWIRL device , 2003 .

[4]  Daniel R. L. Brown,et al.  Breaking RSA May Be As Difficult As Factoring , 2014, Journal of Cryptology.

[5]  Christof Paar,et al.  An Efficient Hardware Architecture for Factoring Integers with the Elliptic Curve Method , 2005 .

[6]  David Burton.  Elementary Number Theory , 1976 .

[7]  Kazumaro Aoki,et al.  GNFS Factoring Statistics of RSA-100, 110, ..., 150 , 2004, IACR Cryptol. ePrint Arch..

[8]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[9]  Christof Paar,et al.  Area-time efficient hardware architecture for factoring integers with the elliptic curve method , 2005 .

[10]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[11]  Paul C. Kocher,et al.  Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems , 1996, CRYPTO.

[12]  Christof Paar,et al.  SHARK: A Realizable Special Hardware Sieving Device for Factoring 1024-Bit Integers , 2005, CHES.

[13]  Dan Boneh,et al.  Breaking RSA May Not Be Equivalent to Factoring , 1998, EUROCRYPT.

[14]  Dan Boneh,et al.  TWENTY YEARS OF ATTACKS ON THE RSA CRYPTOSYSTEM , 1999 .

[15]  Manindra Agrawal,et al.  PRIMES is in P , 2004 .

[16]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[17]  H. W. Lenstra,et al.  Factoring integers with elliptic curves , 1987 .