Calculation of 0xf9

m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) =   0xf9 =  11111001 = x^7 + x^6 + x^5 + x^4 + x^3 + 1

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

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

00010000 = 00000001 * 100011011 + 00000011 * 11111001
00001001 = 00001111 * 100011011 + 00010000 * 11111001
00000010 = 00011111 * 100011011 + 00100011 * 11111001
00000001 = 01110011 * 100011011 + 10011100 * 11111001
00000000 = 11111001 * 100011011 + 100011011 * 11111001

a^-1(x) = x^7 + x^4 + x^3 + x^2 = 10011100 = 0x9c

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

SBOX(f9) = 10011001 = 99

For more information see FIPS 197.

Implemented by bachph [at] philba [dot] com