A fast algorithm for determining the linear complexity of periodic sequences

被引：0

作者：

Wei, SM

Chen, GL

Xia, GZ

机构：

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

[2] Xidian Univ, Inst Informat Secur, Xian 710071, Peoples R China

来源：

INFORMATION SECURITY AND CRYPTOLOGY, PROCEEDINGS | 2005年 / 3822卷

关键词：

GF Q;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

An efficient algorithm for determining the linear complexity and the minimal polynomial of sequence with period p(m)q(n) over a finite field GF(q) is designed, 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 sequences with period q(n) over GF(q) and that for computing the linear complexity of sequences with period p(m) over GF(q).

引用

页码：202 / 209

页数：8

共 50 条

[21] 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
[22] Fast algorithms for determining the linear complexity of sequences over GF (pm) with period 2tn
Chen, H
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (05) : 1854 - 1856
[23] New Results on Periodic Sequences With Large -Error Linear Complexity
Hu, Honggang
Gong, Guang
Feng, Dengguo
2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 2409 - +
[24] Periodic sequences with large k-error linear complexity
Niederreiter, H
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (02) : 501 - 505
[25] An Efficient Algorithm to Compute the Linear Complexity of Binary Sequences
Fuster-Sabater, Amparo
Requena, Veronica
Cardell, Sara D.
MATHEMATICS, 2022, 10 (05)
[26] Linear complexity and k-error linear complexity for 2mpn-periodic binary sequences
Tan, Lin
Qi, Wen-Feng
Tongxin Xuebao/Journal on Communications, 2008, 29 (07): : 44 - 49
[27] The k-Error Linear Complexity and the Linear Complexity for pq~n-Periodic Binary Sequences
ZHU Fengxiang
WuhanUniversityJournalofNaturalSciences, 2006, (06) : 1549 - 1553
[28] 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
[29] Reducing the calculation of the linear complexity of u2v-periodic binary sequences to Games–Chan algorithm
Wilfried Meidl
Designs, Codes and Cryptography, 2008, 46 : 57 - 65
[30] On the Linear Complexity of a Class of Periodic Sequences Derived from Euler Quotients
Luo, Bingyu
Zhang, Jingwei
Zhao, Chang'an
CHINESE JOURNAL OF ELECTRONICS, 2023, 32 (02) : 262 - 272

← 1 2 3 4 5 →