A new probabilistic algorithm for factoring univariate polynomials over finite fields is presented. To factor a polynomial of degreen overF q , the number of arithmetic operations inF q isO((nâ€¦ (More)

Finding the factorization of a polynomial over a finite field is of interest not only independently but also for many applications in computer algebra, algebraic coding theory, cryptography, andâ€¦ (More)

For many applications from the areas of cryptography and coding, finite field multiplication is the most resource and time consuming operation. We have designed and optimized four high performanceâ€¦ (More)

23rd Annual Symposium on Foundations of Computerâ€¦

1982

We present parallel algorithms to compute the determinant and characteristic polynomial of nÃ—n-matrices and the gcd of polynomials of degree â‰¤n. The algorithms use parallel time O(log2n) and aâ€¦ (More)

Optimal sequential and parallel algorithms for exponentiation in a finite field containing F q are presented, assuming thatqth powers can be computed for free.