A Simple Improvement for Integer Factorizations with Implicit Hints

Abstract

In this paper, we describe an improvement of integer factorization of k RSA moduli N_i=p_iq_i (1≤i≤k) with implicit hints, namely all p_i share their t least significant bits. May et al. reduced this problem to finding a shortest (or a relatively short) vector in the lattice of dimension k obtained from a given system of k RSA moduli, for which they applied Gaussian reduction or the LLL algorithm. In this paper, we improve their method by increasing the determinant of the lattice obtained from the k RSA moduli. We see that, after our improvement, May et al.'s method works smoothly with higher probability. We further verify the efficiency of our method by computer experiments for various parameters.