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] On the k-error linear complexity of pm-periodic binary sequences
Han, Yun Kyoung
Chung, Jin-Ho
Yang, Kyeongcheol
IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (06) : 2297 - 2304
[22] On the computation of the linear complexity and the k-error linear complexity of binary sequences with period a power of two
Salagean, A
SEQUENCES AND THEIR APPLICATIONS - SETA 2004, 2005, 3486 : 179 - 184
[23] How to determine linear complexity and k-error linear complexity in some classes of linear recurring sequences
Meidl, Wilfried
CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2009, 1 (01): : 117 - 133
[24] Remarks on the k-error linear complexity of pn-periodic sequences
Wilfried Meidl
Ayineedi Venkateswarlu
Designs, Codes and Cryptography, 2007, 42 : 181 - 193
[25] On the k-error linear complexity over Fp of Legendre and Sidelnikov sequences
Aly, Hassan
Winterhof, Arne
DESIGNS CODES AND CRYPTOGRAPHY, 2006, 40 (03) : 369 - 374
[26] The k-Error Linear Complexity and the Linear Complexity for pq~n-Periodic Binary Sequences
ZHU Fengxiang
WuhanUniversityJournalofNaturalSciences, 2006, (06) : 1549 - 1553
[27] 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
[28] Decomposing Approach for Error Vectors of k-Error Linear Complexity of Certain Periodic Sequences
Su, Ming
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2014, E97A (07) : 1542 - 1555
[29] 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
[30] 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

← 1 2 3 4 5 →