DocumentCode
939739
Title
Deciphering a linear congruential encryption
Author
Knuth, Donald E.
Volume
31
Issue
1
fYear
1985
fDate
1/1/1985 12:00:00 AM
Firstpage
49
Lastpage
52
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;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1985.1056997
Filename
1056997
Link To Document