• 투고 : 2015.12.09
  • 심사 : 2016.03.04
  • 발행 : 2016.05.30


In recent years, CA has been applied to image security due to its simple and regular structure, local interaction and random-like behavior. Since the initial state is regenerated after some iterations in the group CA, the receiver is able to decrypt by the same CA. Pries et al. showed that the all lengths of the cycles in the complemented group CA C with rules 195, 153, and 51 are equal to the order of C. Nandi et al. reported the encryption technique using C. These results can be made efficient use in cryptosystem by expanding the Nandi's key space. In this paper, we analyze the order of the complemented group CA derived from 90=150 group CA and show that all the lengths of the cycles in the complemented CA are equal to the order of the complemented CA.


Cellular Automata;complement vector;order;complemented group CA;length of cycle


  1. S.J. Cho, U.S. Choi, H.D. Kim, Y.H. Hwang, J.G. Kim and S.H. Heo, New synthesis of one-dimensional 90/150 linear hybrid group cellular automata, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 26 (2007), 1720-1724.
  2. A.A. Abdo, S. Lian, I.A. Ismail, M. Amin and H. Diab, A cryptosystem based on elementary cellular automata, Communications in Nonlinear Science and Numerical Simulation 18 (2013), 136-147.
  3. U.S. Choi, S.J. Cho and G.T. Kong, Analysis of characteristic polynomial of cellular automata with symmetrical transition rules, Proc. Jangjeon Math. Soc. 18 (2015), 85-93.
  4. S.J. Cho, U.S. Choi, H.D. Kim, Y.H. Hwang and J.G. Kim, Analysis of 90=150 two predecessor nongroup cellular automata, In Cellular Automata, Springer Berlin Heidelberg (2008), 128-135.
  5. A.K. Das, Additive Cellular Automata: Theory and Application as a Built-in Self-Test Structure, Ph.D. Thesis, I.I.T., 1990.
  6. S. Nandi, S. Roy, S. Nath, S. Chakraborty, W. Ben Abdessalem Karaa and N. Dey, 1-D Group Cellular Automata based Image Encryption Technique, In Control, Instrumentation, Communication and Computational Technologies (ICCICCT), 2014 IEEE International Conference (2014), 521-526.
  7. G.A. Hedlund, Endomorphisms and automorphisms of the shift dynamical system, Theory of Computing Systems 3 (1969), 320-375.
  8. J. Jin, An image encryption based on elementary cellular automata, Optics and Lasers in Engineering 50 (2012), 1836-1843.
  9. S. Nandi, B.K. Kar and P.P. Chaudhuri, Theory and Applications of Cellular Automata in Cryptography, IEEE Transactions on Computers 43 (1994), 1346-1357.
  10. J.V. Neumann, Theory of self-reproducing automata, University of Illinois, Urbana, 1966.
  11. W. Pries, A. Thanailakis and H.C. Card, Group properties of Cellular Automata and VLSI Applications, IEEE Transactions on Computers 100 (1986), 1013-1024.
  12. M. Serra, T. Slater, J.C. Muzio and D.M. Miller, The analysis of one-dimensional linear cellular automata and their aliasing properties, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 9 (1990), 767-778.
  13. S. Ulam, Random processes and transformations, Proceedings of the International Congress on Mathematics 2 (1952), 264-275.
  14. S. Wolfram, Statistical mechanics of cellular automata, Reviews of modern physics 55 (1983), 601-644.