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. serveur web interactif avec des cours en ligne, des exercices interactifs, des calculatrices et traceurs en ligne
- Keywords: serveur interactif, enseignement, cours en ligne, ressources pédagogiques, sciences, langues, qcm,classes,exercices, algebra, cryptology, finite_field, order, coding, cyclic_code