A fast algorithm for the linear complexity of periodic sequences

被引：0

作者：

Wei, SM ^{[1
]}

Chen, Z

Wang, Z

机构：

[1] Huaibei Coal Normal Coll, Dept Comp Sci & Technol, Huaibei 235000, Peoples R China

[2] Peking Univ, Dept Comp Sci & Technol, Beijing 100871, Peoples R China

来源：

CHINESE JOURNAL OF ELECTRONICS | 2004年 / 13卷 / 01期

关键词：

cryptography; stream cipher; periodic sequence; linear complexity; minimal polynomial; fast algorithm;

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

An efficient algorithm for determining the linear complexity and the minimal polynomial of a sequence with period 2p(m)q(n) over a finite field GF(q) is proposed, where p and q are primes, and q is a primitive root modulo p(2). The new algorithm generalizes the algorithm for computing the linear complexity of a sequence with period q(n) over GF(q) and the algorithm for computing one of a sequence with period 2p(m) over GF(q).

引用

页码：86 / 91

页数：6

共 50 条

[1] A fast algorithm for determining the linear complexity of periodic sequences over GF(3)
Zhou, Jianqin
Zheng, Qiang
CRYPTOLOGY AND NETWORK SECURITY, PROCEEDINGS, 2006, 4301 : 213 - +
[2] Fast algorithms for determining the linear complexity of period sequences
Xiao, GZ
Wei, SM
PROGRESS IN CRYPTOLOGY - INDOCRYPT 2002, PROCEEDINGS, 2002, 2551 : 12 - 21
[3] 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
[4] 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
[5] A fast algorithm for determining the linear complexity of a binary sequence with period 2npm
Shimin Wei
Guozhen Xiao
Zhong Chen
Science in China Series : Information Sciences, 2001, 44 (6): : 453 - 460
[6] A fast algorithm for determining the linear complexity of a binary sequence with period 2npm
魏仕民
肖国镇
陈钟
Science in China(Series F:Information Sciences), 2001, (06) : 453 - 460
[7] 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
[8] On the error linear complexity spectrum of pn-periodic binary sequences
Tang, Miao
Zhu, Shixin
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2013, 24 (06) : 497 - 505
[9] A fast algorithm for determining the linear complexity of a sequence with period pn over GF (q)
Xiao, GZ
Wei, SM
Lam, KY
Imamura, K
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (06) : 2203 - 2206
[10] A Matrix Algebra for the Linear Complexity of Periodic Sequences
Ma, Chingwo
THIRD INTERNATIONAL CONFERENCE ON INFORMATION SECURITY AND INTELLIGENT CONTROL (ISIC 2012), 2012, : 17 - 20

← 1 2 3 4 5 →