Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.14/100695
50 Visitors52 Hits0 Downloads
On the provable security of an efficient RSA-based pseudorandom generator
International Conference on the Theory and Application of Cryptology and Information Security (12th : 2006) (3-7 December 2006 : Shanghai)
Lai, Xuejia and Chen, Kefei. Advances in cryptology - ASIACRYPT 2006 : 12th international conference on the theory and application of cryptology and information security Shanghai, China, December 3-7, 2006 : proceedings, p.194-209
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.