Abstract
The linear complexity of a periodic binary sequence is the length of the shortest linear feedback shift register that can be used to generate that sequence. When the sequence has least period 2n,n≥0, there is a fast algorithm due to Games and Chan that evaluates this linear complexity. In this paper a related algorithm is presented that obtains the linear complexity of the sequence requiring, on average for sequences of period 2n,n≥0, no more than 2 parity checks sums.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.L. Massey, Shift-register synthesis and BCH decoding.IEEE Transactions on Information Theory, Vol. IT-15, 1969, pp. 122–127.
R.A. Games and A.H. Chan, A fast algorithm for determining the complexity of a binary sequence with period 2n.IEEE Transactions on Information Theory, Vol. IT-29, 1983, pp. 144–146.
M. Marcus and H. Minc,A Survey of Matrix Theory and Matrix Inequalities, Allyn and Bacon, Inc., Boston, (1964).
A.H. Chan, R.A. Games, and E.L. Key, On the complexities of de Bruijn sequences.J. Comb. Theory, Vol. 33, 1982, pp. 233–246.
R.A. Rueppel,Analysis and Design of Stream Ciphers. Springer-Verlag, Berlin, (1986).
Author information
Authors and Affiliations
Additional information
Communicated by R. Mullin
Rights and permissions
About this article
Cite this article
Robshaw, M.J.B. On evaluating the linear complexity of a sequence of least period 2n . Des Codes Crypt 4, 263–269 (1994). https://doi.org/10.1007/BF01388455
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01388455