Abstract
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 F 2. We report on our implementation of the parallel algorithm and establish how it achieves very good efficiencies for many of the case studies.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Niederreiter, H.: A New Efficient Factorization Algorithm for Polynomials over Small Finite Fields. In: AAECC, vol. 4, pp. 81–87 (1993)
Göttfert, G.: An Acceleration of the Niederreiter Factorization Algorithm in Characteristic 2. Math. Comp. 62, 831–839 (1994)
Niederreiter, H.: Factorization of Polynomials and some Linear Algebra Problems over Finite Fields. Lin. Alg. and its App. 192, 301–328 (1993)
Niedrreiter, H.: Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases. Mathematics of Computation 62, 819–830 (1994)
Valiant, L.G.: A Bridging Model for Parallel Computation. Comm. of the ACM 33, 103–111 (1990)
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)
Hill, J.M.D., McColl, W.F., Stefanescu, D.C., Goudrea, M.W., Lang, K., Rao, S.B., Suel, T., Tsantilas, T., Bisseling, R.H.: BSPlib: The BSP Programming Library. Parallel Computing 24, 1947–1980 (1998)
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)
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)
Roelse, P.: Factoring High-Degree Polynomials over F2 with Niederreiter’s Algorithm on the IBM SP2. Math. Comp. 68, 869–880 (1999)
Fleischmann, P., Holder, M., Roelse, P.: The Black-Box Niederreiter Algorithm and its Implementation over the Binary Field. Math. Comp. 72, 1887–1899 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Salem, F.A. (2004). A BSP Parallel Model for the Göttfert Algorithm over F 2 . In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-24669-5_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21946-0
Online ISBN: 978-3-540-24669-5
eBook Packages: Springer Book Archive