Title :
Deciphering a linear congruential encryption
Author :
Knuth, Donald E.
fDate :
1/1/1985 12:00:00 AM
Abstract :
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.
Keywords :
Cryptography; Random number generation; Computer science; Cryptography; Honorary membership; Random number generation;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1985.1056997
