Linear complexity profile of binary sequences with small correlation measure
Linear complexity profile of binary sequences with small correlation measure
复制标题
DOI：
10.1007/s10998-006-0008-1
复制
发表时间：
2006-10
影响因子：
0.8
通讯作者：
N. Brandstätter;Arne Winterhof
中科院分区：
文献类型：
--
作者：
N. Brandstätter;Arne Winterhof
高线性复杂度简档是用于加密目的的序列的理想特征。对于给定的二元序列，我们用Mauduit和S提出的相关度量来估计它的线性复杂度分布。我们将这一结果应用于某些周期序列，包括Legendre序列、Sidelnikov序列和其他与离散对数有关的序列。
A high linear complexity profile is a desirable feature of sequences used for cryptographical purposes. For a given binary sequence we estimate its linear complexity profile in terms of the correlation measure, which was introduced by Mauduit and Sárközy. We apply this result to certain periodic sequences including Legendre sequences, Sidelnikov sequences and other sequences related to the discrete logarithm.