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

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