… Thus we have shown that there exist a reduction a successful attack on the BBS generator
to factoring. While for asymptotic security it suffices to give a polynomial time reduction, we …

… 1997), who showed that the existence of certain lower bound arguments for P/poly would
disprove the existence of exponentially hard pseudorandom generators at all. We proceed with …

… constructing pseudorandom generators … pseudorandom generators, which are pseudorandom
distributions taking values in [− 1, 1] n. Next, we use a fractional pseudorandom generator …

… Being satisfied that we have a generator that is able to produce a single stream of iid
random variables which satisfy P1, two paradigms exist for generating parallel iid streams. …

… the pseudo random number generation so that the time needed to generate a pseudo random
… This shows the existence of non-linear congruential generators (2) with maximal period …

… , it might be surprising that there even exists a PRG with near-logarithmic seed … generator
manages to outperform the probabilistic method because the second half of the INW generator’…

… We demonstrate that there exist linear-stretch pseudorandom number generators that can
be computed by linear-size circuits provided that there exists a suitable class of exponentially …

… a pseudorandom generator to solve a particular single problem. But if we use a pseudorandom
generator … However, unfortunately, we do not know if its instance exists. Let us introduce …

… The hardness-versus-randomness paradigm asserts, qualitatively, that strong explicit PRGs
exist if and only if strong explicit circuit lower bounds exist. In the context of unconditional …

What do we want from a pseudo-random sequence generator? Ideally, we would like a
pseudo-random sequence generator to quickly produce, from short seeds, long sequences (of …