Encryption Based on Reversible Second-Order Cellular Automata

  • Zhenchuan Chai
  • Zhenfu Cao
  • Yuan Zhou
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3759)


In this paper, we present a novel cryptosystem based on reversible second-order cellular automata. The cryptosystem is featured by its large key space and high speed due to cellular automata’s parallel information processing property. Moreover, the encryption and decryption devices share the identical module, which preserves the merit of local connection of cellular automata in both encryption and decryption devices. So the scheme could be implemented in hardware efficiently. We also apply such system in message and image encryption.


Cellular Automaton Block Cipher Image Encryption Local Rule Input Boundary 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Wolfram, S.: Cryptography with cellular automata. In: Advances in Cryptology, pp. 429–432 (1985)Google Scholar
  2. 2.
    Nandi, S., Kar, B.K., Pal, P.C.: Theory and application of cellular automata in cryptography. IEEE Trans. Compu. 43(12), 1346–1356 (1994)CrossRefGoogle Scholar
  3. 3.
    Chang, T., Song, I., et al.: Maximum length cellular automaton sequences and its application. Signal Processing 56, 199–203 (1997)zbMATHCrossRefGoogle Scholar
  4. 4.
    Zomaya, A.Y., Seredynski, F., Bouvry, P.: Secret key cryptography with cellular automata. In: Proc. of the International Parallel and Distributed Processing Symposium (2003)Google Scholar
  5. 5.
    Kari, J.: Cryptosystems based on reversible cellular automata, personal communication (1992)Google Scholar
  6. 6.
    Chuanwu, Z., Qicong, P., Li, Y.: Encryption based on reversible Cellular Automata. In: Communications, Circuits and Systems and West Sino Expositions, IEEE 2002 International Conference, vol. 2, pp. 1223–1226 (2002)Google Scholar
  7. 7.
    Guan, P.: Cellular automaton public key cryptosystems. Complex Syst. 1, 51–56 (1987)zbMATHGoogle Scholar
  8. 8.
    Das, A.K., Ganguly, A., Dasgupta, A., Bhawmik, S., Chaudhri, P.P.: Efficient characterisation of cellular automata. In: IEE Proc., Part E, vol. 37, pp. 81–87 (1990)Google Scholar
  9. 9.
    Toffoli, T., Margolus, N.: Invertible cellular automata: A Review. Physica D 45, 229–253 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Wolffram, S.: Statistical mechanics of cellular automata. Review Modem Phys. 55(3), 601–644 (1983)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Zhenchuan Chai
    • 1
  • Zhenfu Cao
    • 1
  • Yuan Zhou
    • 1
  1. 1.Department of Computer Science and EngineeringShanghai Jiaotong UniversityShanghaiP.R.China

Personalised recommendations