On the (p1)/2-error Linear Complexity of Generalized Cyclotomic Sequence with Length pm
-
摘要: 周期为pm的广义割圆序列具有很高的线性复杂度。该文通过改变序列的特征集，构造了一类周期相同的错误序列，确定了序列的k-错线性复杂度。结果表明，该类序列的(p1)/2-错线性复杂度不超过pm1，这比该序列的线性复杂度低得多。因此，该类序列没有达到足够的安全作为密钥流生成器。Abstract: The generalized cyclotomic sequences with length pm has high linear complexity. In this paper, a class of error generalized cyclotomic sequences is constructed by changing the characteristic sets of the above sequences. The results show that the (p1)/2-error linear complexity of generalized cyclotomic sequences do not exceed pm1, which are much less than its (zero-error) linear complexity. Thus, it is not secure enough to be used in the stream cipher system.
-
计量
- 文章访问数: 2448
- HTML全文浏览量: 70
- PDF下载量: 511
- 被引次数: 0
下载:
