Non-linear and Non-group Cellular Automata for Cryptographic Applications

摘要

The current study outlines the behavior of nonlinear and non-group cellular automata (N2CA), having periodic boundary conditions. We find CA having enough length, and extract particular states from the CA based on some properties, I.e., Hamming distance, frequency, and run-up and run-down. The extracted states can be efficiently used for cryptographic applications which demand many hash functions at one time such as one-time password scheme.