An irreducible polynomial of degree over a finite field is primitive, if its order is equal to .
This tool allows you to search for primitive polynomials over prime fields , where 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.
Please take note that WIMS pages are interactively generated; they are not ordinary HTML files. They must be used interactively ONLINE. It is useless for you to gather them through a robot program.