gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000000000000000000000000000001 a = 0x0000000000000001 a = 1
b = b0000000000000000000000000000000000000000000001101010101111101101 b = 0x000000000006abed b = x¹⁸ + x¹⁷ + x¹⁵ + x¹³ + x¹¹ + x⁹ + x⁸ + x⁷ + x⁶ + x⁵ + x³ + x² + 1
1 | 1101010101111101101
c_quotient = b0000000000000000000000000000000000000000000000000000000000000000 c_quotient = 0x0000000000000000 c_quotient = 0
c_remainder = b0000000000000000000000000000000000000000000000000000000000000001 c_remainder = 0x0000000000000001 c_remainder = 1