Affiliation:
1. 1 University of Debrecen , Faculty of Informatics , Debrecen , Hungary
Abstract
Abstract
In this paper, we have collected some theoretical and practical pseudorandom number generators (PRNGs) with uniform distribution. We have also analyzed some of the most prevalent statistical tests and we present some observations and statistical tests of the sequences generated by the described generators.
Reference38 articles.
1. Kolmogorov A.N., On tables of random numbers, Theoretical Computer Science, 207(2), 387-395, 1998.
2. Kolmogorov A.N., Three approaches to the quantitative definition of information, Problems of Information Transmission, 1(1), 1-7, 1965.
3. Chaitin G.J., On the simplicity and speed of programs for computing infinite sets of natural numbers, Journal of the ACM, 16(3), 407-422, 1969.
4. Solomono R., A formal theory of inductive inference: Part I and Part II, Information and Control, 7(1) and (2), 1-22 and 224-254, 1964.
5. Niederreiter H., Random Number Generation and Quasi-Monte Carlo Methods, Society for Industrial and Applied Mathematics (SIAM), USA, 1992.