Abstract
The main goal of this work is to study the design of message authentication protocols by using cellular automata. Specifically, memory cellular automata with linear transition functions are considered. It is shown that the proposed protocol is secure against different cryptanalytic attacks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Álvarez, G., Hernández, A., Hernández, L., Martín, A.: A secure scheme to share secret color images. Comput. Phys. Comm. 173, 9–16 (2005)
Bao, F.: Cryptanalysis of Partially Known Cellular Automaton Cryptosystem. IEEE Trans. Comput. 53, 1493–1497 (2004)
Biham, E., Shamir, A.: Differential cryptanalysis of DES-like cryptosystems. J. Cryptology 4, 3–72 (1991)
Chaudhuri, P., Chowdhury, D., Nandi, S., Chattopadhyay, S.: Additive cellular automata, vol. 1. IEEE Computer Society Press, Los Alamitos (1997)
Damgard, I.: A design principle for hash functions, Advances in Cryptology: Proc. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 416–427. Springer, Berlin Heidelberg New York (1990)
Dasgupta, P., Chattopadhyay, S., Sengupta, I.: Theory and application of non-group cellular automata for message authentication. Syst. Architecture 47, 383–404 (2001)
Fúster-Sabater, A., de la Guía-Martínez, D.: Cellular automata applications to the linearization of stream cipher generators. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 612–621. Springer, Berlin Heidelberg New York (2004)
Guan, P.: Cellular automaton public-key cryptosystem, Complex Systems 1 (1987) 51–57
Martín, A., Pereira, J., Rodríguez, G.: A secret sharing scheme based on cellular automata. Math. Comput. 170, 1356–1364 (2005)
Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography, CRC Press, Boca Raton, FL (1997)
Mihaljevic, M., Zheng, Y., Imai, H.: A family of fast dedicated one-way hash functions based on linear cellular automata over GF(q). IEICE Trans. Fundamentals E82-A, 40–47 (1999)
Mukherjee, M., Ganguly, N., Chaudhuri, P.P.: Cellular automata based authentication. In: Bandini, S., Chopard, B., Tomassini, M. (eds.) ACRI 2002. LNCS, vol. 2493, pp. 259–269. Springer, Berlin Heidelberg New York (2002)
Nandi, S., Kar, B.K., Chaudhuri, P.P.: Theory and applications of cellular automata in cryptography, IEEE Trans. IEEE Trans. Comput. 43, 1346–1357 (1994)
Seredynski, M., Bouvry, P.: Block encryption using reversible cellular automata. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds.) ACRI 2004. LNCS, vol. 3305, pp. 785–792. Springer, Berlin Heidelberg New York (2004)
Toffoli, T., Margolus, N.: Cellular automata machines. The MIT Press, Cambridge, MA (1987)
von Neumann, J.: Theory of self-reproducing automata ((edited and completed by A.W. Burks)). University of Illinois Press, Illinois (1996)
Wolfram, S.: Cryptography with cellular automata, Advances in Cryptology: Proc. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 429–432. Springer, Berlin Heidelberg New York (1986)
Wolfram, S.: A new kind of science, Wolfram Media, Champaign, Illinois (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
del Rey, A.M. (2007). Message Authentication Protocol Based on Cellular Automata. In: Giacobini, M. (eds) Applications of Evolutionary Computing. EvoWorkshops 2007. Lecture Notes in Computer Science, vol 4448. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71805-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-71805-5_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71804-8
Online ISBN: 978-3-540-71805-5
eBook Packages: Computer ScienceComputer Science (R0)