A fast algorithm for determining the minimal polynomial of a sequence with period 2p(n) GF (q)

A fast algorithm is presented for determining the linear complexity and the minimal polynomial of a sequence with period 2p(n) over GF (q), where p and q are odd prime, and q is a primitive root (mod p(2)). The algorithm uses the fact that in this case the factorization of x(2)p(n) - 1 is especially simple.Computer Science, Information SystemsEngineering, Electrical & ElectronicSCI(E)EI12ARTICLE102754-27584