About computation of the linear complexity of generalized cyclotomic sequences with period p n+1

被引：24

作者：

Edemskiy, Vladimir ^{[1
]}

机构：

[1] Novgorod State Univ, Veliky Novgorod 173003, Russia

来源：

DESIGNS CODES AND CRYPTOGRAPHY | 2011年 / 61卷 / 03期

关键词：

Linear complexity; Generalized cyclotomic sequences; AUTOCORRELATION;

D O I：

10.1007/s10623-010-9474-9

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We propose a computation method for linear complexity of series of generalized cyclotomic sequences with period p (n+1). This method is based on using the polynomial of the classic cyclotomic sequences of period p. We found the linear complexity of generalized cyclotomic sequences corresponding to the classes of biquadratic residues and Hall sequences.

引用

页码：251 / 260

页数：10

共 18 条

[1]

[Anonymous], FINITE FIELDS TH APP

[2] Some notes on prime-square sequences [J].

Bai, En-Jian ;

Liu, Xiao-Juan .

JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2007, 22 (03) :481-486

[3]

Cusick T. W., 1998, STREAM CIPHERS NUMBE

[4]

DAI ZD, 2003, P INT WORKSH COD CRY, P121

[5] On the linear complexity of legendre sequences [J].

Ding, CS ;

Helleseth, T ;

Shan, WJ .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (03) :1276-1278

[6] Linear complexity of some generalized cyclotomic sequences [J].

Ding, CS .

INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 1998, 8 (04) :431-442

[7] Several classes of binary sequences with three-level autocorrelation [J].

Ding, CS ;

Helleseth, T ;

Lam, KY .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (07) :2606-2612

[8]

Edemskii VA, 2010, DISCRET MATH APPL, V20, P75, DOI 10.1515/DMA.2010.004

[9] Linear complexity of ternary sequences formed on the basis of power residue classes [J].

Edemskiy, V. A. .

PROBLEMS OF INFORMATION TRANSMISSION, 2008, 44 (04) :287-294

[10]

Hall M., 1975, COMBINATORIAL THEORY

← 1 2 →