On the k-error linear complexity of generalised cyclotomic sequences

被引：0

作者：

Liu L. ^{[1
]}

Yang X. ^{[1
,2
]}

Du X. ^{[2
]}

Wei B. ^{[1
]}

机构：

[1] Key Laboratory of Network and Information Security of APF, Engineering College of APF, Xi'an

[2] Key Laboratory of Computer Network and Information Security of the Ministry of Education, Xidian University, Xi'an

来源：

Liu, Longfei (ya_zhou_521@163.com) | 1600年 / Inderscience Enterprises Ltd., 29, route de Pre-Bois, Case Postale 856, CH-1215 Geneva 15, CH-1215, Switzerland卷 / 09期

关键词：

Generalised cyclotomy; K-error linear complexity; Pseudo-random sequence; Stream cipher;

D O I：

10.1504/IJHPCN.2016.080411

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Generalised cyclotomic binary sequences are divided into Whiteman-generalised cyclotomic and Ding-generalised cyclotomic. Firstly, two classes of error generalised cyclotomic sequences with length pq over Zpq are constructed; secondly, k-error linear complexity of generalised cyclotomic sequences are considered, using the trace representation and cyclotomic theory, respectively. It is shown that k-error linear complexity of generalised cyclotomic sequences do not exceed p + q-1 which is much less than the (zero-error) linear complexity. Copyright © 2016 Inderscience Enterprises Ltd.

引用

页码：394 / 400

页数：6

共 50 条

[21] The k-Error Linear Complexity and the Linear Complexity for pq~n-Periodic Binary Sequences
ZHU Fengxiang
Wuhan University Journal of Natural Sciences, 2006, (06) : 1549 - 1553
[22] How to determine linear complexity and k-error linear complexity in some classes of linear recurring sequences
Wilfried Meidl
Cryptography and Communications, 2009, 1 : 117 - 133
[23] A relationship between linear complexity and k-error linear complexity
Kurosawa, K
Sato, F
Sakata, T
Kishimoto, W
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) : 694 - 698
[24] On the k-error linear complexity of binary sequences derived from polynomial quotients
Chen ZhiXiong
Niu ZhiHua
Wu ChenHuang
SCIENCE CHINA-INFORMATION SCIENCES, 2015, 58 (09) : 1 - 15
[25] On the k-error linear complexity of binary sequences derived from polynomial quotients
CHEN ZhiXiong
NIU ZhiHua
WU ChenHuang
ScienceChina(InformationSciences), 2015, 58 (09) : 83 - 97
[26] A Hybrid Genetic Algorithm for Computing the k-Error Linear Complexity of Periodic Sequences
Niu Z.
Yuan C.
Kong D.
Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University, 2020, 54 (06): : 599 - 606
[27] On the k-error linear complexity of sequences with period pn over GF(q)
Zhou, Jianqin
Shangguan, Cheng
2008 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, VOLS 1 AND 2, PROCEEDINGS, 2008, : 267 - +
[28] Linear complexity, k-error linear complexity, and the discrete Fourier transform
Meidl, W
Niederreiter, H
JOURNAL OF COMPLEXITY, 2002, 18 (01) : 87 - 103
[29] On k-error Linear Complexity of Zeng-Cai-Tang-Yang Generalized Cyclotomic Binary Sequences of Period p2
Wu, Chenhuang
Xu, Chunxiang
FRONTIERS IN CYBER SECURITY, 2018, 879 : 9 - 22
[30] On the generalized Lauder-Paterson algorithm and profiles of the k-error linear complexity for exponent periodic sequences
Kaida, T
SEQUENCES AND THEIR APPLICATIONS - SETA 2004, 2005, 3486 : 166 - 178

← 1 2 3 4 5 →