Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Cryptography and Security pp 223–224Cite as

Filter Generator

  • Reference work entry

  • 202 Accesses

A filter generator is a running-key generator for stream cipher applications. It consists of a single linear feedback shift register (LFSR) which is filtered by a nonlinear function. More precisely, the output sequence of a filter generator corresponds to the output of a nonlinear function whose inputs are taken from some stages of the LFSR. If \((u_t)_{t \geq 0}\) denotes the sequence generated by the LFSR, the output sequence \((s_t)_{t \geq 0}\) of the filter generator is given by

$$ s_t = f (u_{t+\gamma_1}, u_{t+\gamma_2}, \ldots, u_{t + \gamma_n}), \qquad \forall t \geq 0, $$

where f is a function of n variables, n is less than or equal to the LFSR length, and \((\gamma_i)_{1 \leq i \leq n}\) is a decreasing sequence of non-negative integers called the tapping sequence.

figure 1_0-387-23483-7_165

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

References

  1. Anderson, R.J. (1995). “Searching for the optimum correlation attack.” Fast Software Encryption 1994, Lecture Notes in Computer Science, vol. 1008, ed. B. Preneel. Springer-Verlag, Berlin, 137–143.

    Google Scholar 

  2. Canteaut, A. and E. Filiol (2002). “On the Influence of the Filtering Function on the Performance of Fast Correlation Attacks on Filter Generators.” Symposium on Information theory in the Benelux, May 2002.

    Google Scholar 

  3. Courtois, N.T and W. Meier (2003). “Algebraic attacks on stream ciphers with linear feedback.” Advances in Cryptology—EUROCRYPT 2003, Lecture Notes in Computer Science, vol. 2656, ed. E. Biham. Springer-Verlag, Berlin, 345–359.

    Google Scholar 

  4. Golić, J.Dj. (1996). “On the security of nonlinear filter generators.” Fast Software Encryption 1996, Lecture Notes in Computer Science, vol. 1039, ed. D. Gollman. Springer-Verlag, Berlin, 173–188.

    Google Scholar 

  5. Jönsson, F. and T. Johansson (2002). “A fast correlation attack on LILI-128.” Information Processing Letters, 81 (3), 127–132.

    Article  MATH  MathSciNet  Google Scholar 

  6. Key, E.L. (1976). “An analysis of the structure and complexity of nonlinear binary sequence generators.” IEEE Transactions on Information Theory, 22, 732–736.

    Article  MATH  Google Scholar 

  7. Lee, S., S. Chee, S. Park, and S. Park (1996). “Conditional correlation attack on nonlinear filter generators.” Advances in Cryptography—ASIACRYPT'96, Lecture Notes in Computer Science, vol. 1163, eds. K. Kim and T. Matsumoto. Springer-Verlag, Berlin, 360–367.

    Google Scholar 

  8. Massey, J.L. (2001). “The ubiquity of Reed–Muller codes.” Applied Algebra, Algebraic Algorithms and Error-Correcting Codes—AAECC-14, Lecture Notes in Computer Science, vol. 2227, eds. S. Boztas and I. Shparlinski. Springer-Verlag, Berlin, 1–12.

    Google Scholar 

  9. Rueppel, R.A. (1986). Analysis and Design of Stream Ciphers. Springer-Verlag, Berlin.

    MATH  Google Scholar 

Download references

Authors
  1. Anne Canteaut
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Eindhoven University of Technology, Eindhoven, The Netherlands

    Henk C. A. van Tilborg

Rights and permissions

Reprints and permissions

Copyright information

© 2005 International Federation for Information Processing

About this entry

Cite this entry

Canteaut, A. (2005). Filter Generator. In: van Tilborg, H.C.A. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA . https://doi.org/10.1007/0-387-23483-7_165

Download citation

Publish with us

Policies and ethics

Search

Navigation