Finding near optimal parameters for Linear Congruential pseudorandom number generators by means of evolutionary computation
暂无分享,去创建一个
Linear Congruential Generators (LCG's) are one model of pseudorandom number generators used in a great number of applications. They strongly depend on, and are completely characterized by, some critical parameters. The selection of good parameters to define a LCG is a difficult task mainly done, nowadays, by consulting tabulated values or by trial and error.
In this work, the authors present a method based on genetic algorithms that can automatically solve the problem of finding good parameters for a LCG. They also show that the selection of an evaluation funtion for the generated solutions is critical to the problem and how a seemingly good function such as entropy could lead to poor results. Finally, other fitness function are proposed and one of them is shown to produce very good results. Some other possibilities and variations that may produce fine linear congruential generators are also mentioned.
[1] S. K. Park,et al. Random number generators: good ones are hard to find , 1988, CACM.
[2] Donald E. Knuth,et al. Deciphering a linear congruential encryption , 1985, IEEE Trans. Inf. Theory.
[3] Joan Boyar,et al. Inferring sequences produced by pseudo-random number generators , 1989, JACM.
[4] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[5] Pierre L'Ecuyer,et al. Efficient and portable combined random number generators , 1988, CACM.