Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-01094301
Contributor : Pierre-Alain Fouque <>
Submitted on : Friday, December 12, 2014 - 9:31:19 AM
Last modification on : Tuesday, September 22, 2020 - 3:48:07 AM
Long-term archiving on: : Friday, March 13, 2015 - 10:25:11 AM

File

FVZ13.pdf
Files produced by the author(s)

Identifiers

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

Share

Metrics

Record views

835

Files downloads

448