Abstract
Cellular automata provide discrete deterministic mathematical models for physical, biological and computational systems. Despite their simple construction, cellular automata are shown to be capable of complicated behaviour, and to generate complex and random patterns. There have been constant efforts to exploit cellular automata for cryptography since the very beginning of the research on cellular automata. Unfortunately, most of the previous cryptosystems based on cellular automata are either insecure or inefficient. [8] is the latest effort in cellular automata cryptosystems (CACs) design, where the affine cellular automata are combined with non-affine transformations. It is claimed that the weakness in some of the previous CACs due to affine property is removed. In this paper we show that the new CAC is still insecure. It can be broken by a chosen-plaintext attack. The attack is very efficient, requiring only hundreds of chosen plaintexts and a small computation amount. We also consider the possibility of modifying the new CAC. Our results show, however, that it is not easy to secure the scheme by minor modifications. The cryptanalysis in this paper enforces the opinion once more that the security must be very carefully analyzed in designing the cryptosystems based on some mathematical systems. We should not blindly trust the pseudo randomness brought by the available mathematical systems. The designing techniques developed by cryptographic community are always optimal.
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
S. Blackburn, S. Merphy, and K. Paterson, “Comments on’ theory and applications of cellular automata in cryptography’”, IEEE Transactions on Computers, Vol. 46, No. 5, pp. 637–638, May 1997.
M. Creutz, “Deterministic Ising dynamics”, Annals of Physics Vol. 167, No. 62, 1986.
N. Ganguly, A. Das, B. Sikdar, and P. Chaudhuri, “Cellular automota model for cryptosystem”, Cellular Automata Conference, Yokoham University, Japan, 2000.
P. Guan, “Cellular automata public key cryptosystem”, Complex System Vol. 1, pp. 51–57, 1987.
S. Kirkpatrick et al., “Global optimization by simulated annealing”, Science Vol. 220, No. 671, 1986.
S. Nandi, B. Kar, and P. Chaudhuri, “Theory and applications of cellular automata in cryptography”, IEEE Transactions on Computers, Vol. 43, No. 12, pp. 1346–1357, Dec 1994.
Y. Pomeau, “Invariant in cellular automata”, Journal of Physics A17 (1984) L415.
S. Sen, C. Shaw, R. Chowdhuri, N. Ganguly, and P. Chaudhuri, “Cellualr automata based cryptosystem (CAC)”, Proceedings of the 4th International Conference on Information and Communications Security (ICICS02), LNCS 2513, pp. 303–314, Dec 2002.
S. Wolfram, “Cellular automata as models of complexity”, Nature Vol. 311, No. 419, 1984.
S. Wolfram, “Cryptography with cellular automata”, Proceedings of Advances in Cryptology-Crypto’85, Lecture Notes in Computer Science 218, pp. 429–432, 1986.
S. Wolfram, “Origins of randomness in physical systems”, Phys. Rev. Lett. Vol. 55, No. 449, 1985.
S. Wolfram, “Random sequence generation by cellular automata”, Advances in Applied Mathematics Vol. 7, No. 123, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bao, F. (2003). Cryptanalysis of a New Cellular Automata Cryptosystem. In: Safavi-Naini, R., Seberry, J. (eds) Information Security and Privacy. ACISP 2003. Lecture Notes in Computer Science, vol 2727. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45067-X_36
Download citation
DOI: https://doi.org/10.1007/3-540-45067-X_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40515-3
Online ISBN: 978-3-540-45067-2
eBook Packages: Springer Book Archive