两类新的周期为$2N$的交织序列的线性复杂度和自相关性
Linear Complexity and Autocorrelation of two Classes of New Interleaved Sequences of Period $2N$
摘要:
流密码中密钥流序列的自相关性和线性复杂度是重要的密码学性质。许多具有这些优良性质的序列具有交织结构,Tang和Gong基于交织某些周期序列$N$,构造了三类具有最佳自相关值的周期序列$4N$。本文利用交织技术构造了周期为$2N$的具有最佳自相关特性的二元序列,计算了其自相关值及其分布,并给出了线性复杂度的一个下界。结果表明,这些序列具有较低的自相关性,线性复杂度满足密码学的要求。
英文摘要:
The autocorrelation and the linear complexity of a key stream sequence in a stream cipher are important cryptographic properties. Many sequences with these good properties have interleaved structure, three classes of binary sequences of period $4N$ with optimal autocorrelation values have been constructed by Tang and Gong based on interleaving certain kinds of sequences of period $N$. In this paper, we use the interleaving technique to construct a binary sequence with the optimal autocorrelation of period $2N$, then we calculate its autocorrelation values and its distribution, and give a lower bound of linear complexity. Results show that these sequences have low autocorrelation and the linear complexity satisfies the requirements of cryptography.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。