Temporally Non-Uniform Cellular Automata as Pseudo-random Number Generator

In this work, we use Temporally Non-Uniform Cellular Automaton (t-NUCA) where, two rules are used temporally. That is, there exists a rule sequence, which specify the behavior of a t-NUCA. We explore the dynamics of t-NUCAs for different rule sequences and observe the dynamical behavior of each t-NUCA. In addition to that, the t-NUCAs which have no non-reachable configurations are detected. Among them, we identify a set of t-NUCAs which are surjective and chaotic in nature. We show that such t-NUCAs can be used to develop a pseudo-random number generator (PRNG).