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 条
  • [1] Fast algorithm for determining the linear complexity in periodic sequences
    Zhou, Jianqin
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2007, 35 (02): : 43 - 46
  • [2] A fast algorithm for the linear complexity of periodic sequences
    Wei, SM
    Chen, Z
    Wang, Z
    CHINESE JOURNAL OF ELECTRONICS, 2004, 13 (01): : 86 - 91
  • [3] 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 - +
  • [4] Fast algorithms for determining the linear complexity of period sequences
    Xiao, GZ
    Wei, SM
    PROGRESS IN CRYPTOLOGY - INDOCRYPT 2002, PROCEEDINGS, 2002, 2551 : 12 - 21
  • [5] Fast algorithm for determining the linear complexity of sequences over GF (pm) with the period kn
    Dept. of Computer Science, Anhui Univ. of Technology, Ma'anshan 243002, China
    Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University, 2008, 35 (04): : 759 - 763
  • [6] On the calculation of the linear complexity of periodic sequences
    Aly, Hassan
    Marzouk, Radwa
    Meidl, Wilfried
    FINITE FIELDS: THEORY AND APPLICATIONS, 2010, 518 : 11 - +
  • [7] THE DISTRIBUTION FUNCTIONS FOR THE LINEAR COMPLEXITY OF PERIODIC SEQUENCES
    Yang Minghui Zhu Shixin School of Computer Information Hefei University of Technology Hefei China School of Mathematics Hefei University of Technology Hefei China
    Journal of Electronics(China), 2012, 29(Z2) (China) : 211 - 214
  • [8] THE DISTRIBUTION FUNCTIONS FOR THE LINEAR COMPLEXITY OF PERIODIC SEQUENCES
    Yang Minghui* Zhu Shixin* ** *(School of Computer & Information
    Journal of Electronics(China), 2012, (Z2) : 211 - 214
  • [9] 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
  • [10] 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
12345