A Software Library in ANSI C for Empirical Testing of Random Number Generators

[1]  Vincent Rijmen,et al.  The Design of Rijndael , 2002, Information Security and Cryptography.

[2]  Pierre L'Ecuyer,et al.  Distribution properties of multiply-with-c arry random number generators , 1997, Math. Comput..

[3]  Pierre L'Ecuyer,et al.  A random number generator based on the combination of four LCGs , 1997 .

[4]  Stephen Wolfram,et al.  Theory and Applications of Cellular Automata , 1986 .

[5]  Jürgen Eichenauer-Herrmann.  Modified explicit inversive congruential pseudorandom numbers with power of 2 modulus , 1996, Stat. Comput..

[6]  Masanori Fushimi.  Increasing the Orders of Equidistribution of the Leading Bits of the Tausworthe Sequence , 1983, Inf. Process. Lett..

[7]  A. De Matteis,et al.  A class of parallel random number generators , 1990, Parallel Comput..

[8]  Pierre L'Ecuyer,et al.  Tables of maximally equidistributed combined LFSR generators , 1999, Math. Comput..

[9]  William H. Press,et al.  Numerical recipes in C , 2002 .

[10]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[11]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[12]  Stefan Wegenkittl,et al.  A survey of quadratic and inversive congruential pseudorandom numbers , 1998 .

[13]  Pierre L'Ecuyer,et al.  Software for uniform random number generation: distinguishing the good and the bad , 2001, Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304).

[14]  Pierre L'Ecuyer,et al.  Combined Multiple Recursive Random Number Generators , 1995, Oper. Res..

[15]  G. S. Fishman.  Multiplicative congruential random number generators with modulus 2^{}: an exhaustive analysis for =32 and a partial analysis for =48 , 1990 .

[16]  Stephens Ma.  Statistics connected with the uniform distribution: percentage points and application to testing for randomness of directions. , 1966 .

[17]  RECURRING-WITH-CARRY SEQUENCES , 1995 .

[18]  Glyn Carter,et al.  Aspects of local linear complexity , 1989 .

[19]  Pierre L'Ecuyer,et al.  Efficient and portable combined Tausworthe random number generators , 1990, TOMC.

[20]  M. Luescher,et al.  A Portable High-quality Random Number Generator for Lattice Field Theory Simulations , 1993 .

[21]  S. K. Park,et al.  Random number generators: good ones are hard to find , 1988, CACM.

[22]  G. S. Fishman.  Principles of Discrete Event Simulation , 1978 .

[23]  R. Wikramaratna.  ACORN-A new method for generating sequences of uniformly distributed Pseudo-random Numbers , 1989 .

[24]  Pierre L'Ecuyer,et al.  A search for good multiple recursive random number generators , 1993, TOMC.

[25]  Pierre L'Ecuyer,et al.  Uniform random number generation , 1994, Ann. Oper. Res..

[26]  F. James,et al.  RANLUX: A Fortran implementation of the high-quality pseudorandom number generator of Lüscher , 1994 .

[27]  Jürgen Lehn,et al.  On the structure of quadratic congruential sequences , 1987 .

[28]  A. Rukhin,et al.  Statistical Testing of Random Number Generators , 1999 .

[29]  Michael Mascagni,et al.  SPRNG: A Scalable Library for Pseudorandom Number Generation , 1999, PP.

[30]  P. Bickel,et al.  Sums of Functions of Nearest Neighbor Distances, Moment Bounds, Limit Theorems and a Goodness of Fit Test , 1983 .

[31]  Pierre L'Ecuyer,et al.  Sparse Serial Tests of Uniformity for Random Number Generators , 1998, SIAM J. Sci. Comput..

[32]  Ueli Maurer,et al.  A universal statistical test for random bit generators , 1990, Journal of Cryptology.

[33]  Jürgen Eichenauer-Herrmann,et al.  A new inversive congruential pseudorandom number generator with power of two modulus , 1992, TOMC.

