arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1112.6047cs.CR
收藏

具有固定3错或4错线性复杂度的$2^n$ -周期二元序列的特征

Characterization of $2^n$-periodic binary sequences with fixed 3-error or 4-error linear complexity

Jianqin Zhou, Jun Liu, Wanquan Liu

摘要:

在线性反馈移位寄存器设计中,序列的线性复杂度和$k$ -错误线性复杂度被用作密钥流序列强度的重要安全度量。利用组合数学中的筛法,研究了基于Games-Chan算法的$2^n$ -周期二元序列的$k$ -错误线性复杂度分布.首先,对于$k=2,3$,刻画了线性复杂度小于$2^n$的$2^n$ -周期二元序列的$k$ -错误线性复杂度的完全计数函数.其次,对于$k=3,4$,给出了具有线性复杂度$2^n$的$2^n$ -周期二元序列的$k$ -错误线性复杂度的完全计数函数.第三,对于$k=4,5$,导出了线性复杂度小于$2^n$的$2^n$ -周期二元序列的$k$ -错误线性复杂度的完全计数函数.作为这些结果的结果,得到了具有3错线性复杂度的$2^n$ -周期二元序列个数的计数函数,并得到了具有4错线性复杂度的$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 using the sieve method of combinatorics, the $k$-error linear complexity distribution of $2^n$-periodic binary sequences is investigated based on Games-Chan algorithm. First, for $k=2,3$, the complete counting functions on the $k$-error linear complexity of $2^n$-periodic 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, for $k=4,5$, the complete counting functions on the $k$-error linear complexity of $2^n$-periodic binary sequences with linear complexity less than $2^n$ are derived. As a consequence of these results, the counting functions for the number of $2^n$-periodic binary sequences with the 3-error linear complexity are obtained, and the complete counting functions on the 4-error linear complexity of $2^n$-periodic binary sequences are obvious.

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

↑