Calculation of 0x74

m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) =   0x74 =  01110100 = x^6 + x^5 + x^4 + x^2

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

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

00100011 = 00000001 * 100011011 + 00000110 * 1110100
00010001 = 00000011 * 100011011 + 00001011 * 1110100
00000001 = 00000111 * 100011011 + 00010000 * 1110100
00000000 = 01110100 * 100011011 + 100011011 * 1110100

a^-1(x) = x^4 = 00010000 = 0x10

The calculation of 0x74^-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      0     1     1
           1 1 1 0 0 0 1 1      0     0     0
           1 1 1 1 0 0 0 1      0     0     0
SBOX(74) = 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      0     0     1

SBOX(74) = 10010010 = 92

For more information see FIPS 197.

Implemented by bachph [at] philba [dot] com