Skip to main content
SpringerLink
Log in

Weakness Analysis of a Key Stream Generator Based on Cellular Automata

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

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6068))

  • 989 Accesses

Abstract

This paper exposes weaknesses of a secret-key cipher based on pseudo-random number generation. The pseudo-random number generator was previously described as high quality and passing various statistical tests (entropy, Marsaglia tests). It is operated by one-dimensional, two-state, non-uniform cellular automata with rules of radius one. Special rule assignments generate number sequences with zero entropy. The paper proposes a systematic construction that leads to such assignments, as well as the computation of the size of the weak key space. Finally, we envision solutions to this problem, and discuss the possibility to discover additional issues.

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. Schneier, B.: Applied Cryptography. Wiley, Chichester (1996)

    Google Scholar 

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

    Google Scholar 

  3. Habutsu, T., Nishio, Y., Sasase, 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. Nandi, S., Kar, B.K., Chaudhuri, P.P.: Theory and applications of cellular automata in cryptography. IEEE Trans. Computers 43(12), 1346–1357 (1994)

    Article  Google Scholar 

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

    Google Scholar 

  6. Tomassini, M., Perrenoud, M.: Stream cyphers with one- and two-dimensional cellular automata. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 722–731. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Tomassini, M., Sipper, M., Perrenoud, M.: On the generation of high-quality random numbers by two-dimensional cellular automata. IEEE Trans. Computers 49(10), 1146–1151 (2000)

    Article  Google Scholar 

  8. Marsaglia, G.: Diehard (1998), http://www.stat.fsu.edu/pub/diehard/

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

    Google Scholar 

  10. Jen, E.: Aperiodicity in one-dimensional cellular automata. In: Gutowitz, H. (ed.) Cellular Automata, Theory and Experiment, vol. 45, pp. 3–18. Physica D/MIT (1990)

    Google Scholar 

  11. Sipper, M.: Evolution of Parallel Cellular Machines. In: Sipper, M. (ed.) Evolution of Parallel Cellular Machines. LNCS, vol. 1194. Springer, Heidelberg (1997)

    Google Scholar 

  12. Szaban, M., Seredynski, F., Bouvry, P.: Collective behavior of rules for cellular automata-based stream ciphers. In: IEEE Congress in Evolutionary Computation (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Frédéric Pinel & Pascal Bouvry

Authors
  1. Frédéric Pinel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pascal Bouvry
    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. Department of Electrical Engineering and Computer Science, University of Tennessee, 37996-3450, Knoxville, TN, USA

    Jack Dongarra

  3. Institute of Computer and Information Science, Czestochowa University of Technology, Dabrowskiego 73, PL-42-200, Czestochowa, Poland

    Konrad Karczewski

  4. Department of Informatics and Mathematical Modeling, Technical University of Denmark, Richard Petersens Plads, Building 321, 2800, Kongens Lyngby, Denmark

    Jerzy Wasniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pinel, F., Bouvry, P. (2010). Weakness Analysis of a Key Stream Generator Based on Cellular Automata. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2009. Lecture Notes in Computer Science, vol 6068. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14403-5_58

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14403-5_58

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14402-8

  • Online ISBN: 978-3-642-14403-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation