gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000000000000000000000100001001 a = 0x0000000000000109 a = x⁸ + x³ + 1
b = b0000000000000000000000000000000000000000000000000000000001011110 b = 0x000000000000005e b = x⁶ + x⁴ + x³ + x² + x
100001001 | 1011110 - 1011110 | 1 --------- | 1110001 | - 0000000 | 0 - 1011110 | 1 --------- | 101111 |
c_quotient = b0000000000000000000000000000000000000000000000000000000000000101 c_quotient = 0x0000000000000005 c_quotient = x² + 1
c_remainder = b0000000000000000000000000000000000000000000000000000000000101111 c_remainder = 0x000000000000002f c_remainder = x⁵ + x³ + x² + x + 1