| The k-Error Linear Complexity and the Linear Complexity for pq^n-Periodic Binary Sequences |
| |
| 作者姓名： | ZHU Fengxiang QI Wenfeng |
| |
| 作者单位： | Institute of Information Engineering, Information Engineering University, Zhengzhou 450002, Henan, China |
| |
| 摘 要： | 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-误差线性复杂性 周期二进制序列 信息安全 保密通信 |
| 文章编号： | 1007-1202（2006）06-1549-05 |
| 收稿时间： | 2006-05-10 |
Thek-error linear complexity and the linear complexity forpq
n-periodic binary sequences |
| |
| ZHU Fengxiang QI Wenfeng.The k-Error Linear Complexity and the Linear Complexity for pq^n-Periodic Binary Sequences[J].Wuhan University Journal of Natural Sciences,2006,11(6):1549-1553. |
| |
| Authors: | Zhu Fengxiang Qi Wenfeng |
| |
| Institution: | (1) Institute of Information Engineering, Information Engineering University, 450002 Zhengzhou, Henan, China |
| |
| Abstract: | 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. |
| |
| Keywords: | k-error linear complexity linear complexity pqn-periodic binary sequences |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
