Cryptanalysis of an RSA variant with Moduli N = p r q - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

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.
Fichier principal
Vignette du fichier
wcc15-th2-3.pdf (366 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01276463 , version 1 (19-02-2016)

Identifiers

  • HAL Id : hal-01276463 , version 1

Cite

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⟩

Collections

WCC2015
62 View
462 Download

Share

Gmail Facebook Twitter LinkedIn More