Deciphering a linear congruential encryption
Donald Knuth · IEEE Transactions on Information Theory · 1985
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.