c++,polynomials,finite-field,galois-field

Looks like NTL is the solution. It gives comfortable implementation of GF(2^n) polynomials modulo some polynomial and easy work with matrices (inverse, solving, etc..)

You do sage: _.<X> = GF(2)[] sage: K.<x> = GF(2^8, modulus=X^8+X^4+X^3+X+1) sage: (x^8 + 1)^-1 x^7 + x^6 + x^5 + x^4 + x^3 + x^2 + 1 ...

matlab,polynomial-math,exponentiation,finite-field,polynomials

Try this u = f; for i=1:t [q{i},r{i}] = deconv(f,h); f = conv(f,u); end Your answer for each power will be in the cell array r....