Advertisement

A Cryptosystem Based on the Composition of Reversible Cellular Automata

  • Adam Clarridge
  • Kai Salomaa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5457)

Abstract

We present conditions which guarantee that a composition of marker cellular automata has the same neighbourhood as each of the individual components. We show that, under certain technical assumptions, a marker cellular automaton has a unique inverse with a given neighbourhood. We use these results to develop a working key generation algorithm for a public-key cryptosystem based on reversible cellular automata originally conceived by Kari. We conclude with a discussion on security and practical considerations for the cryptosystem and give several ideas for future work.

Keywords

Cellular Automaton Cellular Automaton Neighbourhood Size Brute Force Attack Order Neighbourhood 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Tao, R., Chen, S.: On finite automaton public-key cryptosystem. Theoretical Computer Science 226(1-2), 143–172 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Charbouillot, S., Perez, A., Fronte, D.: A programmable hardware cellular automaton: Example of data flow transformation. In: 13th IEEE International Conference on Electronics, Circuits and Systems, pp. 1232–1235 (2006)Google Scholar
  3. 3.
    Franti, E., Slav, C., Balan, T., Dascalu, M.: Design of cellular automata hardware for cryptographic applications. In: CAS 2004 Int. Semiconductor Conference, vol. 2, pp. 463–466 (2004)Google Scholar
  4. 4.
    Zheng, Y., Imai, H.: A cellular automaton based fast one-way hash function suitable for hardware implementation. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol. 1431, pp. 217–234. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  5. 5.
    Anghelescu, P., Ionita, S., Sofron, E.: Block encryption using hybrid additive cellular automata. In: HIS 2007: Proceedings of the 7th International Conference on Hybrid Intelligent Systems, Washington, DC, USA, pp. 132–137. IEEE Computer Society, Los Alamitos (2007)Google Scholar
  6. 6.
    Gutowitz, H.: Cryptography with dynamical systems. In: Goles, E., Boccara, N. (eds.) Cellular Automata and Cooperative Phenomena, pp. 237–274 (1993)Google Scholar
  7. 7.
    Gutowitz, H.: Method and apparatus for encryption, decryption, and authentication using dynamical systems. U.S. Patent 5365589 (1994)Google Scholar
  8. 8.
    Seredynski, M., Bouvry, P.: Block cipher based on reversible cellular automata. Congress on Evolutionary Computation 2, 2138–2143 (2004)zbMATHGoogle Scholar
  9. 9.
    Srebrny, M., Such, P.: Encryption using two-dimensional cellular automata with applications. Artificial intelligence and Security in Computing Systems, 203–215 (2003)Google Scholar
  10. 10.
    Wolfram, S.: Random sequence generation by cellular automata. Advances in Applied Mathematics 7(2), 163–169 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Kari, J.: Cryptosystems based on reversible cellular automata (manuscript, 1992)Google Scholar
  12. 12.
    Amoroso, S., Patt, Y.: Decision procedures for surjectivity and injectivity of parallel maps for tesselation structures. J. Comput. System Sci. 6, 448–464 (1972)CrossRefzbMATHGoogle Scholar
  13. 13.
    Kari, J.: Reversibility and surjectivity problems of cellular automata. J. Comput. System Sci. 48, 149–182 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Ashley, J.: Marker automorphisms of the one-sided d-shift. Ergodic Theory Dynam. Systems 10(2), 247–262 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Clarridge, A., Salomaa, K.: A cryptosystem based on the composition of reversible cellular automata. Technical Report 2008-549, Queen’s University, School of Computing (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Adam Clarridge
    • 1
  • Kai Salomaa
    • 1
  1. 1.Queen’s UniversityKingstonCanada

Personalised recommendations