Pseudo Random Number Generator Based on Cellular Automata with Self Organized Criticality

In cryptography, pseudo-random numbers are crucial. The degree of strength of a cryptographic technique is directly influenced by the key’s randomness. Although numerous researchers have shown that cellular automata (CA) are effective as pseudo-random number generators (PRNGs), the fundamental CA structure is being changed to increase the efficiency in terms of randomness. Here, Langton's Ant Model and Programmable Controllable Cellular Automata (PCCA) in combination with a sand pile are proposed. Sand pile model and Langton’s Ant model are built for the generation of Rule control word for the successive iterations and Cell control word in selecting controllable cells for iterations respectively. The Controllable Cellular Automaton types used here are CCA4 and CCA5. Both Sand pile model and Langton’s Ant model exhibit chaotic behaviour. Two different rule sets are used and their results are compared. Also the frequency of each rule in the rule set are determined and found to be equally utilized. Due to the integration of these systems with cellular automata, which likewise display dynamic chaotic behaviour. Its results are greater efficiency in terms of randomness. Pseudo Random number sequence generated by this proposed PCCA is benchmarked with the statistical NIST test. The experiment shows that the resulting random sequence is highly random. Their entropies are calculated and the respective graphs are plotted.