A pseudo-random number generator for personal computers
This paper deals with the pseudo-random number generation method [\textit{B. A. Wichmann} and \textit{I. D. Hill}, Appl. Statist. 31, 188-190 (1982)]. The method first computes in parallel three generators, \(m_i\equiv 171m_{i-1}\pmod {30269}\), \(m_i'\equiv 172m_{i-1}' \pmod {30307}\) and \(m_i''\equiv 170m_{i-1}''\pmod {30323}\) with given initial values \(m_0, m_0'\) and \(m_0''\), respectively, and uses the fractional part \(\gamma_i=\{m_i/30269+ m_i'/30307+m_i''/30323\}\) as a pseudo-random number. The authors found the initial value selection is crucial by several randomness tests, and provided empirically a good choice of the initial values. The reviewer feels the authors' recommendation is limited because it is derived empirically from very limited statistical randomness tests.
scientific article; zbMATH DE number 1391529