Refine your search
Collections
Co-Authors
Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Budhiraju, Sunayana
- Hybrid Cryptosystem Using Cellular Automata Transformations on Graphs
Abstract Views :211 |
PDF Views:0
Authors
Affiliations
1 Department of Information Technology, Gayatri Vidya Parishad College of Engineering(A), Madhurawada, Visakhapatnam, Andhra Pradesh, IN
1 Department of Information Technology, Gayatri Vidya Parishad College of Engineering(A), Madhurawada, Visakhapatnam, Andhra Pradesh, IN
Source
Journal of Network and Information Security, Vol 4, No 2 (2016), Pagination: 11-18Abstract
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.Keywords
Cellular Automata, Graphs, Cryptosystems, Information Security.
References
- Guan, P. (1987). Cellular automaton public-key cryptosystem. Complex Systems 1, (pp. 51-56).
- Wolfram, S. (2002). A New Kind of Science. Wolfram Media, Inc., (pp. 884-885).
- Wolfram, S. (1986). Cryptography with cellular automata. In Advances in Cryptology: Crypto 85-344 Proceedings, LNCS 218, Springer, (pp. 429-432).
- Nandi, S., Kar, B. K., & Chaudhuri, P. P. (1994). Theory and applications of cellular automata in cryptography. IEEE Transactions on Computers, 43, (pp. 1346-1357).
- Bozapalidis, S., & Kalampakas, A. (2008). Graph automata. Theoretical Computer Science, 393(1-3), 147-165.
- Priyadarsini, P. L. K., & Ayyagari, R. (2013). Cihpers based on Special Graphs. Proceedings of the 2013 International Conference on Advances in Computing, Communications and Informatics (ICACCI), (pp 460- 465).
- Sutner, K. (1988). Additive automata on graphs. Complex Systems, 2(6), 649-661.
- Marr, C., & Hutt, M. T. (2012). Cellular automata on Graphs: Topological properties of ER graphs evolved towards low-entropy dynamics. Entropy, 14, 993-1010.
- Kocarev, L., Makraduli, J., & Amato, P. (2005). Public Key Encryption based on Chebyshev Polynomials. Circuits Systems Signal Processing, 24(5), 497-517.
- Georgiadis, E. (2007). A note on minimal boolean formula size of one-dimensional cellular automata.
- Journal of Cellular Automata, 4(2), 1-4.
- Bergamo, P., D’Arco, P., De Santis, A., & Kocarev, L. (2005). Security of Public-Key Cryptosystems based on Chebyshev Polynomials. IEEE Transactions on Circuits and Systems-I, July, 52(7), 1382-1393.