Title :
A fast algorithm for determining the minimal polynomial where of a sequence with period 2pn over GF (q)
Author :
Wei, Shimin ; Xiao, Guozhen ; Chen, Zhong
Author_Institution :
Dept. of Comput. Sci. & Technique, Peking Univ., Beijing, China
fDate :
10/1/2002 12:00:00 AM
Abstract :
A fast algorithm is presented for determining the linear complexity and the minimal polynomial of a sequence with period 2pn over GF (q), where p and q are odd prime, and q is a primitive root (mod p2). The algorithm uses the fact that in this case the factorization of x2p(n)-1 is especially simple.
Keywords :
Galois fields; binary sequences; computational complexity; number theory; polynomials; GF; Galois field; binary sequence; computational complexity; fast algorithm; finite field theory; linear complexity; minimal polynomial; number theory; Binary sequences; Computer science; Cryptography; Galois fields; Information security; Laboratories; Mathematics; Polynomials;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2002.802609
