A Cellular Automata Based Network Security Model
Shiladitya Munshi, Satyabrata Maity · 2011
The current paper presents a symmetric key based network security system where Cellular Automata domain functions have been used for key management purpose. A special class of Cellular Automata referred to as Max Length Cellular Automata has been reported as a potential candidate for such key management. A CA codebook based key generation, encryption and decryption algorithms are presented. The complexity analysis of the session specific security system has been discussed in support of the fact that simple, modular hardware oriented design of CA based security is ideally suited for heavy traffic closed network.