Improving the initial values of VFactor suitable for balanced modulus

Abstract

The aim of this study is to estimate the new initial values of VFactor. In general, this algorithm is one of the members in a group of special proposed integer factorization algorithm. It has very high performance whenever the result of the difference between two prime factors of the modulus is a little, it is also called as balanced modulus. In fact, if this situation is occurred, RSA which is a type of public key cryptosystem will be broken easily. In addition, the main process of VFactor is to increase and decrease two odd integers in order to compute the multiplication until the targets are found. However, the initial values are far from the targets especially that the large value of the difference between two prime factors that is not suitable for VFactor. Therefore, the new initial values which are closer to the targets than the traditional values are proposed to decrease loops of the computation. In experimental results, it is shown that the loops can be decreased about 26% for the example of 256 bits-length of modulus that is from the small result of the difference between prime factors.