Re: references for an efficient algorithm for extended euclidean algorithm?

Jaco Versfeld schrieb:
> 
> Hi,
> 
> I want to implement an extended Euclidean algorithm in MATLAB that can
> compute the following: GCD(A(x),B(x)) = u(x)A(x) + v(x)B(x), where
> A(x), B(x), u(x) and v(x) are from GF(2^m).

You could use gcd from PARI-GP
hth
Klaus

> 
> I have a basic understanding how this works for integers, but don't
> want to re-invent the wheel for the above case.  I did a search on
> IEEEXPLORE, and the closest hit that I got was from Mandelbaum,
> although this was a hardware implementation.  Does anyone have perhaps
> pointers to literature where this is clearly explained?
> 
> (I once got a glimpse of such a technique in a textbook, but I spent
> the whole morning trying to find the book in the library without
> success.  It did something with a matrix)
> 
> I will greatly appreciate any suggestions and help
> Jaco