Time/memory/data tradeoffs for variants of the RSA problem

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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 pseudorandom generator 25 years after its publication. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Fouque, P. A., Vergnaud, D., & Zapalowicz, J. C. (2013). Time/memory/data tradeoffs for variants of the RSA problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7936 LNCS, pp. 651–662). https://doi.org/10.1007/978-3-642-38768-5_57

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free