[34]  Pierre L'Ecuyer,et al.  Testing random number generators , 1992, WSC '92.

[35]  Frank Emmerich,et al.  Equidistribution properties of quadratic congruential pseudorandom numbers , 1997 .

[36]  Pierre L'Ecuyer,et al.  Efficient and portable combined random number generators , 1988, CACM.

[37]  Pierre L'Ecuyer,et al.  Linear recurrences with carry as uniform random number generators , 1995, WSC '95.

[38]  Vattulainen,et al.  Physical tests for random numbers in simulations. , 1994, Physical review letters.

[39]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[40]  Pierre L'Ecuyer,et al.  Beware of linear congruential generators with multipliers of the form a = ±2q ±2r , 1999, TOMS.

[41]  Elaine B. Barker,et al.  A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications , 2000 .

[42]  I. Good.  The serial test for sampling numbers and other tests for randomness , 1953, Mathematical Proceedings of the Cambridge Philosophical Society.

[43]  Noel A Cressie,et al.  The asymptotic-distribution of the scan statistic under uniformity , 1980 .

[44]  W. H. Payne,et al.  Coding the Lehmer pseudo-random number generator , 1969, CACM.

[45]  Shu Tezuka,et al.  On the lattice structure of the add-with-carry and subtract-with-borrow random number generators , 1993, TOMC.

[46]  George Marsaglia.  Note on a Proposed Test for Random Number Generators , 1985, IEEE Transactions on Computers.

[47]  J. Wolfowitz,et al.  The Covariance Matrix of Runs Up and Down , 1944 .

[48]  Richard P. Brent,et al.  Note on Marsaglia's Xorshift Random Number Generators , 2004 .

[49]  G. Marsaglia,et al.  Monkey tests for random number generators , 1993 .

[50]  George Marsaglia,et al.  Toward a universal random number generator , 1987 .

[51]  Gordana Ugrin-Sparac,et al.  Stochastic investigations of pseudo-random number generators , 1991, Computing.

[52]  T. Ala‐Nissila,et al.  Physical models as tests of randomness. , 1995, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[53]  M. Z. Wang.  Linear Complexity Profiles and Jump Complexity , 1997, Inf. Process. Lett..

[54]  Jean-Sébastien Coron,et al.  An Accurate Evaluation of Maurer's Universal Test , 1998, Selected Areas in Cryptography.

[55]  Leonidas J. Guibas,et al.  Periods in Strings , 1981, J. Comb. Theory, Ser. A.

[56]  D. M. Titterington,et al.  A comparison of two statistics for detecting clustering in one dimension , 1995 .

[57]  Jürgen Eichenauer-Herrmann,et al.  Inversive congruential pseudorandom numbers : a tutorial , 1992 .

[58]  P. Hall.  On powerful distributional tests based on sample spacings , 1986 .

[59]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[60]  P. A. W. Lewis,et al.  A Pseudo-Random Number Generator for the System/360 , 1969, IBM Syst. J..

[61]  Katja Ickstadt,et al.  Explicit inversive congruential pseudorandom numbers with power of two modulus , 1994 .

[62]  Pierre L'Ecuyer,et al.  Random Number Generators: Selection Criteria and Testing , 1998 .

[63]  P. L'Ecuyer.  Tests based on sum-functions of spacings for uniform random numbers , 1997 .

[64]  Guido E. del Pino.  On the Asymptotic Distribution of $k$-Spacings with Applications to Goodness-of-Fit Tests , 1979 .

[65]  Pierre L'Ecuyer,et al.  On the xorshift random number generators , 2005, TOMC.

[66]  Yosef S. Sherif,et al.  Development of a new composite pseudo random number generator , 1990 .

[67]  William H. Press,et al.  Portable Random Number Generators , 1992 .

