Calculation of 0x73

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

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

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

00110001 = 00000001 * 100011011 + 00000110 * 1110011
00010001 = 00000010 * 100011011 + 00001101 * 1110011
00000010 = 00000111 * 100011011 + 00010001 * 1110011
00000001 = 00111010 * 100011011 + 10000101 * 1110011
00000000 = 01110011 * 100011011 + 100011011 * 1110011

a^-1(x) = x^7 + x^2 + 1 = 10000101 = 0x85

The calculation of 0x73^-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      0     1     1
           1 1 1 0 0 0 1 1      1     0     1
           1 1 1 1 0 0 0 1      0     0     1
SBOX(73) = 1 1 1 1 1 0 0 0   *  0  +  0  =  0
           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(73) = 10001111 = 8f

For more information see FIPS 197.

Implemented by bachph [at] philba [dot] com