USER REVIEWS
Extended Euclidean Algorithm for polynomials over GF(2^m)
Contains two functions. The one function computes the greatest common divisor (gcd) of two polynomials a(x) and b(x) over GF(2^m). The other function performs the extended Euclidean algorithm where two polynomials u(x) and v(x) is calculated in...
WRITE USER REVIEW