[68]  Makoto Matsumoto.  Simple cellular automata as pseudorandom m-sequence generators for built-in self-test , 1998, TOMC.

[69]  Pierre L'Ecuyer,et al.  An Implementation of the Lattice and Spectral Tests for Multiple Recursive Linear Random Number Generators , 1997, INFORMS J. Comput..

[70]  G. Marsaglia,et al.  A New Class of Random Number Generators , 1991 .

[71]  Pierre L'Ecuyer,et al.  Tables of linear congruential generators of different sizes and good lattice structure , 1999, Math. Comput..

[72]  Helmut Prodinger,et al.  Digital Search Trees Again Revisited: The Internal Path Length Perspective , 1994, SIAM J. Comput..

[73]  G. Marsaglia,et al.  Matrices and the structure of random number sequences , 1985 .

[74]  Pierre L'Ecuyer,et al.  Random Number Generators and Empirical Tests , 1998 .

[75]  Makoto Matsumoto,et al.  Twisted GFSR generators , 1992, TOMC.

[76]  Peter Hellekalek,et al.  Empirical evidence concerning AES , 2003, TOMC.

[77]  Paul Bratley,et al.  A guide to simulation , 1983 .

[78]  Asymptotic efficiencies of spacings tests for goodness of fit , 1989 .

[79]  Noel A Cressie,et al.  On the logarithms of high-order spacings , 1976 .

[80]  Pierre L'Ecuyer,et al.  An Object-Oriented Random-Number Package with Many Long Streams and Substreams , 2002, Oper. Res..

[81]  Kenneth D. Lawrence,et al.  Modern Statistical Systems and GPSS Simulation , 1992 .

[82]  S. Tezuka.  Uniform Random Numbers: Theory and Practice , 1995 .

[83]  P. L’Ecuyer,et al.  On the lattice structure of certain linear congruential sequences related to AWC/SWB generators , 1994 .

[84]  Edward C. van der Meulen,et al.  Entropy-Based Random Number Evaluation , 1995 .

[85]  Brian D. Ripley,et al.  Thoughts on pseudorandom number generators , 1990 .

[86]  Simon Heron,et al.  Encryption: Advanced Encryption Standard (AES) , 2009 .

[87]  Marco Tomassini,et al.  Generating high-quality random numbers in parallel by cellular automata , 1999, Future Gener. Comput. Syst..

[88]  Whitlock,et al.  Pseudorandom number generator for massively parallel molecular-dynamics simulations. , 1994, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[89]  Pierre L'Ecuyer,et al.  On the performance of birthday spacings tests with certain families of random number generators , 2001 .

[90]  Antónia Földes,et al.  The limit distribution of the length of the longest head-run , 1979 .

[91]  S. Wallenstein,et al.  Probabilities for the Size of Largest Clusters and Smallest Intervals , 1974 .

[92]  Abraham Lempel,et al.  Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[93]  J. R. Heringa,et al.  Simulation of a directed random-walk model the effect of pseudo-random-number correlations , 1996, cond-mat/9612227.

[94]  P. D. Coddington,et al.  Analysis of random number generators using Monte Carlo simulation , 1993, cond-mat/9309017.

[95]  Ora E. Percus,et al.  Random Number Generators for MIMD Parallel Processors , 1989, J. Parallel Distributed Comput..

[96]  Asymptotic Results on the Greenwood Statistic and Some of its Generalizations , 1984 .

[97]  Stefan Wegenkittl,et al.  Inversive and linear congruential pseudorandom number generators in empirical tests , 1997, TOMC.

[98]  Pierre L'Ecuyer,et al.  Combined generators with components from different families , 2003, Math. Comput. Simul..

[99]  Pierre L'Ecuyer,et al.  Random numbers for simulation , 1990, CACM.

[100]  Maurice G. Kendall,et al.  Randomness and Random Sampling Numbers , 1938 .

[101]  A. Rukhin.  Distribution of the number of words with a prescribed frequency and tests of randomness , 2002, Advances in Applied Probability.

