Calculation of 0xa6

m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) =   0xa6 =  10100110 = x^7 + x^5 + x^2 + x

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

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

01010111 = 00000001 * 100011011 + 00000010 * 10100110
00001000 = 00000010 * 100011011 + 00000101 * 10100110
00000111 = 00010101 * 100011011 + 00100000 * 10100110
00000001 = 00111101 * 100011011 + 01100101 * 10100110
00000000 = 10100110 * 100011011 + 100011011 * 10100110

a^-1(x) = x^6 + x^5 + x^2 + 1 = 01100101 = 0x65

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

SBOX(a6) = 00100100 = 24

For more information see FIPS 197.

Implemented by bachph [at] philba [dot] com