A Fast Algorithm for Determining the Minimal Polynomial of a Sequence With Period Over GF

A fast algorithm is presented for determining the linear complexity and the minimal polynomial of a sequence with period over GF , where and are odd prime, and is a primitive root . The algorithm uses the fact that in this case the factorization of is especially simple.