Skip to main content

Keystream Generator Analysis in Terms of Cellular Automata

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2003)

Abstract

The equivalence between the binary sequences obtained from a particular kind of keystream generator, the shrinking generator, and those ones generated from cellular automata has been studied. The class of shrinking generators can be identified with a subset of one-dimensional linear hybrid cellular automata with rules 90 and 150. A cryptanalytic approach based on the phaseshift of cellular automata output sequences is proposed. From the obtained results, we can create linear cellular automata-based models to cryptanalyze the class of keystream generators.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.00
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. Martin, O., Odlyzko, A.M., Wolfram, S.: Algebraic Properties of Cellular Automata. Commun. Math. Phys. 93, 219–258 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  2. Nandi, S., Kar, B.K., Chaudhuri, P.P.: Theory and Applications ofC ellular Automata in Cryptography. IEEE Transactions on Computers 43, 1346–1357 (1994)

    Article  Google Scholar 

  3. Das, A.K., Ganguly, A., Dasgupta, A., Bhawmik, S., Chaudhuri, P.P.: Efficient Characterisation of Cellular Automata. IEE Proc., Part E 1, 81–87 (1990)

    Google Scholar 

  4. Golomb, S.: Shift-Register Sequences (revised edition). Aegean press, Laguna HillsLaguna Hills (1982)

    Google Scholar 

  5. Coppersmith, D., Krawczyk, H., Mansour, Y.: The Shrinking Generator. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 22–39. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  6. Cattell, K., Muzio, J.: Analysis of One-Dimensional Linear Hybrid Cellular Automata over GF(q). IEEE Transactions on Computers 45, 782–792 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bardell, P.H.: Analysis of Cellular Automata Used as Pseudorandom Pattern Generators. In: Proceedings of the IEEE International Test Conference, Paper 34.1, pp. 762–768 (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fúster-Sabater, A., de la Guía-Martínez, D. (2003). Keystream Generator Analysis in Terms of Cellular Automata. In: Palade, V., Howlett, R.J., Jain, L. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2003. Lecture Notes in Computer Science(), vol 2773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45224-9_162

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45224-9_162

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40803-1

  • Online ISBN: 978-3-540-45224-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics