Skip to main content

A Survey of Recent Attacks on the Filter Generator

  • Conference paper

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

Abstract

The filter generator consists of a linear feedback shift register (LFSR) and a Boolean filtering function that combines bits from the shift register to create a key stream. The nonlinear combiner generator employs several (LFSRs) and a Boolean function that combines bit from all the registers to generate the key stream. A new attack on the filter generator has recently been described by Rønjom and Helleseth who also extended the attack to linear feedback shift registers over an extension field GF(2m). Some extensions and improvements of the attacks to the filter generator have been given by Rønjom, Gong and Helleseth. The purpose of this paper is to give a short overview of these attacks and to discuss how to extend these attacks to the nonlinear combiner generator.

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. Courtois, N., Meier, W.: Algebraic Attacks on Stream Ciphers with Linear Feedback. In: Biham, E. (ed.) EUROCRPYT 2003. LNCS, vol. 2656, pp. 345–359. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Golomb, S.W., Gong, G.: Signal Design for Good Correlation: For Wireless Communication, Cryptography and Radar. Cambridge University Press, Cambridge (2005)

    MATH  Google Scholar 

  3. Gong, G.: Analysis and Synthesis of Phases and Linear Complexity of Non-Linear Feedforward Sequences. Ph.D. thesis, University of Elec. Sci. and Tech. of China (1990)

    Google Scholar 

  4. 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 

  5. Herlestam, T.: On Functions of Linear Shift Register Sequences. In: Pichler, F. (ed.) EUROCRYPT 1985. LNCS, vol. 219, pp. 119–129. Springer, Heidelberg (1986)

    Chapter  Google Scholar 

  6. Paterson, K.G.: Root Counting, the DFT and the Linear Complexity of Nonlinear Filtering. Codes and Cryptography 14, 247–259 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  7. Rønjom, S., Gong, G., Helleseth, T.: On Attacks on Filtering Generators Using Linear Subspace Structures. In: SSC 2007, pp. 141–153 (2007)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  9. Rønjom, S., Helleseth, T.: Attacking the Filter Generator over GF(2m). In: WAIFI 2007. LNCS, vol. 4547, Springer, Heidelberg (2007)

    Google Scholar 

  10. Rønjom, S., Helleseth, T.: The Linear Vector Space Spanned by the Nonlinear Filter Generator. In: SSC 2007, pp. 141–153 (2007)

    Google Scholar 

  11. 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

Serdar Boztaş Hsiao-Feng (Francis) Lu

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rønjom, S., Gong, G., Helleseth, T. (2007). A Survey of Recent Attacks on the Filter Generator. In: Boztaş, S., Lu, HF.(. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2007. Lecture Notes in Computer Science, vol 4851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77224-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77224-8_2

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-77224-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics