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 条
  • [31] On the k-operation linear complexity of periodic sequences (extended abstract)
    Kavuluru, Ramakanth
    Mapper, Andrew
    PROGRESS IN CRYPTOLOGY - INDOCRYPT 2007, 2007, 4859 : 322 - 330
  • [32] Linear Complexity of n-Periodic Cyclotomic Sequences over Fp
    Wang, Qiuyan
    Yan, Yang
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2020, E103A (05) : 785 - 791
  • [33] The k-error linear complexity distribution for -periodic binary sequences
    Zhou, Jianqin
    Liu, Wanquan
    DESIGNS CODES AND CRYPTOGRAPHY, 2014, 73 (01) : 55 - 75
  • [34] 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
  • [35] On the Linear Complexity of a Class of Periodic Sequences Derived from Euler Quotients
    LUO Bingyu
    ZHANG Jingwei
    ZHAO Chang'an
    ChineseJournalofElectronics, 2023, 32 (02) : 262 - 272
  • [36] FAST ADAPTIVE PARAFAC DECOMPOSITION ALGORITHM WITH LINEAR COMPLEXITY
    Viet-Dung Nguyen
    Abed-Meraim, Karim
    Nguyen Linh-Trung
    2016 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING PROCEEDINGS, 2016, : 6235 - 6239
  • [37] Efficient Algorithm for the Linear Complexity of Sequences and Some Related Consequences
    Chee, Yeow Meng
    Chrisnata, Johan
    Etzion, Tuvi
    Kiah, Han Mao
    2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 2897 - 2902
  • [38] Sequence complexity profiles of prokaryotic genomic sequences: A fast algorithm for calculating linguistic complexity
    Troyanskaya, OG
    Arbell, O
    Koren, Y
    Landau, GM
    Bolshoy, A
    BIOINFORMATICS, 2002, 18 (05) : 679 - 688
  • [39] Fast algorithm for determining the linear complexity of a pseudo-random sequence with period n2v
    Cai, Mian
    Wang, Lei
    Xiao, Guo-Zhen
    Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University, 2001, 28 (05): : 553 - 556
  • [40] An Efficient Algorithm for Determining the k-error Linear Complexity of Binary Sequences with Periods 2p(n)
    Wei, Shimin
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2008, 8 (04): : 221 - 224
12345