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

基于超立方体理论的$p^n$ -周期二元序列的$k$ -错误线性复杂度

On the $k$-error linear complexity for $p^n$-periodic binary sequences via hypercube theory

Jianqin Zhou, Wanquan Liu, Guanglu Zhou

摘要:

二进制序列的线性复杂度和$k$ -错误线性复杂度是衡量密钥流强度的重要安全指标。通过研究具有最小汉明重量的二元序列,提出了一种新的分析$p^n$ -周期二元序列的工具--超立方体理论。事实上,超立方体理论是基于一个典型的序列分解,它是一个非常重要的工具,在研究要害差错线性复杂度谱提出的Etzion等人。我们首先给出一个标准的超立方体分解基于一个良好的,已知的算法计算线性复杂度,并表明在分解中的第一个超立方体的线性复杂度等于线性复杂度原始序列。其次,基于这种分解,我们给出了$p^n$ -周期二元序列$s$线性复杂度第一次下降的完整刻画。这大大改善了文献中现有的结果。对于超立方体的重要性,我们最后给出了具有相同线性复杂度的$m$ -超立方体的计数公式。

英文摘要:

The linear complexity and the $k$-error linear complexity of a binary sequence are important security measures for key stream strength. By studying binary sequences with the minimum Hamming weight, a new tool named as hypercube theory is developed for $p^n$-periodic binary sequences. In fact, hypercube theory is based on a typical sequence decomposition and it is a very important tool in investigating the critical error linear complexity spectrum proposed by Etzion et al. To demonstrate the importance of hypercube theory, we first give a standard hypercube decomposition based on a well-known algorithm for computing linear complexity and show that the linear complexity of the first hypercube in the decomposition is equal to the linear complexity of the original sequence. Second, based on such decomposition, we give a complete characterization for the first decrease of the linear complexity for a $p^n$-periodic binary sequence $s$. This significantly improves the current existing results in literature. As to the importance of the hypercube, we finally derive a counting formula for the $m$-hypercubes with the same linear complexity.

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

↑