论文信息 - A Deterministic Algorithm for Factorizing Polynomials over Extensions GF(p m ) of GF(p), p a Small Prime

A Deterministic Algorithm for Factorizing Polynomials over Extensions GF(p m ) of GF(p), p a Small Prime

Abstract A deterministic algorithm to factorize polynomials in GF(pm )[X] into irreducible factors over GF(pm ) (p prime, m>1) is proposed. The main idea is the use of two trace functions to define a new set of factorizing polynomials. The method appears efficient when p is a small prime; the degree m of extension may be large.

A. T. Ly

[1] D. A. Burgess. On Character Sums and Primitive Roots , 1962 .

[2] E. Berlekamp. Factoring polynomials over finite fields , 1967 .

[3] E. Berlekamp. Factoring polynomials over large finite fields* , 1970, SYMSAC '71.

[4] Robert T. Moenck,et al. On the efficiency of algorithms for polynomial factoring , 1977 .

[5] Paul Camion. Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials , 1983, IEEE Trans. Inf. Theory.