Calculation of 0xcc

m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) =   0xcc =  11001100 = x^7 + x^6 + x^3 + x^2

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

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

01001111 = 00000001 * 100011011 + 00000011 * 11001100
00011101 = 00000011 * 100011011 + 00000100 * 11001100
00000001 = 00001011 * 100011011 + 00011011 * 11001100
00000000 = 11001100 * 100011011 + 100011011 * 11001100

a^-1(x) = x^4 + x^3 + x + 1 = 00011011 = 0x1b

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

SBOX(cc) = 01001011 = 4b

For more information see FIPS 197.

Implemented by bachph [at] philba [dot] com