Article View: sci.crypt
Article #3099Re: Primitive Polynomials (Mod 2)
From: Robert Ward
Date: Mon, 11 Jan 1993 18:38
Date: Mon, 11 Jan 1993 18:38
12 lines
1112 bytes
1112 bytes
1) Brillhart and Zierler are merely informing you that they had not, at the time of publication of their article, tested those T_n,k(x) for primitivity, only for irreducibility. 2) The correct statement is that if f(x) is a primitive irreducible polynomial over of degree n, then so is x^n*f(1/x) [after multiplying through to clear fractions]. This implies your first statement (for trinomials). Tetranomials can never be irreducible, much less primitive: they are divisible by x + 1. This also implies that x^p + x^q + x^r + x^s + 1 primitive iff x^p + x^(p-s) + x^(p-r) + x^(p-q) + 1 primitive. Robert L. Ward
Technical Details
Message-ID:
<1993Jan11.183829.16884@afterlife.ncsc.mil>Path:
arc1-ca.pugleaf.net!sparky!uunet!dtix!mimsy!afterlife!rlward1References:
<C0Jtyt.3HH@chinet.chi.il.us>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!dtix!mimsy!afterlife!rlward1 From: rlward1@afterlife.ncsc.mil (Robert Ward) Newsgroups: sci.crypt Subject: Re: Primitive Polynomials (Mod 2) Keywords: Primitive Polynomials (Mod 2) Message-ID: <1993Jan11.183829.16884@afterlife.ncsc.mil> Date: 11 Jan 93 18:38:29 GMT References: <C0Jtyt.3HH@chinet.chi.il.us> Sender: rlward1@afterlife.ncsc.mil (Robert L. Ward) Followup-To: sci.crypt Organization: National Computer Security Center Lines: 12