Analysis of 2-State, 3-Neighborhood Cellular Automata Rules for Cryptographic Pseudorandom Number Generation

The security of most cryptography systems is dependenton the secret key generators or pseudorandom number generators (PRNGs). PRNGs based on cellular automata (CA)have been studied and recommended by many researchersover the last decade. In this paper, we perform on analysisof 2-state, 3-neighborhood CA rules. In order to calculatethe probability of the CA rules, they were classified into different sets using logic combinations and various definitions of CA. The binomial probability of these sets are calculated using the properties of logic combination. As a result, we found three sets that have a high quality of randomness. In order to prove the high quality of randomness of these sets, the following experimental results on quality of randomness using the DIEHARD test suite are presented.