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 = b00000000000000000000000000101111 b = 0x0000002f b = x⁵ + x³ + x² + x + 1
100000000 | 101111 - 101111 | 1 --------- | 1111000 | - 000000 | 0 - 101111 | 1 --------- | 100110 | - 101111 | 1 --------- | 1001 |
c_quotient = b00000000000000000000000000001011 c_quotient = 0x0000000b c_quotient = x³ + x + 1
c_remainder = b00000000000000000000000000001001 c_remainder = 0x00000009 c_remainder = x³ + 1