Calculation of 0xa2

m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) =   0xa2 =  10100010 = x^7 + x^5 + x

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

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

01011111 = 00000001 * 100011011 + 00000010 * 10100010
00011100 = 00000010 * 100011011 + 00000101 * 10100010
00001011 = 00001111 * 100011011 + 00011001 * 10100010
00000001 = 00010011 * 100011011 + 00101110 * 10100010
00000000 = 10100010 * 100011011 + 100011011 * 10100010

a^-1(x) = x^5 + x^3 + x^2 + x = 00101110 = 0x2e

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

SBOX(a2) = 00111010 = 3a

For more information see FIPS 197.

Implemented by bachph [at] philba [dot] com