Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators

  • Nicholas Kolokotronis
  • Konstantinos Limniotis
  • Nicholas Kalouptsidis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4990)


Binary sequences generated by nonlinearly filtering maximal length sequences with period 2n − 1 are studied in this paper. We focus on the particular class of normal filters and provide improved lower bounds on the linear complexity of generated keystreams. This is achieved by first proving properties of a special class of determinants which are associated to linearized polynomials over finite fields of characteristic 2 and then by applying the above to simplify generalizations of the root presence test.


Binary sequences filter functions linear complexity linear feedback shift registers linearized polynomials stream ciphers 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Berlekamp, E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1968)MATHGoogle Scholar
  2. 2.
    Bernasconi, J., Günther, C.G.: Analysis of a nonlinear feedforward logic for binary sequence generators. In: Pichler, F. (ed.) EUROCRYPT 1985. LNCS, vol. 219, pp. 161–166. Springer, Heidelberg (1986)CrossRefGoogle Scholar
  3. 3.
    Caballero-Gil, P.: Regular cosets and upper bounds on the linear complexity of certain sequences. In: Ding, C., et al. (eds.) Sequences and Their Applications. DMTCS, pp. 242–256. Springer, Heidelberg (1999)Google Scholar
  4. 4.
    De Cannière, C., Preneel, B.: Trivium – a stream cipher construction inspired by block cipher design principles. In: eSTREAM: ECRYPT Stream Cipher Project, Report 2005/030 (2005),
  5. 5.
    Gammel, B., Göttfert, R., Kniffler, O.: The Achterbahn stream cipher. In: eSTREAM: ECRYPT Stream Cipher Project, Report 2005/002 (2005),
  6. 6.
    García-Villalba, L.J., Fúster-Sabater, A.: On the linear complexity of the sequences generated by nonlinear filterings. Inform. Process. Lett. 76, 67–73 (2000)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Golić, J.D.: On the linear complexity of functions of periodic GF(q) sequences. IEEE Trans. Inform. Theory 35, 69–75 (1989)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Golomb, S.W.: Shift Register Sequences. Holden-Day, San Francisco (1967)MATHGoogle Scholar
  9. 9.
    Göttfert, R., Niederreiter, H.: On the minimal polynomial of the product of linear recurring sequences. Finite Fields Applic. 1, 204–218 (1995)MATHCrossRefGoogle Scholar
  10. 10.
    Groth, E.J.: Generation of binary sequences with controllable complexity. IEEE Trans. Inform. Theory 17, 288–296 (1971)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Hell, M., Johansson, T., Meier, W.: Grain – a stream cipher for constrained environments. In eSTREAM: ECRYPT Stream Cipher Project, Report 2005/010 (2005),
  12. 12.
    Key, E.L.: An analysis of the structure and complexity of nonlinear binary sequence generators. IEEE Trans. Inform. Theory 22, 732–736 (1976)MATHCrossRefGoogle Scholar
  13. 13.
    Kolokotronis, N., Kalouptsidis, N.: On the linear complexity of nonlinearly filtered PN-sequences. IEEE Trans. Inform. Theory 49, 3047–3059 (2003)CrossRefMathSciNetGoogle Scholar
  14. 14.
    Kolokotronis, N., Limniotis, K., Kalouptsidis, N.: Lower bounds on sequence complexity via generalised Vandermonde determinants. In: Gong, G., Helleseth, T., Song, H.-Y., Yang, K. (eds.) SETA 2006. LNCS, vol. 4086, pp. 271–284. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  15. 15.
    Lam, C., Gong, G.: A lower bound for the linear span of filtering sequences. In: State of the Art of Stream Ciphers – SASC (2004), pp. 220–233 (2004)Google Scholar
  16. 16.
    Lidl, R., Niederreiter, H.: Finite Fields. In: Encyclop. Math. Its Applic., 2nd edn., vol. 20, Cambridge Univ. Press, Cambridge (1996)Google Scholar
  17. 17.
    Macdonald, I.G.: Symmetric Functions and Hall Polynomials, 2nd edn. Oxford Univ. Press, Oxford (1995)MATHGoogle Scholar
  18. 18.
    MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North-Holland, Amsterdam (1977)MATHGoogle Scholar
  19. 19.
    Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inform. Theory 15, 122–127 (1969)MATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Paterson, K.G.: Root counting, the DFT and the linear complexity of nonlinear filtering. Des. Codes Cryptogr. 14, 247–259 (1998)MATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Rønjom, S., Helleseth, T.: A new attack on the filter generator. IEEE Trans. Inform. Theory 53, 1752–1758 (2007)CrossRefMathSciNetGoogle Scholar
  22. 22.
    Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer, Berlin, Germany (1986)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Nicholas Kolokotronis
    • 1
  • Konstantinos Limniotis
    • 1
  • Nicholas Kalouptsidis
    • 1
  1. 1.Department of Informatics and TelecommunicationsNational and Kapodistrian University of AthensAthensGreece

Personalised recommendations