Calculation of 0x16

m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) =   0x16 =  00010110 = x^4 + x^2 + x

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

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

00001111 = 00000001 * 100011011 + 00010110 * 10110
00000111 = 00000011 * 100011011 + 00111011 * 10110
00000001 = 00000111 * 100011011 + 01100000 * 10110
00000000 = 00010110 * 100011011 + 100011011 * 10110

a^-1(x) = x^6 + x^5 = 01100000 = 0x60

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

SBOX(16) = 01000111 = 47

For more information see FIPS 197.

Implemented by bachph [at] philba [dot] com