Generalized Implicit Factorization Problem

ePrint Report: Generalized Implicit Factorization Problem

Yansong Feng, Abderrahmane Nitaj, Yanbin Pan

The Implicit Factorization Problem (IFP) was first introduced by May and Ritzenhofen at PKC'09, which concerns the factorization of two RSA moduli $N_1=p_1q_1$ and $N_2=p_2q_2$, where $p_1$ and $p_2$ share a certain consecutive number of least significant bits. Since its introduction, many different variants of IFP have been considered, such as the cases where $p_1$ and $p_2$ share most significant bits or middle bits at the same positions. …

bits eprint report introduction least significant bits may pan pkc problem report rsa share