This paper deals with the problem of generating high quality random number sequences for cryptography. A new class of CA, the Self Programmable Cellular Automata (SPCA) is proposed. Experimental results showed the sequences generated performed well in the ENT and DIEHARD test suites; comparable to the results obtained by other researchers. Furthermore, the SPCA has implementation space savings over other similar variants of CA. The SPCA uses only Boolean operations hence it is ideally suitable for VLSI hardware implementation.
CITATION STYLE
Guan, S. U., & Tan, S. K. (2003). Pseudorandom number generator - The Self Programmable Cellular Automata. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2773 PART 1, pp. 1230–1235). Springer Verlag. https://doi.org/10.1007/978-3-540-45224-9_166
Mendeley helps you to discover research relevant for your work.