Problem with transformations in Rijndael's finite field

[qxcdz]

I'm trying to implement AES as practice for my C++ skills, but I've come across a confusing problem that I think belongs here rather than in programming.

Rijndael's finite field is GF(2⁸), with reducing polynomial x⁸+x⁴+x³+x+1

There is a step in the algorithm that takes a polynomial a(x)=a₃x³+ a₂x²+a₁x+a₀ with coefficients in GF(2⁸), and multiplies it by a polynomial b(x)=b₃x³+ b₂x²+b₁x+b₀

and reduces it modulo x⁴+1, to get d(x)=d₃x³+ d₂x²+d₁x+d₀

This operation is equivalent, if a is a constant polynomial, according to the text, to the matrix multiplication:

$$\left( \begin{array}{c}<br /> d_0 \\<br /> d_1 \\<br /> d_2 \\<br /> d_3 \end{array} \right)=<br /> \left( \begin{array}{cccc}<br /> a_0 & a_3 & a_2 & a_1 \\<br /> a_1 & a_0 & a_3 & a_2 \\<br /> a_2 & a_1 & a_0 & a_3 \\<br /> a_3 & a_2 & a_1 & a_0 \end{array} \right)<br /> \left( \begin{array}{c}<br /> b_0 \\<br /> b_1 \\<br /> b_2 \\<br /> b_3 \end{array} \right)$$

it gives the constant polynomial a(x) as $$a(x)=\{03\}x^3+\{01\}x^2+\{01\}x+\{02\}$$, and the inverse polynomial $$a^{-1}(x)=\{0b\}x^3+\{0d\}x^2+\{09\}x+\{0e\}$$ (all numbers in curly braces are hexadecimal).

Now, being as I'm using a computer to do this, and proper polynomial handling is hard to do, I'm using the matrix multiplication to do the calculation. Now, if I'm thinking about this properly, then the matrix representations of $$a(x)$$ and $$a^{-1}(x)$$ should have a product that is a unit matrix. But, if my calculations (done by my program) are correct, then:
$$\left( \begin{array}{cccc}<br /> \{02\} & \{03\} & \{01\} & \{01\} \\<br /> \{01\} & \{02\} & \{03\} & \{01\} \\<br /> \{01\} & \{01\} & \{02\} & \{03\} \\<br /> \{03\} & \{01\} & \{01\} & \{02\} \end{array} \right)<br /> \left( \begin{array}{cccc}<br /> \{0e\} & \{0b\} & \{0d\} & \{09\} \\<br /> \{09\} & \{0e\} & \{0b\} & \{0d\} \\<br /> \{0d\} & \{09\} & \{0e\} & \{0b\} \\<br /> \{0b\} & \{0d\} & \{09\} & \{0e\} \end{array} \right)=<br /> \left( \begin{array}{cccc}<br /> \{01\} & \{00\} & \{e5\} & \{00\} \\<br /> \{00\} & \{01\} & \{00\} & \{e5\} \\<br /> \{e5\} & \{00\} & \{01\} & \{00\} \\<br /> \{00\} & \{e5\} & \{00\} & \{01\} \end{array} \right)$$

Which is almost a unit matrix, but not quite. And, when I use these polynomials to calculate the function, and then the inverse, I get a different polynomial to my input. I checked my matrix multiplication algorithm, it seems to be working fine.

Two other matrices that should have a unit matrix product (for another step in the algorithm) do. I'm definitely doing finite field arithmetic. I'm using a logarithm table for my multiplication, base three, which I know for a fact is a generator. I can't find anything wrong with the procedure, so I'm asking you guys if you could please tell me why it doesn't work.

 

[daveyinaz]

Are those hex values or something?

 

[qxcdz]

Yeah, that's how they're normally stated. Should I convert to decimal?

 

[daveyinaz]

I have no idea if that would make a difference. I've never thought of using base 16 when doing matrix operations. I'd be interested to find out though.

 

[qxcdz]

I meant for readability, base only makes a difference for the humans reading the numbers.

 

[daveyinaz]

I guess.
So {02}{0e} + {03}{09} + {01}{0d} + {01}{0b} = {01} ?

I don't man, all that only for human talk. To me, that don't look right.

 

[qxcdz]

You do realize that I'm talking about a finite field, right? That equality is indeed correct, using finite field operations.

 

[daveyinaz]

Well I guess it's all just over my head then. Of course, if that equality is correct then it's clear that there's a problem with something that you are not taking into account as your multiplication is coming out incorrect.