A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We look at iterated power generators si = s e 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 (1 − 1 e ) log N most significant bits per iteration allows for efficient recovery of the whole sequence. This means in particular that the Blum-Blum-Shub generator should be used with an output of less than half of the bits per iteration and the RSA generator with e = 3 with less than a 1 3 -fraction of the bits. Ourdoi:10.1007/978-3-642-10366-7_29 fatcat:q6o3vntccvcu3iqlxgklqbxhky