Implementation of subquadratic GCD?

[Décio Luiz Gazzoni Filho]

Hello,

I'm working on an application which requires taking GCD with huge (100k-digit) 
integers. I believe the fastest GCD algorithm for integers in this range 
would be the subquadratic recursive GCD. Is anyone aware of a freely 
available implementation of this algorithm? (preferably in GMP, but anything 
will do)

Décio
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 190 bytes
Desc: not available
Url : http://gmplib.org/list-archives/gmp-discuss/attachments/20041201/3e5a880a/attachment.bin