Application of cellular automata in symmetric key cryptography
Satyabrata Roy, Subrata Nandi, Jayanti Dansana, Prasant Kumar Pattnaik · 2014
This paper presents a symmetric key cryptography technique that uses cellular automata(CA). Proposed cryptosystem has been implemented in C. State transitions of programmable cellular automata (PCA) are the basis to define certain fundamental transformations to encrypt and decrypt in the cryptographic system. Different rule configurations are used to form group cellular automata that would be used in encryption and decryption.