Calculation of 0x03

m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) =   0x3 =  00000011 = x + 1

m(x) = (x^7 + x^6 + x^5 + x^4 + x^2 + x) * a(x) + (1)

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

00000001 = 00000001 * 100011011 + 11110110 * 11
00000000 = 00000011 * 100011011 + 100011011 * 11

a^-1(x) = x^7 + x^6 + x^5 + x^4 + x^2 + x = 11110110 = 0xf6

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

SBOX(03) = 01111011 = 7b

For more information see FIPS 197.

Implemented by bachph [at] philba [dot] com