Factoring polynomials over large finite fields*


This paper reviews some of the known algorithms for factoring polynomials over finite fields and presents a new deterministic procedure for reducing the problem of factoring an arbitrary polynomial over the Galois field GF(p m) to the problem of finding the roots in GF(p) of certain other polynomials over GF(p). The amount of computation and the storage… (More)
DOI: 10.1145/800204.806290


1 Figure or Table


Citations per Year

405 Citations

Semantic Scholar estimates that this publication has 405 citations based on the available data.

See our FAQ for additional information.