This Article 
 Bibliographic References 
 Add to: 
Cryptanalysis of a Partially Known Cellular Automata Cryptosystem
November 2004 (vol. 53 no. 11)
pp. 1493-1497
Cellular automata provide simple discrete deterministic mathematical models for physical, biological, and computational systems. Despite their simple construction, cellular automata are shown to be capable of complicated behavior 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. In ICICS'02, Sen et al. made a new effort in cellular automata cryptosystems (CACs) design, where the affine cellular automata are combined with nonaffine transformations. It is claimed that the weakness in some of the previous CACs due to the 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.

[1] S.R. Blackburn, S. Murphy, and K.G. Paterson, "Comment on 'Theory and Application of Cellular Automata in Cryptography,'" IEEE Trans. Computers, vol. 46, no., pp., 1997.
[2] E. Biham and A. Shamir, Differential Cryptanalysi of DES-Like Cryptosystems J. Cryptology, vol. 4, no. 1, pp. 3-72, 1991.
[3] M. Creutz, Deterministic Ising Dynamics Annals of Physics, vol. 167, no. 62, 1986.
[4] N. Ganguly, A. Das, B. Sikdar, and P. Chaudhuri, Cellular Automota Model for Cryptosystem Proc. Cellular Automata Conf., 2000.
[5] P. Guan, Cellular Automata Public Key Cryptosystem Complex System, vol. 1, pp. 51-57, 1987.
[6] S. Kirkpatrick et al., Global Optimization by Simulated Annealing Science, vol. 220, no. 671, 1986.
[7] S. Nandi, B.K. Kar, and P. Pal Chaudhuri, "Theory and Application of Cellular Automata in Cryptography," IEEE Trans. Computers, vol. 43, no. 12, pp. 1,346-1,357, Dec. 1994.
[8] Y. Pomeau, Invariant in Cellular Automata J. Physics, A17 L415, 1984.
[9] S. Sen, C. Shaw, R. Chowdhuri, N. Ganguly, and P. Chaudhuri, Cellular Automata Based Cryptosystem (CAC) Proc. Fourth Int'l Conf. Information and Comm. Security (ICICS02), pp. 303-314, Dec. 2002.
[10] S. Wolfram, Cellular Automata as Models of Complexity Nature, vol. 311, no. 419, 1984.
[11] S. Wolfram, Cryptography with Cellular Automata Proc. Advances in Cryptology (Crypto '85), pp. 429-432, 1986.
[12] S. Wolfram, Origins of Randomness in Physical Systems Physics Rev. Letters, vol. 55, no. 449m 1985,
[13] S. Wolfram, Random Sequence Generation by Cellular Automata Advances in Applied Math., vol. 7, no. 123, 1986.
[14] gov/CryptoToolkit/aesrijndael/, 2000.

Index Terms:
Cellular automata, encryption, cryptanalysis, chosen-plaintext attack.
Feng Bao, "Cryptanalysis of a Partially Known Cellular Automata Cryptosystem," IEEE Transactions on Computers, vol. 53, no. 11, pp. 1493-1497, Nov. 2004, doi:10.1109/TC.2004.94
Usage of this product signifies your acceptance of the Terms of Use.