ASIACRYPT
2009
Springer
14 years 6 months ago
2009
Springer
We look at iterated power generators si = se i−1 mod N for a random seed s0 ∈ ZN that in each iteration output a certain amount of bits. We show that heuristically an output of...