Advances in Cryptology
Chaum, D. / Blakely, G. R.
Recently, there has been a lot of interest in provably "good" pseudo-random number generators [lo, 4, 14, 31. These cryptographically secure generators are "good" in the sense that they pass all probabilistic polynomial time statistical tests. However, despite these nice properties, the secure generators known so far suffer from the han- cap of being inefiicient, the most efiicient of these take n2 steps (one modular multip- cation, n being th...