A Scheme for Symmetric Cryptosystem Using Large Cycle Reversible Cellular Automata

In this paper, we expand upon Cipher Block Chaining (CBC), and explore large cycle reversible non-uniform cellular automata for secure encryption and decryption. Both our encryption and decryption algorithms have an O(n) time complexity. We have conducted statistical tests like NIST, dieharder, and smallCrush to prove its robustness, along with brute force attacks and strict avalanche criterion (SAC) to further test its security. Analysis for known plaintext attack and chosen plaintext attack shows that neither of the attacks are feasible. Lastly, a visual test is conducted to further show the aparant randomness of the ciphertexts.