Abstract
We generalise the Cantor-Zassenhaus algorithm for factoring polynomials over finite fields. The generalisation yields a class of factorisation algorithms. We compute their factorisation probability and their least upper bound. We then give a simple characterisation of the algorithms reaching the least upper bound. As an example we show the Cantor-Zassenhaus and the Ben-Or algorithms have a factorisation probability equal to the least upper bound.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ben-Or, M.: Probabilistic algorithms in finite fields. Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, IEEE, 394–398 (1981).
Berlekamp, E. R.: Factoring polynomials over finite fields. Bell System Techn. J.46, 1853–1859 (1967).
Camion, P.: Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials. IEEE Trans. Information Theory29, 378–385 (1983).
Camion, P.: A deterministic algorithm for factorting polynomials overF q[X]. Ann. Discr. Math.17, 149–157 (1983).
Cantor, D. G., Zassenhaus, H.: A new algorithm for factoring polynomials over finite fields. Math. Comp.36, 587–592 (1981).
von zur Gathen, J., Shoup, V.: Computing Frobenius maps and factoring polynomials. Comput. Complexity2, 187–224 (1992).
Knuth, D. E.: The art of computer programming2, 2nd ed. Reading, Mass.: Addison-Wesley, 1981.
Stewart, I., Tall, D.: Algebraic number theory. London: Chapman and Hall, 1979.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hidber, C. A generalisation of the Cantor-Zassenhaus algorithm. Computing 59, 325–330 (1997). https://doi.org/10.1007/BF02684415
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02684415