Calculation of 0x7e

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

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

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

00011111 = 00000001 * 100011011 + 00000110 * 1111110
00000010 = 00000100 * 100011011 + 00011001 * 1111110
00000001 = 00111101 * 100011011 + 10000001 * 1111110
00000000 = 01111110 * 100011011 + 100011011 * 1111110

a^-1(x) = x^7 + 1 = 10000001 = 0x81

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

SBOX(7e) = 11110011 = f3

For more information see FIPS 197.

Implemented by bachph [at] philba [dot] com