Quick Algorithm for Searching Primitive Polynomial

Primitive elements and primitive polynomial play very important roles in the theory of the finite field.It is the premise of solving the problem about code sequences and searching the primitive elements can come down to searching primitive polynomial.This paper gives a new algorithm for searching primitive polynomials in the binary field making use of the algorithm for searching the minimal polynomial,and also gives out the minimal polynomial in the searching process.It shows the efficiency analysis of the algorithm.