Lamar: A new pseudorandom number generator evolved by means of genetic programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4193 LNCS, Issue , 2006, Pages 850-859

  Lamenca Martinez, Carlos ^a   Hernandez Castro, Julio Cesar ^a   Estevez Tapiador, Juan M ^a   Ribagorda, Arturo ^a  

^a UNIVERSIDAD CARLOS III DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; CRYPTOGRAPHY; RANDOM NUMBER GENERATION;

CRYPTOGRAPHIC APPLICATIONS; PSEUDORANDOM NUMBER GENERATORS (PRNGS); SECURITY ANALYSIS;

ALGORITHMS;

EID: 33750257910     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11844297_86     Document Type: Conference Paper

References (32)

1. The lil-gp GP system, http://garage.cps.msu.edu/software/lil-gp/.
2. F. Bao. Cryptanalysis of a partially known cellular automata cryptosystem. IEEE Trans. on Computers, 53(11):1493-1497, 2004.
3. E. Cantú-Paz. On random numbers and the performance of genetic algorithms. In Proc. of GECCO'02, volume 2, pages 311-318. Morgan Kaufmann, 2002.
4. R. Forré. The strict avalanche criterion: Spectral properties of boolean functions and an extended definition. In Proc. of CRYPTO'88, LNCS, pages 450-468. Springer-Verlag, 1990.
5. J.C. Hernandez-Castro, P. Isasi, and A. Seznec. On the design of state-of-the-art PRNGs by means of genetic programming. In Proc. of the IEEE CEC'04, pages 1510-1516. IEEE Press, 2004.
6. J.C. Hernandez-Castro, A. Ribagorda, P. Isasi, and J.M. Sierra. Finding near optimal parameters for linear congruential PRNGs by means of evolutionary computation. In Proc. of GECCO'01, pages 1292-1298. Morgan Kaufmann, 2001.
7. G. Hinton et al. The microarchitecture of the pentium 4 processor. Intel Technology Journal Q1, 2001.
8. S. Hirose and S. Yoshida. A one-way hash function based on a two-dimensional cellular automaton. In Proc. of the 20th Symposium on Information Theory and its Applications, volume 1, pages 213-216. Matsuyama, 1997.
9. B.C. Johnson. Radix-b extensions to some common empirical tests for PRNGs. ACM Trans. on Modeling and Comp. Sim., 6(4):261-273, 1996.
10. I. Kanter, W. Kinzel, and E. Kanter. Secure exchange of information by synchronization of neural networks. Europhysical Letters, 57(141), 2002.
11. D.E. Knuth. The Art of Computer Programming, Volume 2: Seminumerical Algorithms. Addison-Wesley, 3rd edition, 1998.
12. J.R. Koza. Evolving a computer program to generate random number using the genetic programming paradigm. In Proc. of the 4th Int. Conference on Genetic Algorithms, pages 37-44. Morgan Kaufmann, 1991.
13. G. Marsaglia. Yet another RNG. Posted to sei.stat.math, 1994.
14. G. Marsaglia. The Marsaglia Random Number CDROM Including the DIEHARD Battery of Tests of Randomness. http://stat.fsu.edu/pub/diehard, 1996.
15. G. Marsaglia and W.W. Tsang. Some difficult-to-pass tests of randomness. Journal of Statistical Software, 7(3), 2002.
16. M. Matsumoto and Y. Kurita. Twisted GFSR generators. ACM Trans. on Modeling and Comp. Sim., 2(3):179-194, 1992.
17. M. Matsumoto et al. Mersenne twister: A 623-dimensionally equidistributed uniform PRNG. ACM Trans. on Modeling and Comp. Sim., 8(1):3-30, 1998.
18. M.M. Meysenburg and J.A. Foster. The quality of PRNGs and simple genetic algorithm performance. In Proc. of the 7th Int. Conference on Genetic Algorithms, pages 276-281. Morgan Kaufmann, 1997.
19. M.M. Meysenburg and J.A. Foster. Randomness and GA performance, revisited. In Proc. of GECCO'99, volume 1, pages 425-432. Morgan Kaufmann, 1999.
20. M. Mihaljevic, Y. Zheng, and H. Imai. A cellular automaton based fast one-way hash function suitable for hardware implementation, volume 1431 of LNCS, pages 217-233. Springer-Verlag, 1998.
21. M.J. Mihaljevic. An improved key stream generator based on the programmable cellular automata. In Proc. of ICICS'97, volume 1334 of LNCS, pages 181-191. Springer-Verlag, 1997.
22. W. Millan, A. Clark, and E. Dawson. An effective genetic algorithm for finding boolean functions. In Proc. of ICICS'97, 1997.
23. W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery. Numerical Recipes in C. Cambridge University Press, 2nd edition, 1992.
24. R.L. Rivest, M.J.B. Robshaw, R. Sidney, and Y.L. Yin. The RC6 block cipher, v1.1, August 20 1998.
25. A. Rukhin et al. A statistical test suite for random and pseudorandom number generators for cryptographic applications. NIST special publication 800-22, http://csrc.nist.gov/rng/, 2001.
26. B. Schneier. Applied Cryptography. John Wiley and Sons, 1994.
27. M. Seredynski and P. Bouvry. Block cipher based on reversible cellular automata. Next Generation Computing Journal, 23(3):245-258, 2005.
28. M. Sipper and M Tomassini. Generating parallel random number generators by cellular programming. Int. Journal of Modern Physics C, pages 181-190, 1996.
29. S. Tezuka and P. L'Ecuyer. Efficient and portable combined Tausworthe Random Number Generators. ACM Trans. on Modeling and Comp. Sim., 1(2):99-112, 1991.
30. J. Walker. ENT Randomness Tests, http://www.fourmilab.ch/random/, 1998.
31. S. Wolfram. Random sequence generation by cellular automata. Advances in Applied Mathematics, 7:123-169, 1986.
32. M.E. Yalcin, J.A.K. Suykens, and J. Vandewalle. True random bit generation from a double-scroll attractor. IEEE Trans. on Circuits and Systems-I: Regular Papers, 51(7):1395-1404, 2004.