Inferring a Sequence Generated by a Linear Congruence
暂无分享,去创建一个
Suppose it is known that fX o , Xl'. ·. , X n J is produced by a pseudo-random number generator of the form X i + 1 = aX i + b mod m, but a, b, and m are' unknown. Can one efficiently predict the remainder of the sequence with knowledge of only a few elements from that se-quence? This question is answered in the affirmative and an algorithm is given.
[1] James A. Reeds,et al. "Cracking" a Random Number Generator , 1977, Cryptologia.
[2] Adi Shamir,et al. On the Generation of Cryptographically Strong Pseudo-Random Sequences , 1981, ICALP.