Proceedings of CRYPTO 84 on Advances in cryptology
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Managing duplicates in a web archive
Proceedings of the 2006 ACM symposium on Applied computing
| Hi-index | 0.00 |
We present probabilistic algorithms for the problems of finding an irreducible polynomial of degree n over a finite field, finding roots of a polynomial and factoring the polynomial into its irreducible factors over a finite field. All of these problems are of importance in algebraic coding theory, algebraic symbol manipulation, and number theory. These algorithms have a very transparent, easy to program structure. For finite fields of large characteristic p, so that exhaustive search throng z is not feasible, our algorithms are of lower order in the degrees of the polynomial and fields in question than previously published algorithms.