[102]  P. L’Ecuyer,et al.  Structural properties for two classes of combined random number generators , 1990 .

[103]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[104]  David G. Carta,et al.  Two fast implementations of the “minimal standard” random number generator , 1990, CACM.

[105]  Cleve B. Moler,et al.  Numerical computing with MATLAB , 2004 .

[106]  Pierre L'Ecuyer,et al.  Maximally equidistributed combined Tausworthe generators , 1996, Math. Comput..

[107]  Keizo Takashima.  LAST VISIT TIME TESTS FOR PSEUDORANDOM NUMBERS , 1996 .

[108]  Pierre L'Ecuyer,et al.  Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators , 1999, Oper. Res..

[109]  Michael S. Waterman,et al.  An extreme value theory for long head runs , 1986 .

[110]  Makoto Matsumoto,et al.  Twisted GFSR generators II , 1994, TOMC.

[111]  P. L'Ecuyer,et al.  Fast combined multiple recursive generators with multipliers of the form a=/spl plusmn/2/sup q//spl plusmn/2/sup r/ , 2000, 2000 Winter Simulation Conference Proceedings (Cat. No.00CH37165).

[112]  Maurice G. Kendall,et al.  Second Paper on Random Sampling Numbers , 1939 .

[113]  Robert M. Ziff,et al.  Four-tap shift-register-sequence random-number generators , 1998 .

[114]  Pierre L'Ecuyer.  Efficient and portable 32-bit random variate generators , 1986, WSC '86.

[115]  J. P. R. Tootill,et al.  An Asymptotically Random Tausworthe Sequence , 1973, JACM.

[116]  N. Cressie.  An optimal statistic based on higher order gaps , 1979 .

[117]  J. Eichenauer-Herrmann.  Statistical independence of a new class of inversive congruential pseudorandom numbers , 1993 .

[118]  Richard P. Brent,et al.  On the periods of generalized Fibonacci recurrences , 1994, ArXiv.

[119]  Scott Kirkpatrick,et al.  A very fast shift-register sequence random number generatorjournal of computational physics , 1981 .

[120]  Alan M. Ferrenberg,et al.  Monte Carlo simulations: Hidden errors from "good" random number generators. , 1992, Physical review letters.

[121]  Jean-François Cordeau,et al.  Close-Point Spatial Tests and Their Application to Random Number Generators , 2000, Oper. Res..

[122]  George Marsaglia,et al.  A random number generator for PC's , 1990 .

[123]  Jürgen Eichenauer-Herrmann,et al.  Compound cubic congruential pseudorandom numbers , 1997, Computing.

[124]  Dennis K. J. Lin,et al.  Random Number Generation for the New Century , 2000 .

[125]  S. Wolfram.  Statistical mechanics of cellular automata , 1983 .

[126]  Robert E. Greenwood.  Coupon collector’s test for random digits , 1955 .

[127]  Ora E. Percus,et al.  Theory and application of Marsaglia's monkey test for pseudorandom number generators , 1995, TOMC.

[128]  S. Wolfram.  Random sequence generation by cellular automata , 1986 .

[129]  Harald Niederreiter,et al.  Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.

[130]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[131]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[132]  G. Marsaglia,et al.  Some Difficult-to-pass Tests of Randomness , 2022 .

[133]  Brian Wichmann,et al.  Building a random-number generator , 1987 .

[134]  Ronald L. Wasserstein,et al.  Monte Carlo: Concepts, Algorithms, and Applications , 1997 .

[135]  Naomi S. Altman,et al.  Bit-Wise Behavior of Random Number Generators , 1988 .

[136]  Wolfgang Hörmann,et al.  A portable random number generator well suited for the rejection method , 1993, TOMS.

[137]  M. Fushimi.  Random number generation with the recursion X t =X t-3p ⊕X t-3q , 1990 .