Time/Memory/Data Tradeoffs for Variants of the RSA Problem

Abstract : In this paper, we study the security of the Micali-Schnorr pseudorandom number generator. The security of this cryptographic scheme is based on two computational problems which are variants of the RSA problem. The RSA problem essentially aims at recovering the plaintext from a random ciphertext. In the analysis of the Micali-Schnorr pseudorandom generator, we are interested in instances of this problem where the plaintext is small and where the ciphertext is not entirely known. We will describe time / memory tradeoff techniques to solve these hard problems which provides the first analysis of this pseudoran-dom generator 25 years after its publication.
Type de document :
Communication dans un congrès
Computing and Combinatorics, 19th International Conference, COCOON 2013, Jun 2013, Hangzhou, China. LNCS 7936, pp.651-662, 2013, Computing and Combinatorics, 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings. 〈10.1007/978-3-642-38768-5_57〉
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01094301
Contributeur : Pierre-Alain Fouque <>
Soumis le : vendredi 12 décembre 2014 - 09:31:19
Dernière modification le : vendredi 25 mai 2018 - 12:02:05
Document(s) archivé(s) le : vendredi 13 mars 2015 - 10:25:11

Fichier

FVZ13.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Pierre-Alain Fouque, Damien Vergnaud, Jean-Christophe Zapalowicz. Time/Memory/Data Tradeoffs for Variants of the RSA Problem. Computing and Combinatorics, 19th International Conference, COCOON 2013, Jun 2013, Hangzhou, China. LNCS 7936, pp.651-662, 2013, Computing and Combinatorics, 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings. 〈10.1007/978-3-642-38768-5_57〉. 〈hal-01094301〉

Partager

Métriques

Consultations de la notice

604

Téléchargements de fichiers

204