Impressum und Datenschutzerklaerung

Calculation of 0xc0

m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) =   0xc0 =  11000000 = x^7 + x^6
m(x) = (x + 1) * a(x) + (x^6 + x^4 + x^3 + x + 1)

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

01011011 = 00000001 * 100011011 + 00000011 * 11000000
00101101 = 00000011 * 100011011 + 00000100 * 11000000
00000001 = 00000111 * 100011011 + 00001011 * 11000000
00000000 = 11000000 * 100011011 + 100011011 * 11000000

a-1(x) = x^3 + x + 1 = 00001011 = 0x0b

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


SBOX(c0) = 10111010 = ba

For more information see FIPS 197.



Implemented by bachph [at] philba [dot] com