东篱科研大数据发现系统（DRDS）

位置：成果数据库 > 期刊 > 期刊详情页

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

ISSN号：0217-9822
期刊名称：《电子科学学刊：英文版》
时间：0
分类：TN918[电子电信—通信与信息系统;电子电信—信息与通信工程]
作者机构：[1]Institute of Information Engineering, Information Engineering University, Zhengzhou 450002, Henan, China
相关基金：Supported by the National Natural Science Foundation of China （60373092）

关键词： k-误差线性复杂性, 周期二进制序列, 信息安全, 保密通信, k-error linear complexity, linear complexity, pq^n-periodic binary sequences

中文摘要：

线性复杂性和溪流零的关键溪流的线性复杂性是的恐怖放大钥匙的随意的二个重要标准流。为在哪儿的 apq~n 周期的二进制序列 p， q 是二个奇怪的素数令人满意 2 是原始的根模块 p 和 q~2 andgcd (p—1， q—1 )=2，我们分析在为的线性复杂性和最小的价值 k 之间的关系线性复杂性严格地是的 k 错误不到线性复杂性。

英文摘要：

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.

同期刊论文项目