'Irreducible polynomial in AES and GNU Octave

In the Rijndael AES proposal in section 2.1.2 they have chosen m(x) = x^8 + x^4 + x^3 + x + 1 and said it is an irreducible polynomial. This polynomial corresponds to integer 283.

Further in section 4.2.3, they have defined the value of M, the matrix used in MixColumn operation. I was trying to find its multiplicative inverse M⁻¹ in octave. I used the command

y = gf(M, 8, 283)

And octave gave me the following error:

error: gf: primitive polynomial (283) of Galois Field must be irreducible

Can anyone please help me in explaining why I am getting this error? I have very little knowledge of fields, groups and similar abstract concepts.

Sources

This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.

Source: Stack Overflow

Solution	Source

'Irreducible polynomial in AES and GNU Octave

Sources

Related Questions