>The library gmp (GNU multi-precision) uses this algorithm
>although it is much slower than FFT-like methods.
>Maybe because it only involves integers,
>and there is no danger at all of rounding errors.
>I once wrote a gmp-based program to perform LL tests:
>for low exponents it worked fine but for the prime 65537
>it already took much longer that mprime.
Could you tell me how to find this gmp library? I searched gnu.org site
for it, but I couldn't find anything.
______________________________________________________
Get Your Private, Free Email at http://www.hotmail.com
