Impressum und Datenschutzerklaerung

Calculation of 0xc2

m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) =   0xc2 =  11000010 = x^7 + x^6 + x
m(x) = (x + 1) * a(x) + (x^6 + x^4 + x^3 + x^2 + 1)

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

01011101 = 00000001 * 100011011 + 00000011 * 11000010
00100101 = 00000011 * 100011011 + 00000100 * 11000010
00010111 = 00000111 * 100011011 + 00001011 * 11000010
00001011 = 00001101 * 100011011 + 00010010 * 11000010
00000001 = 00011101 * 100011011 + 00101111 * 11000010
00000000 = 11000010 * 100011011 + 100011011 * 11000010

a-1(x) = x^5 + x^3 + x^2 + x + 1 = 00101111 = 0x2f

The calculation of 0xc2-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     0
           1 1 1 0 0 0 1 1      1     0     1
           1 1 1 1 0 0 0 1      1     0     0
SBOX(c2) = 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     0
           0 0 0 1 1 1 1 1      0     0     0


SBOX(c2) = 00100101 = 25

For more information see FIPS 197.



Implemented by bachph [at] philba [dot] com