Re: Bruce Schneier - errors in table of primitive polynomials mod 2


Hans wrote:
Phil Carmody schrieb:


Maybe you got me wrong: the question for which I was advised to this
group is:
How can I check if a polynom mod 2 is primitive?

Primitive for what finite field? A finite field of degree d is the
quotient field
F_p[x]/ (q(x)) where q(x) is an irreducible polynomial of degree
d. and p is prime.

q(x) is *primitive* if its powers generate the entire field. For this
to happen
q(x) must divide x^s - 1 where s is the ORDER of the finite field.

.