Skip to main content
Log in

Reducing the calculation of the linear complexity of u2v-periodic binary sequences to Games–Chan algorithm

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

We show that the linear complexity of a u2v-periodic binary sequence, u odd, can easily be calculated from the linear complexities of certain 2v-periodic binary sequences. Since the linear complexity of a 2v-periodic binary sequence can efficiently be calculated with the Games-Chan algorithm, this leads to attractive procedures for the determination of the linear complexity of a u2v-periodic binary sequence. Realizations are presented for u  =  3, 5, 7, 15.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chen H. (2005). Fast algorithms for determining the linear complexity of sequences over GF(p m) with period 2t n. IEEE Trans. Inform. Theory 51: 1854–1856

    Article  MathSciNet  Google Scholar 

  2. Chen H. (2006). Reducing the computation of linear complexities of periodic sequences over GF(p m). IEEE Trans. Inform. Theory 52: 5537–5539

    Article  MathSciNet  Google Scholar 

  3. Cusick T.W., Ding C. and Renvall A. (1998). Stream Ciphers and Number Theory. North-Holland Publishing Co., Amsterdam

    Book  MATH  Google Scholar 

  4. Ding C.: A fast algorithm for the determination of linear complexity of sequences over GF(p m) with period p n. In: The Stability Theory of Stream Ciphers, Lecture Notes in Computer Science Vol. 561. Springer-Verlag, Berlin-Heidelberg, New York, pp. 141–144 (1991)

  5. Ding C., Xiao G. and Shan W. (1991). The Stability Theory of Stream Ciphers, Lecture Notes in Computer Science Vol 561. Springer-Verlag, Berlin

    Google Scholar 

  6. Games R.A. and Chan A.H. (1983). A fast algorithm for determining the complexity of a binary sequence with period 2n. IEEE Trans. Inform. Theory 29: 144–146

    Article  MATH  MathSciNet  Google Scholar 

  7. Massey J.L. (1969). Shift-register synthesis and BCH decoding. IEEE Trans. Inform. Theory 15: 122–127

    Article  MATH  MathSciNet  Google Scholar 

  8. Meidl W. (2005). Discrete Fourier transform, joint linear complexity and generalized joint linear complexity of multisequences. In: Helleseth, T. (eds) Proceedings of SETA’04, Lecture Notes in Computer Science Vol 3486, pp 101–112. Springer-Verlag, Berlin-Heidelberg

    Google Scholar 

  9. Meidl W. and Niederreiter H. (2003). The expected value of the joint linear complexity of periodic multisequences. J. Complexity 19: 61–72

    Article  MATH  MathSciNet  Google Scholar 

  10. Niederreiter H. (2003). Linear complexity and related complexity measures for sequences. In: Johansson, T. and Maitra, S. (eds) Progress in Cryptology - Proceedings of INDOCRYPT 2003, Lecture Notes in Computer Science Vol 2904, pp 1–17. Springer-Verlag, Berlin

    Google Scholar 

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

    MATH  Google Scholar 

  12. Rueppel R.A. (1992). Stream ciphers. In: Simmons, G.J. (eds) Contemporary Cryptology: The Science of Information Integrity, pp 65–134. IEEE Press, New York

    Google Scholar 

  13. Xiao G., Wei S., Lam K.Y. and Imamura K. (2000). A fast algorithm for determining the linear complexity of a sequence with period p n over GF(q). IEEE Trans. Inform. Theory 46: 2203–2206

    Article  MATH  MathSciNet  Google Scholar 

  14. Xiao G. and Wei S. (2002). Fast algorithms for determining the linear complexity of period sequences. In: Menezes, A. and Sarkar, P. (eds) Progress in Cryptology - INDOCRYPT, Lecture Notes in Computer Science Vol 2551., pp 12–21. Springer-Verlag, Berlin

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wilfried Meidl.

Additional information

Communicated by D. Hachenberger.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Meidl, W. Reducing the calculation of the linear complexity of u2v-periodic binary sequences to Games–Chan algorithm. Des. Codes Cryptogr. 46, 57–65 (2008). https://doi.org/10.1007/s10623-007-9134-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-007-9134-x

Keywords

AMS Classifications

Navigation