Calculation of 0x0a

m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) =   0xa =  00001010 = x^3 + x

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

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

00000001 = 00000001 * 100011011 + 00101001 * 1010
00000000 = 00001010 * 100011011 + 100011011 * 1010

a^-1(x) = x^5 + x^3 + 1 = 00101001 = 0x29

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

SBOX(0a) = 01100111 = 67

For more information see FIPS 197.

Implemented by bachph [at] philba [dot] com