A New Algorithm for Factoring Polynomials Over Finite Fields
- 1 April 1981
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 36 (154), 587-592
- https://doi.org/10.2307/2007663
Abstract
We present a new probabilistic algorithm for factoring polynomials over finite fields.Keywords
This publication has 3 references indexed in Scilit:
- Probabilistic Algorithms in Finite FieldsSIAM Journal on Computing, 1980
- On the Efficiency of Algorithms for Polynomial FactoringMathematics of Computation, 1977
- Factoring Polynomials Over Large Finite FieldsMathematics of Computation, 1970