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.
Similar content being viewed by others
References
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
Chen H. (2006). Reducing the computation of linear complexities of periodic sequences over GF(p m). IEEE Trans. Inform. Theory 52: 5537–5539
Cusick T.W., Ding C. and Renvall A. (1998). Stream Ciphers and Number Theory. North-Holland Publishing Co., Amsterdam
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)
Ding C., Xiao G. and Shan W. (1991). The Stability Theory of Stream Ciphers, Lecture Notes in Computer Science Vol 561. Springer-Verlag, Berlin
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
Massey J.L. (1969). Shift-register synthesis and BCH decoding. IEEE Trans. Inform. Theory 15: 122–127
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
Meidl W. and Niederreiter H. (2003). The expected value of the joint linear complexity of periodic multisequences. J. Complexity 19: 61–72
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
Rueppel R.A. (1986). Analysis and Design of Stream Ciphers. Springer-Verlag, Berlin
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
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
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
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by D. Hachenberger.
Rights 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
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-007-9134-x