Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Jean-Pierre Tillich Connect in order to contact the contributor
Submitted on : Friday, February 19, 2016 - 2:08:29 PM
Last modification on : Saturday, July 21, 2018 - 5:22:02 PM
Long-term archiving on: : Friday, May 20, 2016 - 11:22:44 AM


Files produced by the author(s)


  • HAL Id : hal-01276463, version 1



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⟩



Record views


Files downloads