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

作　　者：ZHU Fengxiang QI Wenfeng 

机构地区：[1]Institute of Information Engineering, Information Engineering University, Zhengzhou 450002, Henan, China

出　　处：《Wuhan University Journal of Natural Sciences》2006年第6期1549-1553,共5页武汉大学学报（自然科学英文版）

基　　金：Supported by the National Natural Science Foun-dation of China (60373092)

摘　　要：The k-error 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 a primitive root module p and q^2 and gcd（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.The k-error 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 a primitive root module p and q^2 and gcd（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.

关 键 词：k-error linear complexity linear complexity pq^n-periodic binary sequences 

分 类 号：TN918[电子电信—通信与信息系统]