A new algorithm for factoring polynomials over finite fields
HTML articles powered by AMS MathViewer
- by David G. Cantor and Hans Zassenhaus PDF
- Math. Comp. 36 (1981), 587-592 Request permission
Abstract:
We present a new probabilistic algorithm for factoring polynomials over finite fields.References
- E. R. Berlekamp, Factoring polynomials over large finite fields, Math. Comp. 24 (1970), 713–735. MR 276200, DOI 10.1090/S0025-5718-1970-0276200-X J. Calmet & R. Loos, An Improvement of Rabin’s Probabilistic Algorithm for Generating Irreducible Polynomials Over $GF(p)$, Interner Bericht Nr. 3/80, Universität Karlsruhe, West Germany.
- Donald E. Knuth, The art of computer programming, 2nd ed., Addison-Wesley Series in Computer Science and Information Processing, Addison-Wesley Publishing Co., Reading, Mass.-London-Amsterdam, 1975. Volume 1: Fundamental algorithms. MR 0378456 D. H. Lehmer, "Computer technology applied to the theory of n numbers," Studies in Number Theory (W. J. LeVeque, Ed.,), Math. Assoc. of America, 1969.
- Robert T. Moenck, On the efficiency of algorithms for polynomial factoring, Math. Comp. 31 (1977), no. 137, 235–250. MR 422193, DOI 10.1090/S0025-5718-1977-0422193-8
- Michael O. Rabin, Probabilistic algorithms in finite fields, SIAM J. Comput. 9 (1980), no. 2, 273–280. MR 568814, DOI 10.1137/0209024
- Daniel Shanks, Five number-theoretic algorithms, Proceedings of the Second Manitoba Conference on Numerical Mathematics (Univ. Manitoba, Winnipeg, Man., 1972) Congressus Numerantium, No. VII, Utilitas Math., Winnipeg, Man., 1973, pp. 51–70. MR 0371855
Additional Information
- © Copyright 1981 American Mathematical Society
- Journal: Math. Comp. 36 (1981), 587-592
- MSC: Primary 12C05; Secondary 12-04
- DOI: https://doi.org/10.1090/S0025-5718-1981-0606517-5
- MathSciNet review: 606517