gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000100000000 a = 0x00000100 a = x⁸
b = b00000000000000000000000001100111 b = 0x00000067 b = x⁶ + x⁵ + x² + x + 1
100000000 | 1100111 - 1100111 | 1 --------- | 10011100 | - 1100111 | 1 --------- | 1010010 | - 1100111 | 1 --------- | 110101 |
c_quotient = b00000000000000000000000000000111 c_quotient = 0x00000007 c_quotient = x² + x + 1
c_remainder = b00000000000000000000000000110101 c_remainder = 0x00000035 c_remainder = x⁵ + x⁴ + x² + 1