References
- Knuth , D. E. 1997 . The Art of Computer Programming , 3 , Vol. 2 , Reading, MA : Addison-Wesley Inc .
- Marsaglia , G. A current view of random number generation . Computer Science and Statistics: Proceedings of the Sixteenth Symposium on the Interface . New York. pp. 3 – 10 . Elsevier Science Publishers .
- Rukhin , A. L. 2000 . Approximate entropy for testing randomness . Journal of Applied Probability , 37 : 88 – 100 .
- Barbour , A. D. , Holst , L. and Janson , S. 1992 . Poisson Approximation , Oxford : Oxford University Press .
- Reinert , G. , Schbath , S. and Waterman , M. S. 2000 . Probabilistic and statistical properties of words: an overview . Journal of Computational Biology , 7 : 1 – 46 .
- Szpankowski , W. 2001 . Average Case Analysis of Algorithms on Sequences , New York : Wiley-Interscience .
- Marsaglia , G. and Zaman , A. 1993 . Monkey tests for random number generators . Computers and Mathematics with Applications , 9 : 1 – 10 .
- Marsaglia , G. 1996 . Diehard: a battery of tests for randomness . Available online at: http://stat.fsu.edu/geo/diehard.html
- Rukhin , A. L. 2002 . Distribution of the number of words with a prescribed frequency and tests of randomness . Advanced Applied Probability , 34 : 775 – 797 .
- Kolchin , V. F. , Sevast'yanov , B. A. and Chistyakov , V. P. 1978 . Random Allocations , Washington, DC : Whinston Sons .
- Guibas , L. J. and Odlyzko , A. M. 1981 . Periods in strings . Journal of Combinatorial Theory , 30A : 19 – 42 .
- Mikhailov , V. G. 1989 . Asymptotic normality of decomposable statistics from the frequencies of m-chains . Discrete Mathematics and Applications , 1 : 335 – 347 .
- Soto , J. and Bassham , L. Randomness testing of the advanced encryption standard finalist candidates . Proceedings of AES Conference . Available online at: http://csrc.nist.gov/publications/nistir/ir6483.pdf
- Stipcevic , M. 2004 . Fast nondeterministic random bit generator based on weakly correlated physical events . Review of Scientific Instruments , 75 : 4442 – 4449 .
- Jakobsson , M. , Shriver , E. , Hillyer , B. K. and Juels , A. A practical secure physical random bit generator . Proceedings of the Fifth ACM Conference on Computer and Communications Security . San Francisco.
- American Bankers Association, 1998, Public key cryptography for the financial services industry: the elliptic curve digital signature algorithm (ECDSA), Annex A.4. ANSI X9.62
- National Institute of Standards and Technology, 2000, Digital signature standard (DSS), Appendices 3.1 and 3.2, Federal Information Processing Standards Publication 186-2. Available online at: http://csrc.nist.gov/publications/fips/fips186-2/fips186-2-changel.pdf
- National Institute of Standards and Technology, 2005, Using the 3-key triple DES and AES algorithms, NIST-Recommended Random Number Generator Based on ANSI X9.31, Appendix A.2.4. Available online at: http://csrc.nist.gov/cryptval/rng/931rngext.pdf
- Pincus , S. and Kalman , R. E. Not all (possibly) ‘random’ sequences are created equal . Proceedings of the National Academy of Sciences of the United States of America . Vol. 94 , pp. 3513 – 3518 .
- Good , I. J. and Gover , T. N. 1967 . The generalized serial test and the binary expansion of √2 . Journal of Royal Statistical Society , 130A : 102 – 107 .
- Rukhin , A. L. , Soto , J. , Nechvatal , J. , Smid , M. , Barker , E. , Leigh , S. , Levenson , M. , Vangel , M. , Banks , D. , Heckert , A. , Dray , J. and Vo , S. 2000 . “ A statistical test suite for random and pseudorandom number generators for cryptographic applications ” . In NIST Special Publication 800-22 Department of Commerce. Available online at: http://csrc.nist.gov/rng/