Re: Bruce Schneier - errors in table of primitive polynomials mod 2
- From: "Pubkeybreaker" <Robert_silverman@xxxxxxxxxxxx>
- Date: 5 Jan 2007 09:38:39 -0800
Phil Carmody schrieb:
Maybe you got me wrong: the question for which I was advised to this
How can I check if a polynom mod 2 is primitive?
Primitive for what finite field? A finite field of degree d is the
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
q(x) must divide x^s - 1 where s is the ORDER of the finite field.
- Prev by Date: Re: Information Representation in Brain - Superposition & Cryptography
- Next by Date: Re: Encryption - How to Choose Password
- Previous by thread: Re: Bruce Schneier - errors in table of primitive polynomials mod 2
- Next by thread: Re: Bruce Schneier - errors in table of primitive polynomials mod 2