Time/Memory/Data Tradeoffs for Variants of the RSA Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

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


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

Dates and versions

hal-01094301 , version 1 (12-12-2014)



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. pp.651-662, ⟨10.1007/978-3-642-38768-5_57⟩. ⟨hal-01094301⟩
559 View
326 Download



Gmail Facebook X LinkedIn More