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

Yao Lu (1) , Liqiang Peng (1) , Santanu Sarkar (2)

1 State Key Laboratory for Information Security
2 IIT Madras - Indian Institute of Technology Madras

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.

Mots clés: Coppersmith's method; Lattices; RSA; RSA variants

Domaines: Théorie de l'information [cs.IT]

Yao Lu, Liqiang Peng, Santanu Sarkar. Cryptanalysis of an RSA variant with Moduli N = p r q. The 9th International Workshop on Coding and Cryptography 2015 WCC2015, Apr 2015, Paris, France. ⟨hal-01276463⟩