gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000000000000010001000100000100 a = 0x0000000000011104 a = x¹⁶ + x¹² + x⁸ + x²
b = b0000000000000000000000000000000000000000000000000001010000010101 b = 0x0000000000001415 b = x¹² + x¹⁰ + x⁴ + x² + 1
10001000100000100 | 1010000010101 - 1010000010101 | 1 ----------------- | 101000001010100 | - 0000000000000 | 0 - 1010000010101 | 1 ----------------- | 0 | - 0000000000000 | 0 - 0000000000000 | 0
c_quotient = b0000000000000000000000000000000000000000000000000000000000010100 c_quotient = 0x0000000000000014 c_quotient = x⁴ + x²
c_remainder = b0000000000000000000000000000000000000000000000000000000000000000 c_remainder = 0x0000000000000000 c_remainder = 0