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

This tool allows you to search for primitive polynomials over prime fields ${\mathbb{F}}_{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.

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. This is the main site of WIMS (WWW Interactive Multipurpose Server): interactive exercises, online calculators and plotters, mathematical recreation and games

Keywords: wims, mathematics, mathematical, math, maths, interactive mathematics, interactive math, interactive maths, mathematic, online, calculator, graphing, exercise, exercice, puzzle, calculus, K-12, algebra, mathématique, interactive, interactive mathematics, interactive mathematical, interactive math, interactive maths, mathematical education, enseignement mathématique, mathematics teaching, teaching mathematics, algebra, geometry, calculus, function, curve, surface, graphing, virtual class, virtual classes, virtual classroom, virtual classrooms, interactive documents, interactive document, algebra, cryptology, finite_field, order, coding, cyclic_code