gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000000000000000000000101000101 a = 0x0000000000000145 a = x⁸ + x⁶ + x² + 1
b = b0000000000000000000000000000000000000000000000000000000001000101 b = 0x0000000000000045 b = x⁶ + x² + 1
101000101 | 1000101 - 1000101 | 1 --------- | 1010001 | - 0000000 | 0 - 1000101 | 1 --------- | 10100 |
c_quotient = b0000000000000000000000000000000000000000000000000000000000000101 c_quotient = 0x0000000000000005 c_quotient = x² + 1
c_remainder = b0000000000000000000000000000000000000000000000000000000000010100 c_remainder = 0x0000000000000014 c_remainder = x⁴ + x²