摘要: It is shown that the multiplier, increment, and seed value of a linear congruential random number generator on binary computer can be deduced from leading bits "random" numbers are generated.
acm.org
sci-hub.se 参考文章(4)
James Reeds, CRACKING A MULTIPLICATIVE CONGRUENTIAL ENCRYPTION ALGORITHM Information Linkage Between Applied Mathematics and Industry. pp. 467- 472 ,(1979) , 10.1016/B978-0-12-734250-4.50037-0
James Reeds, Solution of Challenge Cipher Cryptologia. ,vol. 3, pp. 83- 95 ,(1979) , 10.1080/0161-117991853873
Carter Bays, S. D. Durham, Improving a Poor Random Number Generator ACM Transactions on Mathematical Software. ,vol. 2, pp. 59- 64 ,(1976) , 10.1145/355666.355670
James Reeds, “CRACKING” A RANDOM NUMBER GENERATOR Cryptologia. ,vol. 1, pp. 20- 26 ,(1977) , 10.1080/0161-117791832760