Implementation of subquadratic GCD?

Décio Luiz Gazzoni Filho decio at
Wed Dec 1 16:32:35 CET 2004


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)

-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 190 bytes
Desc: not available
Url :

More information about the gmp-discuss mailing list