有限域GF（p）上n次模多项式的自动选取

,Automatic Choice of n Degrees Module Polynomials over Finite Fleld GF(p)

设ｐ为一素数，ｎ（≥２）为一正整数。从有限域ＧＦ（ｐ）构造新的有限域ＧＦ（ｐｎ）时，关键的一步在于选取一个ＧＦ（ｐ）上的ｎ次不可约多项式作为模多项式中（θ）。利用多项式的移位相除法给出了可用以自动选取（θ）的一种顺序检测算法。

Let p be a prime number and n(≥2) be a positive integer.Acrucial step lies in taking a n degrees irreducible polynomlal over GF(p)as modulepolynomial (θ) when a new finitc field GF(pn)is,constructed from GF(p).A sequential measurement algorithm which can automatically choose(θ)is given,making use of the shifting division for polynomials.