D. H. Lehmer, Mathematical methods in large-scale computing units, Proceedings of a Second Symposium on Large-Scale Digital Calculating Machinery, 1949, Harvard University Press, Cambridge, Mass., 1951, pp. 141—146. MR 0044899 (13,495f)[1] [Архівовано 24 грудня 2013 у Wayback Machine.]
M. Greenberger, Method in randomness, Comm. ACM 8 (1965), 177—179.[2] [Архівовано 24 грудня 2013 у Wayback Machine.]
The GNU C library's rand() in stdlib.h uses a simple (single state) linear congruential generator only in case that the state is declared as 8 bytes. If the state is larger (an array), the generator becomes an additive feedback generator and the period increases. See the simplified code [Архівовано 2 лютого 2015 у Wayback Machine.] that reproduces the random sequence from this library.
delphizine.com
Бакнелл Д.М. Фундаментальные алгоритмы и структуры данных в Delphi. Библиотека программиста. — Delphi Informant Magazine, 2002.
In spite of documentation on MSDN [Архівовано 8 березня 2016 у Wayback Machine.], RtlUniform uses LCG, and not Lehmer's algorithm, implementations before Windows Vista are flawed, because the result of multiplication is cut to 32 bits, before modulo is applied
T.E. Hull and A.R. Dobell «Random Number Generators»,SIAM Review 4-3(1962),230-254 [3] [Архівовано 24 грудня 2013 у Wayback Machine.]
web.archive.org
D. H. Lehmer, Mathematical methods in large-scale computing units, Proceedings of a Second Symposium on Large-Scale Digital Calculating Machinery, 1949, Harvard University Press, Cambridge, Mass., 1951, pp. 141—146. MR 0044899 (13,495f)[1] [Архівовано 24 грудня 2013 у Wayback Machine.]
M. Greenberger, Method in randomness, Comm. ACM 8 (1965), 177—179.[2] [Архівовано 24 грудня 2013 у Wayback Machine.]
T.E. Hull and A.R. Dobell «Random Number Generators»,SIAM Review 4-3(1962),230-254 [3] [Архівовано 24 грудня 2013 у Wayback Machine.]
Брюс Шнайєр. Прикладная криптография. — Триумф, 2002. — С. 275. Архівовано з джерела 28 лютого 2014
The GNU C library's rand() in stdlib.h uses a simple (single state) linear congruential generator only in case that the state is declared as 8 bytes. If the state is larger (an array), the generator becomes an additive feedback generator and the period increases. See the simplified code [Архівовано 2 лютого 2015 у Wayback Machine.] that reproduces the random sequence from this library.
In spite of documentation on MSDN [Архівовано 8 березня 2016 у Wayback Machine.], RtlUniform uses LCG, and not Lehmer's algorithm, implementations before Windows Vista are flawed, because the result of multiplication is cut to 32 bits, before modulo is applied
