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 条

[1] On the k-error linear complexity of cyclotomic sequences
Aly, Hassan
Meidl, Wilfried
Winterhof, Arne
JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2007, 1 (03) : 283 - 296
[2] k-error linear complexity of binary cyclotomic generators
Chen Z.
Wu C.
Tongxin Xuebao/Journal on Communications, 2019, 40 (02): : 197 - 206
[3] On the k-error linear complexity of l-sequences
Tan, Lin
Qi, Wen-Feng
FINITE FIELDS AND THEIR APPLICATIONS, 2010, 16 (06) : 420 - 435
[4] Periodic sequences with large k-error linear complexity
Niederreiter, H
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (02) : 501 - 505
[5] Periodic sequences with maximal linear complexity and large k-error linear complexity
Meidl, W
Niederreiter, H
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2003, 14 (04) : 273 - 286
[6] On the expected value of the linear complexity and the k-error linear complexity of periodic sequences
Meidl, W
Niederreiter, H
IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (11) : 2817 - 2825
[7] Periodic Sequences with Maximal Linear Complexity and Large k-Error Linear Complexity
Wilfried Meidl
Harald Niederreiter
Applicable Algebra in Engineering, Communication and Computing, 2003, 14 : 273 - 286
[8] The k-error linear complexity distribution for -periodic binary sequences
Zhou, Jianqin
Liu, Wanquan
DESIGNS CODES AND CRYPTOGRAPHY, 2014, 73 (01) : 55 - 75
[9] Periodic sequences with maximal linear complexity and almost maximal k-error linear complexity
Niederreiter, H
Shparlinski, IE
CRYPTOGRAPHY AND CODING, PROCEEDINGS, 2003, 2898 : 183 - 189
[10] ON THE k-ERROR LINEAR COMPLEXITY OF SEQUENCES FROM FUNCTION FIELDS
Zhou, Yuhui
Han, Yuhui
Ding, Yang
BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2020, 102 (02) : 342 - 352

← 1 2 3 4 5 →