Abstract
We present a new deterministic factorization algorithm for polynomials over a finite prime fieldF p . As in other factorization algorithms for polynomials over finite fields such as the Berlekamp algorithm, the key step is the “linearization” of the factorization problem, i.e., the reduction of the problem to a system of linear equations. The theoretical justification for our algorithm is based on a study of the differential equationy (p−1)+y p=0 of orderp−1 in the rational function fieldF p(x). In the casep=2 the new algorithm is more efficient than the Berlekamp algorithm since there is no set-up cost for the coefficient matrix of the system of linear equations.
Similar content being viewed by others
References
Berlekamp, E. R.: Factoring polynomials over finite fields. Bell System Tech. J.46, 1853–1859 (1967)
Camion, P.: A deterministic algorithm for factorizing polynomials ofF q [X]. Ann. Discrete Math.17, 149–157 (1983)
Knuth, D. E.: The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 2nd ed. Reading, MA: Addison-Wesley 1981
Lidl, R., Niederreiter, H.: Finite Fields. Reading, MA: Addison-Wesley 1983
Mignotte, M.: Mathématiques pour le calcul formel. Paris: Presses Universitaires de France 1989
Willett, M.: Factoring polynomials over a finite field. SIAM J. Appl. Math.35, 333–337 (1978)
Göttfert, R.: The Niederreiter factorization algorithm is polynomial time in characteristic 2. Preprint, 1992
Niederreiter, H.: Factorization of polynomials and some linear algebra problems over finite fields. Preprint, 1992
Niederreiter, H.: Factoring polynomials over finite fields using differential equations and normal bases. Preprint, 1992
Niederreiter, H., Göttfert, R.: Factorization of polynomials over finite fields and characteristic sequences. Preprint, 1992
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Niederreiter, H. A new efficient factorization algorithm for polynomials over small finite fields. AAECC 4, 81–87 (1993). https://doi.org/10.1007/BF01386831
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01386831