gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000000000100000001010100000001 a = 0x0000000000101501 a = x²⁰ + x¹² + x¹⁰ + x⁸ + 1
b = b0000000000000000000000000000000000000000000001000000010100000000 b = 0x0000000000040500 b = x¹⁸ + x¹⁰ + x⁸
100000001010100000001 | 1000000010100000000 - 1000000010100000000 | 1 --------------------- | 100000001 | - 0000000000000000000 | 0 - 0000000000000000000 | 0
c_quotient = b0000000000000000000000000000000000000000000000000000000000000100 c_quotient = 0x0000000000000004 c_quotient = x²
c_remainder = b0000000000000000000000000000000000000000000000000000000100000001 c_remainder = 0x0000000000000101 c_remainder = x⁸ + 1