Random number generation using decimal cellular automata

This paper illustrates the potentiality of decimal CAs as source of pseudo-randomness. Some desirable properties for a CA to be a good source of pseudo-randomness are identified. As the rule space is huge, greedy strategies are taken to select CAs satisfying these properties. Finally, two heuristic algorithms are given to synthesize such CAs. As application of pseudo-randomness, two schemes are reported to develop pseudo-random number generators (PRNGs) using these CAs. To generate a number from a configuration, we have used the concept of window. It is observed that, our PRNGs are at least as good as the best known PRNGs existing in literature.