Cryptanalysis of an RSA variant with Moduli N = p r q

Abstract : We study an RSA variant with moduli of the form N = p r q l with r > l ≥ 2. This variant was mentioned by Boneh et al. (Crypto 1999). Later Kim et al. (Indocrypt 2000) showed that this variant is much faster than standard RSA moduli in the decryption process. In this paper, for the first time, we give some cryptanalysis results on this RSA variant. Our analysis show that in some cases, this cryptosystem can be totally broken.