Calculation of 0x0b

m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) =   0xb =  00001011 = x^3 + x + 1

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

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

00000100 = 00000001 * 100011011 + 00101101 * 1011
00000011 = 00000010 * 100011011 + 01011011 * 1011
00000001 = 00000111 * 100011011 + 11000000 * 1011
00000000 = 00001011 * 100011011 + 100011011 * 1011

a^-1(x) = x^7 + x^6 = 11000000 = 0xc0

The calculation of 0x0b^-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     1
           1 1 0 0 0 1 1 1      0     1     1
           1 1 1 0 0 0 1 1      0     0     0
           1 1 1 1 0 0 0 1      0     0     1
SBOX(0b) = 1 1 1 1 1 0 0 0   *  0  +  0  =  0
           0 1 1 1 1 1 0 0      0     1     1
           0 0 1 1 1 1 1 0      1     1     0
           0 0 0 1 1 1 1 1      1     0     0

SBOX(0b) = 00101011 = 2b

For more information see FIPS 197.

Implemented by bachph [at] philba [dot] com