Pseudorandom number generation based on controllable cellular automata

Future Generation Computer Systems

Volumn 20, Issue 4, 2004, Pages 627-641

  Guan, Sheng Uei ^a   Zhang, Shu ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Cellular automata; Controllable; Hybrid; Pseudorandom number generator; Randomness test

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; COST EFFECTIVENESS; EFFICIENCY; FEEDBACK; HYBRID COMPUTERS; RANDOM NUMBER GENERATION; THEOREM PROVING;

CELLULAR AUTOMATA; CONTROLLABLE; HYBRID; PSEUDORANDOM NUMBER GENERATORS; RANDOMNESS TESTS;

AUTOMATA THEORY;

EID: 1842588903     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-739X(03)00128-6     Document Type: Conference Paper

References (20)

1. D.E. Knuth, The Art of Computer Programming, vol. 2, Seminumerical Algorithms, 3rd ed., Addison-Wesley, Reading, MA, 1998.
2. De la Guaz-Martinez, A. Fuster-Sabater, Cryptographic design based on cellular automata, in: Proceedings of the 1997 IEEE International Symposium on Information Theory, 1997, p. 180.
3. Chowdhury D.R., Gupta I.S., Pal Chaudhuri P. A class of two-dimensional cellular automata and applications in random pattern testing. J. Electrical Test.: Theory Appl. 5:1994;65-80.
4. G. Marsaglia, Diehard, 1998. http://stat.fsu.edu/~geo/diehard.html.
5. Kokolakis I., Andreadis I., Tsalids Ph. Comparison between cellular automata and linear feedback shift registers based pseudo-random number generators. Microprocess. Microsyst. 20:1997;643-658.
6. Matsumoto M. Simple cellular automata as pseudorandom m-sequence generators for built-in self-test. ACM Trans. Model. Comput. Simul. 8(1):1998;31-42.
7. M. Mihaljevic, Security examination of a cellular automata based pseudorandom bit generator using an algebraic replica approach, in: Proceedings of the Conference on Applied Algebra, Algorithms and Error Correcting Codes, Lecture notes in Computer Science, vol. 1255, 1997, pp. 250-262.
8. Mihaljevic M., Imai H. A family of fast keystream generators based on programmable linear cellular automata over GF(q) and time-variant table. IEICE Trans. Fund. E82-A(1):1999;32-39.
9. Tomassini M., Sipper M., Zolla M., Perrenoud M. Generating high-quality random numbers in parallel by cellular automata. Future Gener. Comput. Syst. 16:1999;291-305.
10. Tomassini M., Sipper M., Perrenoud M. On the generation of high-quality random numbers by two-dimensional cellular automata. IEEE Trans. Comput. 49:2000;1146-1151.
11. Sipper M., Tomassini M. Generating parallel random number generators by cellular programming. Int. J. Mod. Phys. 7(2):1996;181-190.
12. Hortensius P.D., Mcleod R.D., Card H.C. Parallel random number generation for VLSI system using cellular automata. IEEE Trans. Comput. 38:1989;1466-1473.
13. Hortensius P.D., Mcleod R.D., Pries W., Michael Miller D., Card H.C. Cellular automata-based pseudorandom number generators for built-in self-test. IEEE Trans. Comput. Aided Des. 8(8):1989;842-859.
14. P.P. Chaudhuri, D.R. Chowdhury, S. Nandi, S. Chattopadhyay, Additive Cellular Automata: Theory and Applications, vol. 1, IEEE CS Press, Los Alamitos, CA, 1997.
15. Sarkar P. A brief history of cellular automata. ACM Comput. Surv. 32(1):2000;80-107.
16. P.H. Bardell, Analysis of cellular automata used as pseudorandom pattern generators, in: Proceedings of the International Test Conference, 1990, pp. 762-768.
17. Nandi S., Kar B.K., Pal Chaudhuri P. Theory and applications of cellular automata in cryptography. IEEE Trans. Comput. 43:1994;1346-1357.
18. S. Wolfram, Cryptography with cellular automata, in: Proceedings of the Conference, CRTPTO'85 on Advances in Cryptography, Lecture Notes in Computer Science, vol. 218, 1985, pp. 429-432.
19. S. Wolfram, Theory and Applications of Cellular Automata: Including Selected Papers 1983-1986, World Scientific, River Edge, NJ, 1986.
20. ENT test suite. http://www.fourmilab.ch/random.