Symbolic integration: the stormy decade
Communications of the ACM
Symbolic integration the stormy decade
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
Human perfectly secure message transmission protocols and their applications
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
| Hi-index | 0.02 |
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 space required by these algorithms are algebraic in both the degree of the polynomial to be factored and the logarithm of the order of the finite field. Certain observations on the application of these methods to the factorization of polynomials over the rational integers are also included.