Calculation of 0x2d

m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) =   0x2d =  00101101 = x^5 + x^3 + x^2 + 1

m(x) = (x^3 + x + 1) * a(x) + (x^2)

Calculation of 0x2d^-1 in the finite field GF(2⁸)

00000100 = 00000001 * 100011011 + 00001011 * 101101
00000001 = 00001011 * 100011011 + 01000100 * 101101
00000000 = 00101101 * 100011011 + 100011011 * 101101

a^-1(x) = x^6 + x^2 = 01000100 = 0x44

The calculation of 0x2d^-1 is made with the Extended Euclidean algorithm. Instead of normal division and multiplication you need to use Polynomialdivision and Polynomialmultiplication.

Affine transformation over GF(2)

           1 0 0 0 1 1 1 1      0     1     0
           1 1 0 0 0 1 1 1      0     1     0
           1 1 1 0 0 0 1 1      1     0     0
           1 1 1 1 0 0 0 1      0     0     1
SBOX(2d) = 1 1 1 1 1 0 0 0   *  0  +  0  =  1
           0 1 1 1 1 1 0 0      0     1     0
           0 0 1 1 1 1 1 0      1     1     1
           0 0 0 1 1 1 1 1      0     0     1

SBOX(2d) = 11011000 = d8

For more information see FIPS 197.

Implemented by bachph [at] philba [dot] com