On the provable security of an efficient RSA-based pseudorandom generator

Steinfeld, Ron, Pieprzyk, Josef, & Wang, Huaxiong (2006) On the provable security of an efficient RSA-based pseudorandom generator. Lecture Notes in Computer Science : Advances in Cryptology, 4284, pp. 194-209.

View at publisher


Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensively studied in the literature over the last 25 years. These generators have the attractive feature of provable pseudorandomness security assuming the hardness of the RSA inversion problem. However, despite extensive study, the most efficient provably secure RSA-based generators output asymptotically only at most O(logn) bits per multiply modulo an RSA modulus of bitlength n, and hence are too slow to be used in many practical applications.

To bring theory closer to practice, we present a simple modification to the proof of security by Fischlin and Schnorr of an RSA-based PRG, which shows that one can obtain an RSA-based PRG which outputs Ω(n) bits per multiply and has provable pseudorandomness security assuming the hardness of a well-studied variant of the RSA inversion problem, where a constant fraction of the plaintext bits are given. Our result gives a positive answer to an open question posed by Gennaro (J. of Cryptology, 2005) regarding finding a PRG beating the rate O(logn) bits per multiply at the cost of a reasonable assumption on RSA inversion.

Impact and interest:

10 citations in Scopus
Search Google Scholar™
14 citations in Web of Science®

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

ID Code: 74288
Item Type: Journal Article
Refereed: Yes
Additional Information: Proceedings of the 12th International Conference on the Theory and Application of Cryptology and Information Security, Shanghai, China, December 3-7, 2006.
DOI: 10.1007/11935230_13
ISSN: 0302-9743
Divisions: Current > QUT Faculties and Divisions > Science & Engineering Faculty
Copyright Owner: Copyright 2006 Springer
Deposited On: 23 Jul 2014 01:01
Last Modified: 25 Jul 2014 00:10

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page