On the Provable Security of an Efficient RSA-Based Pseudorandom Generator (2006)
| Venue: | Advances in Cryptology – Asiacrypt 2006, Lecture Notes in Computer Science |
| Citations: | 3 - 0 self |
BibTeX
@TECHREPORT{Steinfeld06onthe,
author = {Ron Steinfeld and Josef Pieprzyk and Huaxiong Wang},
title = {On the Provable Security of an Efficient RSA-Based Pseudorandom Generator},
institution = {Advances in Cryptology – Asiacrypt 2006, Lecture Notes in Computer Science},
year = {2006}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 e#cient provably secure RSA-based generators output asymptotically only at most O(log n) bits per multiply modulo an RSA modulus of bitlength n, and hence are too slow to be used in many practical applications.
