# Primpoly

An irreducible polynomial P(x) of degree n over a finite field p is primitive, if its order is equal to pn-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.

Define your search: up to polynomials of degree over p where p = , going , presented as explanation

Search starts:

• from the first polynomial.
• from a random polynomial.
• from a given polynomial: help

In order to access WIMS services, you need a browser supporting forms. In order to test the browser you are using, please type the word wims here: and press Enter''.