Abstract
We present several generalisations of the Games–Chan algorithm. For a fixed monic irreducible polynomial f we consider the sequences s that have as a characteristic polynomial a power of f. We propose an algorithm for computing the linear complexity of s given a full (not necessarily minimal) period of s. We give versions of the algorithm for fields of characteristic 2 and for arbitrary finite characteristic p, the latter generalising an algorithm of Ding et al. We also propose an algorithm which computes the linear complexity given only a finite portion of s (of length greater than or equal to the linear complexity), generalising an algorithm of Meidl. All our algorithms have linear computational complexity. The proposed algorithms can be further generalised to sequences for which it is known a priori that the irreducible factors of the minimal polynomial belong to a given small set of polynomials.
Similar content being viewed by others
References
Burrage, A.J., Sălăgean, A., Phan, R.C.-W.: Linear complexity for sequences with characteristic polynomial f v. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp.688–692. St. Petersburg, Russia (2011)
Ding, C., Xiao, G., Shan, W.: The Stability Theory of Stream Ciphers. Springer (1991)
Games, R., Chan, A.: A fast algorithm for determining the complexity of a binary sequence with period 2n. IEEE Trans. Inf. Theory 29, 144–146 (1983)
Golomb, S.W.: Shift Register Sequences. Aegean Park Press (1982)
Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge University Press (1994)
Meidl, W.: How to determine linear complexity and k-error linear complexity in some classes of linear recurring sequences. Cryptogr. Commun. 1, 117–133 (2009)
Sălăgean, A.: On the computation of the linear complexity and the k-error linear complexity of binary sequences with period a power of two. IEEE Trans. Inf. Theory 51, 1145–1150 (2005)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was done while Alex J. Burrage and Raphael C.-W. Phan were with Loughborough University.
A preliminary version of this paper was presented at the IEEE International Symposium on Information Theory, St. Petersburg, Russia, August 2011 [1].
Rights and permissions
About this article
Cite this article
Sălăgean, A., Burrage, A.J. & Phan, R.C.W. Computing the linear complexity for sequences with characteristic polynomial f v . Cryptogr. Commun. 5, 163–177 (2013). https://doi.org/10.1007/s12095-013-0080-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12095-013-0080-3