Calculation of 0x70

m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) =   0x70 =  01110000 = x^6 + x^5 + x^4

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

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

00111011 = 00000001 * 100011011 + 00000110 * 1110000
00000110 = 00000010 * 100011011 + 00001101 * 1110000
00000001 = 00010111 * 100011011 + 01111001 * 1110000
00000000 = 01110000 * 100011011 + 100011011 * 1110000

a^-1(x) = x^6 + x^5 + x^4 + x^3 + 1 = 01111001 = 0x79

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

SBOX(70) = 01010001 = 51

For more information see FIPS 197.

Implemented by bachph [at] philba [dot] com