We present a simple to implement and efficient pseudorandom generator based on the factoring assumption. It outputs more than pn/2 pseudorandom bits per p ...
Mar 14, 2003 · We present a simple to implement and efficient pseudorandom generator based on the factoring assumption. It outputs more than pn/2 ...
The generator is based on results by Hastad, Schrift and Shamir, but unlike their generator and its improvement by Goldreich and Rosen [GR00], ...
We present a simple to implement and efficient pseudorandom generator based on the factoring assumption. It outputs more than pn/2 pseudorandom bits per p ...
Nenad Dedic, Leonid Reyzin, Salil P. Vadhan: An Improved Pseudorandom Generator Based on Hardness of Factoring. IACR Cryptol. ePrint Arch. 2002: 131 (2002).
Mar 2, 2022 · Abstract. We give the best known pseudorandom generators for two touchstone classes in unconditional derandomization: small-depth circuits ...
Abstract. Under the assumption that solving the discrete logarithm problem modulo an n-bit safe prime p is hard even when the exponent is a small c-bit ...
People also ask
What is the existence of pseudorandom generators?
What is pseudorandom generators for low degree polynomials?
What is the construction of a pseudo random generator from any one way function?
... factoring-based pseudorandom generators (which also require O(n) multiplications per evaluation) and certainly improves the e ciency of the GGM pseudorandom ...
We present a simple new construction of a pseudorandom bit generator, based on the constant depth generators of [N]. It stretches a short string of truly random ...
requires a mildly explicit pseudorandom generator, and showed how to construct such generators based on the average-case hardness of E (Theorem 7.24). A ...