Primpoly

An irreducible polynomial P(x) of degree n over a finite field FFp is primitive, if its order is equal to pn-1.

This tool allows you to search for primitive polynomials over prime fields FFp, 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 FFp where p = , going , presented as explanation

Search starts:


This page is not in its usual appearance because WIMS is unable to recognize your web browser.

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. 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, primitive polynomial, order, code, cyclic code, crypt