Inferring a sequence generated by a linear congruence
Joan B. Plumstead · 1982
Suppose it is known that {X0, X1,...,Xn} is produced by a pseudo-random number generator of the form Xi+1= aXi+ 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 sequence? This question is answered in the affirmative and an algorithm is given.