This version uses a cryptographically secure pseudorandom number generator. The scheme relies on a one way function f and its hard core predicate h. Given the seed s, the generator outputs n+1 pseudorandom bits in the following manner: h(s) || h(f(s)) || h(f(f(s))) || ... || h(f^n(s)) where `||' is a concatenation operator.