Skip to main content

The Linear Vector Space Spanned by the Nonlinear Filter Generator

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 4893))

Abstract

The filter generator is an important building block in many stream ciphers. The generator consists of a linear feedback shift register (LFSR) of length n and a Boolean filtering function of degree d that combines bits from the shift register and creates an output bit z t at any time t. A new attack on stream ciphers based on linear shift registers has recently been described by the authors in [3]. This attack is modified to stream ciphers based on any linear shift register and not only for LFSRs. The focal point of this paper is to present a linear description of the filter generator in terms of matrices. The filter generator is viewed entirely in terms of powers of a unique linear operator T together with a vector representing the filtering function. It is proved that T embodies the coefficient sequences described in [3]. Thus, interesting properties of the vector space (e.g. the dimension of the equation systems) generated by the filter generator can be analysed using theory of cyclic vector spaces, which very elegantly complements analysis in terms of the roots of the LFSR.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Canteaut, A.: Open problems related to algebraic attacks on stream ciphers. In: Ytrehus, O. (ed.) WCC 2005. LNCS, vol. 3969, pp. 120–134. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  2. Rønjom, S., Gong, G., Helleseth, T.: On Attacks on Filtering Generators Using Linear Subspace Structure (submitted)

    Google Scholar 

  3. Rønjom, S., Helleseth, T.: A New Attack on the Filter Generator. IEEE Transactions on Information Theory 53(5), 1752–1758 (2007)

    Article  Google Scholar 

  4. Rønjom, S., Helleseth, T.: Attacking the Filter Generator over GF(2m). In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol. 4547, Springer, Heidelberg (2007)

    Google Scholar 

  5. Kleppner, A.: The Cyclic Decomposition Theorem. Integral Equations and Operator Theory 25, 406–490 (1996)

    Article  MathSciNet  Google Scholar 

  6. Hawkes, P., Rose, G.: Rewriting variables: The complexity of fast algebraic attacks on stream ciphers. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 390–406. Springer, Heidelberg (2004)

    Google Scholar 

  7. Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer, Heidelberg (1986)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Solomon W. Golomb Guang Gong Tor Helleseth Hong-Yeop Song

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rønjom, S., Helleseth, T. (2007). The Linear Vector Space Spanned by the Nonlinear Filter Generator. In: Golomb, S.W., Gong, G., Helleseth, T., Song, HY. (eds) Sequences, Subsequences, and Consequences. Lecture Notes in Computer Science, vol 4893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77404-4_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77404-4_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77403-7

  • Online ISBN: 978-3-540-77404-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics