Calculation of 0x69

m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) =   0x69 =  01101001 = x^6 + x^5 + x^3 + 1

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

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

00000100 = 00000001 * 100011011 + 00000111 * 1101001
00000001 = 00011010 * 100011011 + 01000111 * 1101001
00000000 = 01101001 * 100011011 + 100011011 * 1101001

a^-1(x) = x^6 + x^2 + x + 1 = 01000111 = 0x47

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

SBOX(69) = 11111001 = f9

For more information see FIPS 197.

Implemented by bachph [at] philba [dot] com