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

This tool allows you to search for primitive polynomials over prime fields
, 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.

The most recent version

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.

- Description: search for primitive polynomials over a finite field. Serveur Wims de l'ESPE-Nice-Toulon - Université de Nice - Sophia Antipolis
- Keywords: interactive mathematics, interactive math, server side interactivity, algebra, cryptology, finite_field, order, coding, cyclic_code