Calculation of 0xb2
m(x) = 0x11b = 100011011 = x^8 + x^4 + x^3 + x + 1
a(x) = 0xb2 = 10110010 = x^7 + x^5 + x^4 + x
m(x) = (x) * a(x) + (x^6 + x^5 + x^4 + x^3 + x^2 + x + 1)
Calculation of 0xb2-1 in the finite field GF(28)01111111 = 00000001 * 100011011 + 00000010 * 10110010
00110011 = 00000011 * 100011011 + 00000111 * 10110010
00011001 = 00000111 * 100011011 + 00001100 * 10110010
00000001 = 00001101 * 100011011 +
00011111 * 10110010
00000000 = 10110010 * 100011011 + 100011011 * 10110010
a
-1(x) = x^4 + x^3 + x^2 + x + 1 = 00011111 = 0x1f
The calculation of 0xb2
-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 1
1 1 1 1 0 0 0 1 1 0 0
SBOX(b2) = 1 1 1 1 1 0 0 0 * 1 + 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 0
SBOX(b2) = 00110111 = 37
For more information see
FIPS 197.
Implemented by bachph [at] philba [dot] com