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

Yao Lu 1 Liqiang Peng 1 Santanu Sarkar 2, *
* Auteur correspondant
1 State Key Laboratory for Information Security
2 IIT Madras - Indian Institute of Technology Madras
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.
Keywords : Coppersmith's method Lattices RSA RSA variants
Type de document :
Communication dans un congrès
Pascale Charpin, Nicolas Sendrier, Jean-Pierre Tillich. The 9th International Workshop on Coding and Cryptography 2015 WCC2015, Apr 2015, Paris, France. 2016, 〈wcc2015.inria.fr〉
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger
https://hal.inria.fr/hal-01276463
Contributeur : Jean-Pierre Tillich <>
Soumis le : vendredi 19 février 2016 - 14:08:29
Dernière modification le : samedi 21 juillet 2018 - 17:22:02
Document(s) archivé(s) le : vendredi 20 mai 2016 - 11:22:44

Fichier

wcc15-th2-3.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01276463, version 1

Collections

WCC2015

Citation

Yao Lu, Liqiang Peng, Santanu Sarkar. Cryptanalysis of an RSA variant with Moduli N = p r q. Pascale Charpin, Nicolas Sendrier, Jean-Pierre Tillich. The 9th International Workshop on Coding and Cryptography 2015 WCC2015, Apr 2015, Paris, France. 2016, 〈wcc2015.inria.fr〉. 〈hal-01276463〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

56

Téléchargements de fichiers

213

Contact


archive-ouverte@inria.fr