gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000000000000000000010000010100 a = 0x0000000000000414 a = x¹⁰ + x⁴ + x²
b = b0000000000000000000000000000000000000000000000000000000101000101 b = 0x0000000000000145 b = x⁸ + x⁶ + x² + 1
10000010100 | 101000101 - 101000101 | 1 ----------- | 100000000 | - 000000000 | 0 - 101000101 | 1 ----------- | 1000101 |
c_quotient = b0000000000000000000000000000000000000000000000000000000000000101 c_quotient = 0x0000000000000005 c_quotient = x² + 1
c_remainder = b0000000000000000000000000000000000000000000000000000000001000101 c_remainder = 0x0000000000000045 c_remainder = x⁶ + x² + 1