Abstract :
A method is described of finding the minimum polynomial of an arbitrary, nonzero element of GF(2m). This method requires finite arithmetic on only a single element of the field, and not on each of the k+1 coefficients over GF(2m), where k is the degree of the minimum polynomial. Applications include the design of error-correcting codes and of apparatus to process them, as well as cryptographic systems.
