Calculation of 0xb9

m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) =   0xb9 =  10111001 = x^7 + x^5 + x^4 + x^3 + 1

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

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

01101001 = 00000001 * 100011011 + 00000010 * 10111001
00000010 = 00000011 * 100011011 + 00000111 * 10111001
00000001 = 01011101 * 100011011 + 10001110 * 10111001
00000000 = 10111001 * 100011011 + 100011011 * 10111001

a^-1(x) = x^7 + x^3 + x^2 + x = 10001110 = 0x8e

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

SBOX(b9) = 01010110 = 56

For more information see FIPS 197.

Implemented by bachph [at] philba [dot] com