Application of Cellular Automata for an Efficient Symmetric Key Cryptosystem

Abstract

Cryptography plays an important role in computer security. Encryption, decryption and key generation are the main algorithms of any cryptosystem. Encryption and decryption algorithm include methods based on substitution, mono-alphabetic or poly-alphabetic, Vigenere cipher, DES, AES etc. The duration of time taken, for the encryption and decryption, without the key being broken, define the strength of the cryptosystem. To strengthen these aspect cellular automata plays an important role in cryptography. In this paper, an enhanced symmetric key encryption and decryption algorithm accompanied with cellular automata will be discussed A class of cellular automata (CA) such as CA rule 32 and CA rule 2 accompanied with XOR operation used for more promising security to cryptography.