On the design of state-of-the-art pseudorandom number generators by means of genetic programming

The design of pseudorandom number generators by means of evolutionary computation is a classical problem. Today, it has been mostly and better accomplished by means of cellular automata and not many proposals, inside or outside this paradigm could claim to be both robust (passing all the statistical tests, including the most demanding ones) and fast, as is the case of the proposal we present here. Furthermore, for obtaining these generators, we use a radical approach, where our fitness function is not at all based in any measure of randomness, as is frequently the case in the literature, but of nonlinearity. Efficiency is assured by using only very efficient operators (both in hardware and software) and by limiting the number of terminals in the genetic programming implementation.

[1]  Erick Cantú-Paz,et al.  On Random Numbers and the Performance of Genetic Algorithms , 2002, GECCO.

[2]  Simon Y. Foo,et al.  Evolving ant colony systems in hardware for random number generation , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[3]  George Marsaglia,et al.  Random Number Generators , 2003 .

[4]  Xin Yao,et al.  Automatic Discovery of Protein Motifs Using Genetic Programming , 2004 .

[5]  James A. Foster,et al.  How Random Generator Quality Impacts GA Performance , 2002, GECCO.

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

[7]  Marco Tomassini,et al.  Generating Parallel Random Number Generators By Cellular Programming , 1996 .

[8]  Marco Tomassini,et al.  Co-evolving Parallel Random Number Generators , 1996, PPSN.

[9]  Richard J. Carter,et al.  FPGA implementation of neighborhood-of-four cellular automata random number generators , 2002, FPGA '02.

[10]  A. Kolmogorov.  Three approaches to the quantitative definition of information , 1968 .

[11]  John R. Koza,et al.  Automated synthesis of analog electrical circuits by means of genetic programming , 1997, IEEE Trans. Evol. Comput..

[12]  Réjane Forré,et al.  The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition , 1988, CRYPTO.

[13]  Steven Guan,et al.  An evolutionary approach to the design of controllable cellular automata structure for random number generation , 2003, IEEE Trans. Evol. Comput..

[14]  James A. Foster,et al.  The Quality of Pseudo-Random Number Generations and Simple Genetic Algorithm Performance , 1997, ICGA.

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

[16]  John R. Koza,et al.  Evolving a Computer Program to Generate Random Numbers Using the Genetic Programming Paradigm , 1991, ICGA.

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

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

[19]  James A. Foster,et al.  A Genetic Algorithm-specific Test Of Random Generator Quality , 2002, GECCO.

[20]  Roger M. Needham,et al.  TEA, a Tiny Encryption Algorithm , 1994, FSE.

[21]  José María Sierra,et al.  Finding near optimal parameters for Linear Congruential pseudorandom number generators by means of evolutionary computation , 2001 .

[22]  Vidroha Debroy,et al.  Genetic Programming , 1998, Lecture Notes in Computer Science.

[23]  I. Vattulainen,et al.  Mission Impossible: Find a Random Pseudorandom Number Generator , 1995 .

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