Hybrid Cryptosystem Using Cellular Automata Transformations on Graphs

Digital security has become a prime area of research as large amount of data is shared over the internet and variety of agents are getting connected. The need to develop systems to reduce the tradeoff between the security, space and time is never ending. Graphs are known for their versatility in applications and cellular automata for their agility to provide speed and complexity to the process. It is against this backdrop an attempt is made to demonstrate a new hybrid cryptosystem using the properties of cellular automata transformation on graphs. The method also combines public and private key encryption processes to provide flexibility and strength.