# Primpoly

An irreducible polynomial $P\left(x\right)$ 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.

Define your search: up to polynomials of degree sur ${𝔽}_{p}$ where $p$ = , going , presented as Explanations

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''.

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. interactive exercises, online calculators and plotters, mathematical recreation and games
• Keywords: interactive mathematics, interactive math, server side interactivity, algebra, cryptology, finite_field, order, coding, cyclic_code