Fast algorithms for determining the linear complexities of sequences over GF(p^(m)）with the period 3n
Fast algorithms for determining the linear complexities of sequences over GF(p^m) with the period 3n作者机构：Department of Computing and Information Technology Fudan University Shanghai 200433 China
出 版 物：《Science China Mathematics》 (中国科学：数学（英文版）)
年 卷 期：2006年第49卷第5期
页 面：715-720页
核心收录：
基 金：supported by the National Natural Science Foundation of China(Grant Nos.60542006 60433050&10225106)
主 题：number theory of the finite field, cryptography, stream cipher, fast algorithm.
摘 要：In this paper, for the the primes p such that 3 is a divisor of p - 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(pm)(any positive integer m) with the period 3n (n and pm - 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-lmamura algorithm, we can determine the linear complexity of any sequence over GF(pm) with the period 3n (n and pm - 1 are coprime) more efficiently.
维普期刊数据库
同方期刊数据库