A BSP Parallel Model for the Göttfert Algorithm over F2
In Niederreiter’s factorization algorithm for univariate polynomials over finite fields, the factorization problem is reduced to solving a linear system over the finite field in question, and the solutions are used to produce the complete factorization of the polynomial into irreducibles. For fields of characteristic 2, a polynomial time algorithm for extracting the factors using the solutions of the linear system was developed by Göttfert, who showed that it is sufficient to use only a basis for the solution set. In this paper, we develop a new BSP parallel algorithm based on the approach of Göttfert over the binary field, one that improves upon the complexity and performance of the original algorithm for polynomials over F2. We report on our implementation of the parallel algorithm and establish how it achieves very good efficiencies for many of the case studies.
Unable to display preview. Download preview PDF.
- 1.Niederreiter, H.: A New Efficient Factorization Algorithm for Polynomials over Small Finite Fields. In: AAECC, vol. 4, pp. 81–87 (1993)Google Scholar
- 6.Hill, J.M.D., McColl, W.F., Skillicorn, D.B.: Questions and Answers about BSP., Report PRG-TR-15-96, Oxford University Computing Laboratory (1996)Google Scholar
- 8.Abu Salem, F.: A BSP Parallel Model of the Göttfert Algorithm for Polynomial Factorization over F2, Report PRG-RR-03-14, Oxford University Computing Laboratory (July 2003)Google Scholar
- 9.Abu Salem, F.: A New Sparse Gaussian Elimination Algorithm and the Niederreiter Linear System for Trinomials over F2, Report PRG-RR-03-18, Oxford University Computing Laboratory (August 2003)Google Scholar