Calculation of 0x93
m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) = 0x93 = 10010011 = x^7 + x^4 + x + 1
m(x) = (x) * a(x) + (x^5 + x^4 + x^3 + x^2 + 1)
Calculation of 0x93-1 in the finite field GF(28)00111101 = 00000001 * 100011011 + 00000010 * 10010011
00011101 = 00000110 * 100011011 + 00001101 * 10010011
00000111 = 00001101 * 100011011 + 00011000 * 10010011
00000001 = 00110010 * 100011011 +
01101101 * 10010011
00000000 = 10010011 * 100011011 + 100011011 * 10010011
a
-1(x) = x^6 + x^5 + x^3 + x^2 + 1 = 01101101 = 0x6d
The calculation of 0x93
-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 0 1 0
1 1 1 0 0 0 1 1 1 0 1
1 1 1 1 0 0 0 1 1 0 1
SBOX(93) = 1 1 1 1 1 0 0 0 * 0 + 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 1
SBOX(93) = 11011100 = dc
For more information see
FIPS 197.
Implemented by bachph [at] philba [dot] com