It is shown that the multiplier, the increment, and the seed value of a linear congruential random number generator on a binary computer can be deduced from the leading bits of the "random" numbers that are generated.
No takes yet. Share an insight, caveat, or question.
Donald Knuth (1985) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: