The k-Error Linear Complexity and the Linear Complexity for pq~n-Periodic Binary Sequences

摘要

The terror linear complexity and the linear complexity of the keystream of a stream cipher are two important standards to scale the randomness of the key stream. For a pq~n-periodic binary sequences where p, q are two odd primes satisfying that 2 is aprimitive root module p and q~2 andgcd(p— 1 , q—1)=2, we analyze the relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.