Skip to main content

Remarks on the New Attack on the Filter Generator and the Role of High Order Complexity

  • Conference paper
  • 889 Accesses

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

Abstract

Filter generators are important building blocks of stream ciphers and have been studied extensively. Recently, a new attack has been proposed. In this paper, we analyze this attack using the trace representation of the output sequence y and we prove that the attack does not work always as expected. We propose a new algorithm that covers the cases that the attack cannot be applied. The new attack is as efficient as the original attack. Finally, trying to motivate the research on the nonlinear complexity of binary sequences, we present a scenario where the knowledge of the quadratic complexity of a sequence can decrease significantly the necessary for the attack amount of known keystream bits.

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.: Fast Correlation Attacks Against Stream Ciphers and Related Open Problems. In: IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, pp. 49–54 (2005)

    Google Scholar 

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

    Chapter  Google Scholar 

  3. eSTREAM. http://www.ecrypt.eu.org/stream/

  4. Golomb, S.W.: Shift Register Sequences. Holden–Day Inc, San Francisco (1967)

    MATH  Google Scholar 

  5. Lidl, R., Niederreiter, H.: Finite Fields. Encyclopedia of Mathematics and its Applications, 2nd edn., vol. 20. Cambridge University Press, Cambridge (1996)

    Google Scholar 

  6. Menezes, A.J., Van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. CRC Press, Boca Raton (1996)

    Google Scholar 

  7. Niederreiter, H.: Linear Complexity and Related Complexity Measures for Sequences. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 1–17. Springer, Heidelberg (2003)

    Google Scholar 

  8. Rizomiliotis, P., Kalouptsidis, N.: Results on the nonlinear span of binary sequences. IEEE Trans. Inform. Theory 51, 1555–1563 (2005)

    Article  MathSciNet  Google Scholar 

  9. Ronjom, S., Helleseth, T.: A new attack on the filter generator. IEEE Trans. Inform. Theory 53, 1752–1758 (2007)

    Article  MathSciNet  Google Scholar 

  10. Ronjom, S., Helleseth, T.: S. Ronjom and T. Helleseth: Attacking the Filter Generator over GF(2m). In: SASC 2007. The State of the Art of Stream Ciphers (2007)

    Google Scholar 

  11. Rueppel, R.A.: Analysis and Design of Stream Ciphers. In: Communications and Control Engineering Series, Springer, Heidelberg (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Steven D. Galbraith

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rizomiliotis, P. (2007). Remarks on the New Attack on the Filter Generator and the Role of High Order Complexity. In: Galbraith, S.D. (eds) Cryptography and Coding. Cryptography and Coding 2007. Lecture Notes in Computer Science, vol 4887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77272-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77272-9_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77271-2

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics