Fast Extended Euclid Algorithm

[Barry Gergel]

Hi all,

I was wondering if there is anyone who has implemented a fast 
(sub-quadratic) extended euclid algorithm in gmp? We are working on a 
project that does alot of gcd calculations (billions of digits), and 
the quadratic implementation is fast enough. If no one has, is gmp 
interested in doing this?

pax et bonum,
Barry Gergel

Undergraduate Student
Dept of Computer Science and Mathematics
University of Lethbridge
Alberta, Canada