Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants

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

Abstract

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 equidistant filters and provide improved lower bounds on the linear complexity of the filtered sequences. This is achieved by first considering and proving properties of generalised Vandermonde determinants. Furthermore, it is shown that the methodology developed can be used for studying properties of any nonlinear filter.

Keywords

Binary sequences filter functions linear complexity linear feedbak shift registers symmetric functions Vandermonde determinants 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Caballero-Gil, P.: Regular cosets and upper bounds on the linear complexity of certain sequences. In: Ding, C., Helleseth, T., Niederreiter, H. (eds.) Sequences and Their Applications. Discrete Mathematics and Theoretical Computer Science, pp. 242–256. Springer, Berlin (1999)Google Scholar
  2. 2.
    Caballero-Gil, P., Fúster-Sabater, A.: A wide family of nonlinear filter functions with large linear span. Inform. Sci. 164, 197–207 (2004)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    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
  4. 4.
    Golomb, S.W.: Shift Register Sequences. Holden-Day Inc., San Francisco (1967)MATHGoogle Scholar
  5. 5.
    Göttfert, R., Niederreiter, H.: On the linear complexity of products of shift-register sequences. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 151–158. Springer, Heidelberg (1994)Google Scholar
  6. 6.
    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
  7. 7.
    Groth, E.J.: Generation of binary sequences with controllable complexity. IEEE Trans. Inform. Theory 17, 288–296 (1971)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    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
  9. 9.
    Kolokotronis, N., Kalouptsidis, N.: On the linear complexity of nonlinearly filtered PN-sequences. IEEE Trans. Inform. Theory 49, 3047–3059 (2003)CrossRefMathSciNetGoogle Scholar
  10. 10.
    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
  11. 11.
    Lidl, R., Niederreiter, H.: Finite Fields. In: Encyclop. Math. Its Applic., 2nd edn., vol. 20, Cambridge Univ. Press, Cambridge (1996)Google Scholar
  12. 12.
    Macdonald, I.G.: Symmetric Functions and Hall Polynomials, 2nd edn. Oxford Univ. Press, Oxford (1995)MATHGoogle Scholar
  13. 13.
    Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inform. Theory 15, 122–127 (1969)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Massey, J.L., Serconek, S.: A Fourier transform approach to the linear complexity of nonlinearly filtered sequences. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 332–340. Springer, Heidelberg (1994)Google Scholar
  15. 15.
    Paterson, K.G.: Root counting, the DFT and the linear complexity of nonlinear filtering. Des. Codes Cryptogr. 14, 247–259 (1998)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer, Berlin (1986)MATHGoogle Scholar
  17. 17.
    Shparlinski, I.E.: On the singularity of generalised Vandermonde matrices over finite fields. Finite Fields Appl. 11, 193–199 (2005)MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Tu, L.W.: A partial order on partitions and the generalised Vandermonde determinant. J. Algebra 278, 127–133 (2004)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

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