具有稳定$k$ -错线性复杂度的周期序列
Periodic sequences with stable $k$-error linear complexity
摘要:
序列的线性复杂度是衡量密钥流强度的重要指标,因此设计一个具有高线性复杂度和$k$ -错误线性复杂度的序列是密码学和通信学中的一个研究热点。Niederreiter首先注意到GF(q)上具有高$k$ -错误线性复杂度的许多周期序列。本文提出了稳定的$k$ -错误线性复杂度的概念,用来研究具有高$k$ -错误线性复杂度的序列.通过研究周期为$2^n$的二元序列的线性复杂度,给出了利用立方体理论构造具有最大稳定$k$ -错误线性复杂度的序列的方法.证明了周期为$2^n$的二元序列可分解为若干互不相交的立方体。立方体理论是研究$k$ -错误线性复杂度的一种新工具。最后证明了在所有$2^n$ -周期二进序列上,最大$k$ -错误线性复杂度为$2^n-(2^l-1)$,其中$2^{l-1}\le k<2^{l}$ .
英文摘要:
The linear complexity of a sequence has been used as an important measure of keystream strength, hence designing a sequence which possesses high linear complexity and $k$-error linear complexity is a hot topic in cryptography and communication. Niederreiter first noticed many periodic sequences with high $k$-error linear complexity over GF(q). In this paper, the concept of stable $k$-error linear complexity is presented to study sequences with high $k$-error linear complexity. By studying linear complexity of binary sequences with period $2^n$, the method using cube theory to construct sequences with maximum stable $k$-error linear complexity is presented. It is proved that a binary sequence with period $2^n$ can be decomposed into some disjoint cubes. The cube theory is a new tool to study $k$-error linear complexity. Finally, it is proved that the maximum $k$-error linear complexity is $2^n-(2^l-1)$ over all $2^n$-periodic binary sequences, where $2^{l-1}\le k<2^{l}$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。