For example, let us use the finite field GF(2^4) with the irreducible polynomial f(x)=x^4+x+1. This yields a generator g that satisfies f(g)=0 with a value of g^4=g+1, or in binary, g=0010.
上面引自
CRYPTOGRAPHY AND NETWORK SECURITY PRINCIPLES AND PRACTICE, FIFTH EDITION
by William Stallings