Calculation of 0x95

m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) =   0x95 =  10010101 = x^7 + x^4 + x^2 + 1

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

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

00110001 = 00000001 * 100011011 + 00000010 * 10010101
00000010 = 00000111 * 100011011 + 00001111 * 10010101
00000001 = 01001001 * 100011011 + 10001010 * 10010101
00000000 = 10010101 * 100011011 + 100011011 * 10010101

a^-1(x) = x^7 + x^3 + x = 10001010 = 0x8a

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

SBOX(95) = 00101010 = 2a

For more information see FIPS 197.

Implemented by bachph [at] philba [dot] com