Impressum und Datenschutzerklaerung

Calculation of 0x71

m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) =   0x71 =  01110001 = x^6 + x^5 + x^4 + 1
m(x) = (x^2 + x) * a(x) + (x^5 + x^4 + x^3 + x^2 + 1)

Calculation of 0x71-1 in the finite field GF(28)

00111101 = 00000001 * 100011011 + 00000110 * 1110001
00001011 = 00000010 * 100011011 + 00001101 * 1110001
00000111 = 00001101 * 100011011 + 00101000 * 1110001
00000010 = 00010101 * 100011011 + 01110101 * 1110001
00000001 = 00110010 * 100011011 + 10110111 * 1110001
00000000 = 01110001 * 100011011 + 100011011 * 1110001

a-1(x) = x^7 + x^5 + x^4 + x^2 + x + 1 = 10110111 = 0xb7

The calculation of 0x71-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      1     1     1
           1 1 1 0 0 0 1 1      1     0     0
           1 1 1 1 0 0 0 1      0     0     0
SBOX(71) = 1 1 1 1 1 0 0 0   *  1  +  0  =  0
           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      1     0     1


SBOX(71) = 10100011 = a3

For more information see FIPS 197.



Implemented by bachph [at] philba [dot] com