An irreducible polynomial P(x) of degree n over a finite field
_{p} is primitive, if its order is equal to
p^{n}-1.

This tool allows you to search for primitive polynomials over prime fields
_{p}, where p is a prime. This is a service to
education and scientific research; we strongly advise against using the
results of these searches in real crypting.