!! used as default html header if there is none in the selected theme.
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.
The most recent version This page is not in its usual appearance because WIMS is unable to recognize your
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