Hernández, Julio C.Seznec, AndréIsasi, Pedro2009-04-202009-04-202004-06Congress on Evolutionary Computation, 2004 : CEC2004. Vol.2 , p. 1510-15160-7803-8515-2https://hdl.handle.net/10016/4021Congress on Evolutionary Computation. Portland, EEUU, 19-23 June 2004The 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.application/pdfeng© IEEEconference paperInformática10.1109/CEC.2004.1331075open access15101516Congress on Evolutionary Computation, 2004 : CEC20042