Algorithm for recursively generating irreduciblepolynomials
Mengyu Wang · Electronics Letters · 1996
A simple method for checking the irreducibility of f(x2+x+1) and f(x2+x) over GF(2) is described. An algorithm that recursively generates irreducible polynomials is presented. These irreducible polynomials are useful in constructing finite fields for applications in error-correcting codes and cryptography.