Abstract
This paper addresses a symmetric key cryptosystem using rule 57 asynchronous cellular automata. It is experimentally shown that the proposed cryptosystem achieves the avalanche effect after 32000 iterations. The vulnerability of the proposed scheme is discussed and note that, brute-force attack is practically infeasible. The effectiveness of the scheme is compared with other cryptosystems and finally, it is also report that the proposed cryptosystem can easily be implemented in hardware.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
von Neumann, J.: The Theory of Self-reproducing Automata. University of Illinois Press, Urbana and London (1966). Edited by Burks, A.W
Bao, F.: Cryptanalysis of a new cellular automata cryptosystem. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol. 2727, pp. 416–427. Springer, Heidelberg (2003)
Kari, J.: Cryptosystems based on reversible cellular automata (1992, preprint)
Fatès, N., Thierry, E., Morvan, M., Schabanel, N.: Fully asynchronous behavior of double-quiescent elementary cellular automata. Theor. Comput. Sci. 362, 1–16 (2006)
Wolfram, S.: Theory and Applications of Cellular Automata. World Scientific, Singapore (1986)
Sethi, B., Roy, S., Das, S.: Asynchronous cellular automata and pattern classification. Complexity (2016). doi:10.1002/cplx.21749
Mahajan, P., Sachdeva, A.: A study of encryption algorithms AES, DES and RSA for security. Comput. Sci. & Tech. Netw. Web Secur. 13, 15–22 (2013)
Sethi, B., Fatès, N., Das, S.: Reversibility of elementary cellular automata under fully asynchronous update. In: Gopal, T.V., Agrawal, M., Li, A., Cooper, S.B. (eds.) TAMC 2014. LNCS, vol. 8402, pp. 39–49. Springer, Heidelberg (2014)
Kari, J.: Reversible cellular automata. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 57–68. Springer, Heidelberg (2005)
Sarkar, A., Mukherjee, A., Das, S.: Reversibility in asynchronous cellular automata. Complex Syst. 21, 71–84 (2012)
Feistel, H.: Cryptography and computer privacy. Sci. Am. 228, 15–23 (1973)
Shannon, C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28, 656–715 (1949)
Das, S., Sarkar, A., Sikdar, B.K.: Synthesis of reversible asynchronous cellular automata for pattern generation with specific hamming distance. In: Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2012. LNCS, vol. 7495, pp. 643–652. Springer, Heidelberg (2012)
Karimi, H., Hosseni, S.M., Jahan, M.V.: On the combination of self-organized systems to generate pseudo-random numbers. Inf. Sci. 221, 371–388 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Sethi, B., Das, S. (2016). On the Use of Asynchronous Cellular Automata in Symmetric-Key Cryptography. In: Mueller, P., Thampi, S., Alam Bhuiyan, M., Ko, R., Doss, R., Alcaraz Calero, J. (eds) Security in Computing and Communications. SSCC 2016. Communications in Computer and Information Science, vol 625. Springer, Singapore. https://doi.org/10.1007/978-981-10-2738-3_3
Download citation
DOI: https://doi.org/10.1007/978-981-10-2738-3_3
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-2737-6
Online ISBN: 978-981-10-2738-3
eBook Packages: Computer ScienceComputer Science (R0)