Calculation of 0x5c

m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) =   0x5c =  01011100 = x^6 + x^4 + x^3 + x^2

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

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

00110111 = 00000001 * 100011011 + 00000101 * 1011100
00000101 = 00000011 * 100011011 + 00001110 * 1011100
00000001 = 00010011 * 100011011 + 01010001 * 1011100
00000000 = 01011100 * 100011011 + 100011011 * 1011100

a^-1(x) = x^6 + x^4 + 1 = 01010001 = 0x51

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

SBOX(5c) = 01001010 = 4a

For more information see FIPS 197.

Implemented by bachph [at] philba [dot] com