Study of First Degree Cellular Automata for Randomness

This paper discusses the potentiality of Cellular Automata (CAs) represented by first degree equations as source of randomness. These CAs are identified by eight constants, named as Parameters of First Degree CA. A greedy filtering technique is developed that uses existing chaotic parameters to identify the candidate CAs. Based on a theoretical strategy and experimental verification, a list of good first degree CA parameters are identified which remains as excellent source of randomness irrespective of change in number of states. Finally, we use these CAs as pseudo-random number generators.

Automated summary

This paper investigates the potential of Cellular Automata (CAs) represented by first degree equations as a source of randomness. A greedy filtering technique is developed to identify candidate CAs using existing chaotic parameters. Through theoretical strategy and experimental verification, a list of good first degree CA parameters is identified that remain excellent sources of randomness regardless of changes in the number of states. Finally, the CAs are utilized as pseudo-random number generators.