Calculation of 0x1a

m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) =   0x1a =  00011010 = x^4 + x^3 + x

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

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

00000011 = 00000001 * 100011011 + 00011100 * 11010
00000001 = 00001001 * 100011011 + 11111101 * 11010
00000000 = 00011010 * 100011011 + 100011011 * 11010

a^-1(x) = x^7 + x^6 + x^5 + x^4 + x^3 + x^2 + 1 = 11111101 = 0xfd

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

SBOX(1a) = 10100010 = a2

For more information see FIPS 197.

Implemented by bachph [at] philba [dot] com