BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-83-991
       ENTRY:: May 29, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Parallel algorithms for arithmetics, irreducibility and
               factoring of GFq-polynomials
        TYPE:: Technical Report
      AUTHOR:: Morgensteren, Moshe
      AUTHOR:: Shamir, Eli
        DATE:: December 1983
       PAGES:: 12
    ABSTRACT:: A new algorithm for testing irreducibility of polynomials
               over finite fields without gcd computations makes it possible
               to devise efficient parallel algorithms for polynomial
               factorization. We also study the probability that a random
               polynomial over a finite field has no factors of small
               degree.
       NOTES:: [Adminitrivia V1/Prg/19950529]
         END:: STAN//CS-TR-83-991