Skip to main content
SpringerLink
Log in

Application of Cellular Automata for Cryptography

  • Conference paper
Parallel Processing and Applied Mathematics (PPAM 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3019))

Abstract

New results concerning application of cellular automata (CAs) to secret key cryptography is described in this paper. One dimensional nonuniform CAs are considered for generating pseudo-random number sequences (PNSs) used in a secret key cryptographic system. The quality of PNSs highly depends on the set of applied CA rules. The search of rules relies on an evolutionary technique called cellular programming. Different rule sizes are considered. As the result of collective behavior of discovered set of CA rules very high quality PNSs are generated. Indeed the quality of PNSs outperforms the quality of known one dimensional CA-based PNS generators used for secret key cryptography. The extended set of CA rules proposed in this article makes the cryptography system much more resistant on attacks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Guan, P.: Cellular Automaton Public-Key Cryptosystem. Complex Systems 1, 51–56 (1987)

    MATH  MathSciNet  Google Scholar 

  2. Gutowitz, H.: Cryptography with Dynamical Systems. In: Goles, E., Boccara, N. (eds.) Cellular Automata and Cooperative Phenomena, Kluwer Academic Press, Dordrecht (1993)

    Google Scholar 

  3. Habutsu, T., Nishio, Y., Sasae, I., Mori, S.: A Secret Key Cryptosystem by Iterating a Chaotic Map. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 127–140. Springer, Heidelberg (1991)

    Google Scholar 

  4. Hortensius, P.D., McLeod, R.D., Card, H.C.: Parallel random number generation for VLSI systems using cellular automata. IEEE Trans. on Computers 38, 1466–1473 (1989)

    Article  Google Scholar 

  5. Kari, J.: Cryptosystems based on reversible cellular automata, personal communication (1992)

    Google Scholar 

  6. Knuth, D.E.: The Art of Computer Programming. Seminumerical Algorithms, vol. 1 & 2. Addison-Wesley, Reading (1981)

    MATH  Google Scholar 

  7. Marsaglia, G.: Diehard (1998), http://stat.fsu.edu/~geo/diehard.html

  8. Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)

    Book  Google Scholar 

  9. Mroczkowski, A.: Application of Cellular Automata in Cryptography, Master Thesis (in Polish), Warsaw University of Technology (2002)

    Google Scholar 

  10. Nandi, S., Kar, B.K., Chaudhuri, P.P.: Theory and Applications of Cellular Automata in Cryptography. IEEE Trans. on Computers 43, 1346–1357 (1994)

    Article  Google Scholar 

  11. National Institute of Standards and Technology, Federal Information Processing Standards Publication 140-2: Security Requirements for Cryptographic Modules, U.S. Government Printing Office, Washington (1999)

    Google Scholar 

  12. Seredynski, F., Bouvry, P., Zomaya, A.Y.: Cellular Programming and Symmetric Key Cryptography Systems. In: Cantu-Paz, E., et al. (eds.) Genetic and Evolutionary Computation-GECCO 2003. LNCS, vol. 2724, pp. 1369–1381. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Schneier, B.: Applied Cryptography. Wiley, New York (1996)

    Google Scholar 

  14. Sipper, M., Tomassini, M.: Generating parallel random number generators by cellular programming. Int. Journal of Modern Physics C 7(2), 181–190 (1996)

    Article  Google Scholar 

  15. Tomassini, M., Perrenoud, M.: Stream Ciphers with One- and Two-Dimensional Cellular Automata. In: Schoenauer, M., et al. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 722–731. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  16. Tomassini, M., Sipper, M.: On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata. IEEE Trans. on Computers 49(10), 1140–1151 (2000)

    Google Scholar 

  17. Wolfram, S.: Cryptography with Cellular Automata. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 429–432. Springer, Heidelberg (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Sciences, Technology and Communication, Luxembourg University, 6, rue Coudenhove Kalergi, L-1359, Luxembourg-Kirchberg, Luxembourg

    Pascal Bouvry

  2. Polish-Japanese Institute of Information Technologies, Koszykowa 86, 02-008, Warsaw, Poland

    Franciszek Seredyński

  3. Institute of Computer Science of Polish Academy of Sciences, Ordona 21, 01-237, Warsaw, Poland

    Franciszek Seredyński

  4. School of Information Technologies, University of Sydney, Sydney, NSW 2006, Australia

    Albert Y. Zomaya

Authors
  1. Pascal Bouvry
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Franciszek Seredyński
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Albert Y. Zomaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computational and Information Sciences, Czestochowa University of Technology,  

    Roman Wyrzykowski

  2. Computer Science Department, University of Tennessee, TN 37996-3450, Knoxville, USA

    Jack Dongarra

  3. Systems Research Institute, Polish Academy of Science, Warsaw, Poland

    Marcin Paprzycki

  4. Informatics & Mathematical Modeling, Technical University of Denmark, DK-2800, Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bouvry, P., Seredyński, F., Zomaya, A.Y. (2004). Application of Cellular Automata for Cryptography. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_58

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24669-5_58

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21946-0

  • Online ISBN: 978-3-540-24669-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation