An algorithm for the k-error linear complexity of binary sequences with period 2n

Authors:
M. Stamp;C. F. Martin
Affiliations:
Dept. of Math. Sci., Worcester Polytech. Inst., MA;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 3

Error linear complexity measures for multisequences

Journal of Complexity
On the k-error linear complexity of l-sequences

Finite Fields and Their Applications
Counting Functions and Expected Values for the k-Error Linear Complexity

Finite Fields and Their Applications

Quantified Score

Hi-index	754.84

Visualization

Abstract

Certain applications require pseudo-random sequences which are unpredictable in the sense that recovering more of the sequence from a short segment must be computationally infeasible. It is shown that linear complexity is useful in determining such sequences. A generalized linear complexity that has application to the security of stream ciphers is proposed, and an efficient algorithm is given for the case in which the sequence is binary with period 2n. This algorithm generalizes an algorithm presented by R.A. Games and A.H. Chan (1983)