Abstract
An important factorization algorithm for polynomials over finite fields was developed by Niederreiter. 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. One charactersistic feature of the linear system arising in the Niederreiter algorithm is the fact that, if the polynomial to be factorized is sparse, then so is the Niederreiter matrix associated with it. In this paper, we investigate the special case of factoring trinomials over the binary field. We develop a new algorithm for solving the linear system using sparse Gaussian elmination with the Markowitz ordering strategy. Implementing the new algorithm to solve the Niederreiter linear system for trinomials over F2 suggests that, the system is not only initially sparse, but also preserves its sparsity throughout the Gaussian elimination phase. When used with other methods for extracting the irreducible factors using a basis for the solution set, the resulting algorithm provides a more memory efficient and sometimes faster sequential alternative for achieving high degree trinomial factorizations over F2.
Similar content being viewed by others
References
P. Roelse (1999) ArticleTitleFactoring high-degree polynomials over F2 with Niederreiter's algorithm on the IBM SP2 Math. Comp. 68 869–880 Occurrence Handle10.1090/S0025-5718-99-01008-X Occurrence Handle1042.11084 Occurrence Handle99i:11112
P. Fleischmann M. Holder P. Roelse (2003) ArticleTitleThe black-box Niederreiter algorithm and its implementation over the binary field Math. Comp. 72 1887–1899 Occurrence Handle10.1090/S0025-5718-03-01494-7 Occurrence Handle2004b:11170
S. Gao J. von zur Gathen (1994) ArticleTitleBerlekamp's and Niederreiter's polynomial factorization algorithms Contemp. Math. 168 101–116 Occurrence Handle95f:11106
E. R. Berlekamp (1967) ArticleTitleFactoring polynomials over finite fields Bell Sys. Tech. J. 46 1853–1859 Occurrence Handle0166.04901 Occurrence Handle36 #2314
H. Niederreiter (1993) ArticleTitleA new efficient factorization algorithm for polynomials over small finite fields AAECC 4 81–87 Occurrence Handle10.1007/BF01386831 Occurrence Handle0776.11070 Occurrence Handle94h:11112
H. Niederreiter (1993) ArticleTitleFactorization of polynomials and some linear algebra problems over finite fields Lin. Alg. Appl. 192 301–328 Occurrence Handle10.1016/0024-3795(93)90247-L Occurrence Handle0845.11042 Occurrence Handle95b:11114
H. Niederreiter (1994) ArticleTitleFactoring polynomials over finite fields using differential equations and normal bases Math. Comp. 62 819–830 Occurrence Handle0797.11092 Occurrence Handle94g:11113
H. Niederreiter R. Göttfert (1993) ArticleTitleFactorization of polynomials over finite fields and characteristic sequences J. Symb. Comp. 16 401–412
F. G. Gustavson (1972) Some basic techniques for solving sparse systems of linear equations D. J. Rose R. A. Willoughby (Eds) Sparse matrices and their applications Plenum Press New York 41–52
R. Göttfert (1994) ArticleTitleAn acceleration of the Niederreiter factorization algorithm in characteristic 2 Math. Comp. 62 831–839 Occurrence Handle0797.11093 Occurrence Handle94g:11110
J. von zur Gathen J. Gerhard (1999) Modern Computer algebra Cambridge University Press Cambridge
P. Fleischmann (1993) ArticleTitleConnections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over F q Lin. Alg. Appl. 192 101–108 Occurrence Handle10.1016/0024-3795(93)90238-J Occurrence Handle0845.11041 Occurrence Handle94f:11129
T. C. Y. Lee S. A. Vanstone (1995) ArticleTitleSubspaces and polynomial factorizations over finite fields AAECC 6 147–157 Occurrence Handle10.1007/BF01195333 Occurrence Handle96b:11156
I. S. Duff A. M. Erisman J. K. Reid (1986) Direct methods for sparse matrices Oxford University Press New York
A. F. Stappen Particlevan der R. H. Bisseling J. G. G. Vorst Particlevan de (1993) ArticleTitleParallel sparse LU decomposition on a mesh network of transputers SIAM J. Matrix Anal. Appl. 14 853–879 Occurrence Handle94e:65039
H. M. Markowitz (1957) ArticleTitleThe elimination form of the inverse and its application to linear programming Management Sci. 3 255–269 Occurrence Handle0995.90592 Occurrence Handle22 #3098
A. R. Curtis J. K. Reid (1971) ArticleTitleThe solution of large sparse unsymmetric systems of linear equations J. Inst. Math. Appl. 8 344–353
Abu Salem, F.: A BSP parallel model of the Göttfert algorithm for polynomial factorization over F2. PPAM 2003, Lecture Notes in Computer Science, vol. 3019, 217–224 (2004).
von zur Gathen, J., Gerhard, J.: Arithmetic and factorization of polynomials over F2. Proc. ISSAC 96. Zurich: ACM Press, pp. 1–9.
O. Bonorden J. von zur Gathen J. Gerhard O. Muller M. Nocker (2001) ArticleTitleFactoring a binary polynomial of degree over one million ACM SIGSAM Bull. 35 IssueID1 16–18
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Abu Salem, F.K. A New Sparse Gaussian Elimination Algorithm and the Niederreiter Linear System for Trinomials over F2. Computing 77, 179–203 (2006). https://doi.org/10.1007/s00607-005-0154-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-005-0154-y