Testing randomness: A suite of statistical procedures

Theory of Probability and its Applications

Volumn 45, Issue 1, 2000, Pages 111-132

  Rukhin, A L ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Correlation polynomial; Distribution of m patterns; Entropy; P values; 2 distribution

Indexed keywords

EID: 0034747573     PISSN: 0040585X     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0040585X97978087     Document Type: Article

References (35)

1. D. ALDOUS AND P. SHIELDS, A diffusion limit for a class of randomly-growing binary trees, Probab. Theory Related Fields, 79 (1988), pp. 509-542.
2. A. D. BARBOUR, L. HOLST, AND S. JANSON, Poisson Approximation, Clarendon Press, Oxford, 1992.
3. M. BARON AND A. L. RUKHIN, Distribution of the number of visits of a random walk, Comm. Statist. Stochastic Models, 15 (1999), pp. 593-597.
4. P. BILLINGSLEY, Asymptotic distributions of two goodness of fit criteria, Ann. Math. Statist., 27 (1956), pp. 1123-1129.
5. J.-S. CORON AND D. NACCACHE, An accurate evaluation of Maurer's universal test, in Selected Areas in Cryptography, Lecture Notes in Comput. Sci. 1556, Springer, Berlin, 1999, pp. 57-71.
6. F. N. DAVID AND D. E. BARTON, Combinatorial Chance, Hafner, New York, 1962.
7. W. FELLER, An Introduction to Probability Theory and Its Applications, 3rd Edition, J. Wiley, New York, 1968.
8. J. GIBBONS AND J. PRATT, P-values: Interpretations and methodology, Amer. Statist., 29 (1975), pp. 20-25.
9. I. J. GOOD, The serial test for sampling numbers and other tests for randomness, Proc. Cambridge Philos. Soc., 47 (1953), pp. 276-284.
10. L. J. GUIBAS AND A. M. ODLYZKO, String overlaps, pattern matching and nontransitive games, J. Combin. Theory Ser. A, 30 (1981), pp. 183-208.
11. H. GUSTAFSON, E. DAWSON, L. NIELSEN, AND W. CAELLI, A computer package for measuring the strength of encryption algorithms, Computers and Security, 13 (1994), pp. 687-697.
12. N. L. JOHNSON, S. KOTZ, AND A. W. KEMP, Univariate Discrete Distributions, Wiley, New York, 1992.
13. P. KIRSCHENHOFER, H. PRODINGER, AND W. SZPANKOWSKI, Digital search trees again revisited: The internal path length perspective, SIAM J. Comput., 23 (1994), pp. 598-616.
14. I. N. KOVALENKO, Distribution of the linear rank of a random matrix, Theory Probab. Appl., 17 (1972), pp. 342-346.
15. D. E. KNUTH, The Art of Computer Programming, Vol. 2, Addison-Wesley, Reading, MA, 1998.
16. G. MARSAGLIA, A current view of random number generation, in Computer Science and Statistics: Proceedings of the Sixteenth Symposium on the Interface, Elsevier, New York, 1985, pp. 3-10.
17. G. MARSAGLIA, Diehard: A Battery of Tests for Randomness, 1996. Available on-line at http://stat.fsu.edu/~geo/.
18. G. MARSAGLIA AND A. ZAMAN, Monkey tests for random number generators, Comput. Math. Appl., 9 (1993), pp. 1-10.
19. U. M. MAURER, A universal statistical test for random bit generators, J. Cryptology, 5 (1992), pp. 89-105.
20. A. J. MENEZES, P. C. VAN OORSCHOT, AND S. A. VANSTONE, Handbook of Applied Cryptography, CRC Press, Boca Raton, FL, 1997.
21. V. G. MIKHAILOV, Asymptotic normality of decomposable statistics from the frequencies of m-chains, Discrete Math. Appl., 1 (1991), pp. 335-347.
22. S. PINCUS AND R. E. KALMAN, Not all (possibly) "random" sequences are created equal, Proc. Nat. Acad. Sci. USA, 94 (1997), pp. 3513-3518.
23. S. PINCUS AND B. H. SINGER, Randomness and degrees of irregularity, Proc. Nat. Acad. Sci. USA, 93 (1996), pp. 2083-2088.
24. C. R. RAO AND S. K. MITRA, Generalized Inverse of Matrices and Its Applications, Wiley, New York, 1971.
25. P. REVESZ, Random Walk in Random and Non-Random Environments, World Scientific, Singapore, 1990.
26. R. RUEPPEL, Analysis and Design of Stream Ciphers, Springer-Verlag, Berlin, 1986.
27. A. L. RUKHIN, Approximate entropy for testing randomness, J. Appl. Probab., 37 (2000), pp. 88-100.
28. A. L. RUKHIN, J. SOTO, J. NECHVATAL, M. SMID, M. LEVENSON, D. BANKS, M. VANGEL, S. LEIGH, S. VO, AND J. DRAY, A Statistical Test Suite for the Validation of Cryptographic Random Number Generators, Special NIST Publication, National Institute of Standards and Technology, Gaithersburg, MD, 2000.
29. A. V. SKOROKHOD AND N. P. SLOBODENYUK, Limit theorems for random walks, I, II, Theory Probab. Appl., 10 (1965), pp. 596-606; 11 (1966), pp. 46-57.
30. A. V. SKOROKHOD AND N. P. SLOBODENYUK, Limit theorems for random walks, I, II, Theory Probab. Appl., 10 (1965), pp. 596-606; 11 (1966), pp. 46-57.
31. M. I. TIKHOMIROVA AND V. P. CHISTYAKOV, On the asymptotics of moments of nonappearing s-chains, Discrete Math. Appl., 7 (1997), pp. 13-32.
32. M. I. TIKHOMIROVA AND V. P. CHISTYAKOV, On statistical tests based on missing s-patterns, in Papers on Discrete Mathematics, Vol. 1, V. N. Sachkov et al., eds., TVP Publishers, Moscow, 1997, pp. 265-278 (in Russian).
33. V. A. VATUTIN AND V. G. MIKHAILOV, Statistical estimation of entropy of discrete random variables with a large number of possible values, Russian Math. Surveys, 50 (1995), pp. 121-132.
34. J. ZIV, Compression, tests for randomness and estimating the statistical model of an individual sequence, in Sequences: Combinatorics, Compression, Security, and Transmission, R. M. Capocelli, ed., Springer-Verlag, New York, 1990, pp. 366-373.
35. J. ZIV AND A. LEMPEL, A universal algorithm for sequential data compression, IEEE Trans. Information Theory, IT-23 (1977), pp. 337-343.