Some Computational Aspects of Root Finding in GF(qm)

This paper is an implementation report comparing several variations of a deterministic algorithm for finding roots of polynomials in finite extension fields. Running times for problem instances in fields GF(2m), including m>1000, are given. Comparisons are made between the variations, and improvements achieved in running times are discussed.

[1]  D. Cantor,et al.  A new algorithm for factoring polynomials over finite fields , 1981 .

[2]  Paul C. van Oorschot,et al.  A geometric approach to root finding in GF(qm) , 1989, IEEE Trans. Inf. Theory.

[3]  Michael O. Rabin,et al.  Probabilistic Algorithms in Finite Fields , 1980, SIAM J. Comput..

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

[5]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[6]  Ronald C. Mullin,et al.  Optimal normal bases in GF(pn) , 1989, Discret. Appl. Math..

[7]  Rudolf Lide,et al.  Finite fields , 1983 .