2016 |
Volume 4 |
Issue 2
Hybrid Cryptosystem using Cellular Automata Transformations on Graphs
1.
M. Phani Krishna Kishore
– Dept.ofi.t.,gayatri Vidya Parishad College Of Engg(a),madhurawada,visakhapatnam,andhra Pradesh,india
2.
Sunayana Budhiraju
– Dept.ofi.t.,gayatri Vidya Parishad College Of Engg(a),madhurawada,visakhapatnam,andhra Pradesh,india
Received
23-Mar-2017
|
Accepted
-
|
Published
23-Mar-2017
|
Abstract
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 trade-off 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.
Keywords Cellular Automata, Graphs, Cryptosystems, Information Security
Locked
Subscribed
Open Access
