Date: Wed, 08 Apr 1998 09:12:10 -0700
From: Oleg Mazurov <mazurov@pacbell.net>
To: Dave Rusin <rusin@math.niu.edu>
Subject: Re: Roots of a polynomial in GF(2^64). Algorithm needed.

Dave Rusin wrote:
<...>
> 
> State-of-the-art I don't know; I guess I thought one factored elements  f  of
> GF(q)[x] by computing their GCD with x^q-x. (This can be done modulo  f,
> so it's not so terrible.) There are pointers in several articles at
>         index/12FXX.html
> but if you get a better answer please let me know -- I can update that page.
> 
> dave

I did get a better one, so you may want to take a look and decide
if you want use something in your page ( which I ran across before
I posted my question, btw ).

http://www.comp.mq.edu.au/~igor/
http://www.cs.wisc.edu/~shoup/

Thank you,

	-- Oleg