Non-linear and non-group cellular automata chaining technique for cryptographic applications

The current study outlines the behavior of non-linear and non-group cellular automata having periodic boundary conditions. We find a CA having enough unique states which is called a 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 alternatively used for cryptographic applications which demand integrity and authentication of identities such as a one-time password scheme.