This is a problem similar to one of my homework problems, but not on the homework. The problem states that:
Find a primitive root β of F2[x]/(x4+x3+x2+x+1).
Questions:
I know what a primitive root of a prime number is, but what is a primitive root of a polynomial (or is it called something like a field extension here)?
My book gives this hint: [x]=α doesn't work because α5=1. There are eight choices of β. I am basically lost on the hint. What is α? Why doesn't it work? Why are there 8 choices for β? Wouldn't there be 24=16 choices? (or that's the number of polynomials in the field?)
Sorry for the long questions, since I am quite lost right now. Hopefully my questions make sense, and any help would be appreciated!
Answer
The multiplicative group of nonzero elements of a finite field is always cyclic. A "primitive root" of a finite field is a generator for the multiplicative group of nonzero elements.
Note that x4+x3+x2+x+1 is irreducible over F2: it has no roots, and it is not the product of two irreducible quadratics (the quadratics are x2, x2+1, x2+x, and x2+x+1, and the only irreducible one is the latter; but (x2+x+1)2=x4+x2+1). So F2[x]/(x4+x3+x2+x+1 is a field of degree 4 over F2 (hence, of order 24=16). So you are looking for an element in the field of 16 elements whose multiplicative order is exactly 15. The book is noting that even though this field equals F2(α) (where α is the class of x in the quotient), α doesn't work because it is of order 5. That is: while it is true that if β is a primitive root for the field GF(pk), then GF(pk)=Fp(β), the converse does not necessarily hold as this example shows.
No comments:
Post a Comment