arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1108.5793cs.CR
收藏

$2^n$ -周期二元序列的$k$ -错误线性复杂度分布

The $k$-error linear complexity distribution for $2^n$-periodic binary sequences

Jianqin Zhou, Wanquan Liu

摘要:

在线性反馈移位寄存器设计中,序列的线性复杂度和$k$ -错误线性复杂度被用作密钥流序列强度的重要安全度量。通过研究周期为$2^n$的二元序列的线性复杂度,可以将计算$k$ -错误线性复杂度转化为寻找具有最小汉明重量的错误序列。基于Games-Chan算法,研究了$2^n$ -周期二元序列的$k$ -错误线性复杂度分布.首先,对于$k=2,3$,刻画了线性复杂度小于$2^n$的$2^n$ -周期平衡二元序列的$k$ -错误线性复杂度的完全计数函数.其次,对于$k=3,4$,给出了具有线性复杂度$2^n$的$2^n$ -周期二元序列的$k$ -错误线性复杂度的完全计数函数.第三,作为这些结果的结果,得到了对于$k = 2$和3,具有$k$ -错误线性复杂度的$2^n$ -周期二元序列个数的计数函数.此外,最近的一篇文章中的一个重要结果被证明是不完全正确的。

英文摘要:

The linear complexity and the $k$-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By studying the linear complexity of binary sequences with period $2^n$, one could convert the computation of $k$-error linear complexity into finding error sequences with minimal Hamming weight. Based on Games-Chan algorithm, the $k$-error linear complexity distribution of $2^n$-periodic binary sequences is investigated in this paper. First, for $k=2,3$, the complete counting functions on the $k$-error linear complexity of $2^n$-periodic balanced binary sequences (with linear complexity less than $2^n$) are characterized. Second, for $k=3,4$, the complete counting functions on the $k$-error linear complexity of $2^n$-periodic binary sequences with linear complexity $2^n$ are presented. Third, as a consequence of these results, the counting functions for the number of $2^n$-periodic binary sequences with the $k$-error linear complexity for $k = 2$ and 3 are obtained. Further more, an important result in a recent paper is proved to be not completely correct.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