Inferring a sequence generated by a linear congruence
- 1 November 1982
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
- p. 153-159
- https://doi.org/10.1109/sfcs.1982.73
Abstract
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.Keywords
This publication has 1 reference indexed in Scilit:
- How to generate cryptographically strong sequences of pseudo random bitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982