gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000000000000000111111011001011 a = 0x0000000000007ecb a = x¹⁴ + x¹³ + x¹² + x¹¹ + x¹⁰ + x⁹ + x⁷ + x⁶ + x³ + x + 1
b = b0000000000000000000000000000000000000000000000000011111101110010 b = 0x0000000000003f72 b = x¹³ + x¹² + x¹¹ + x¹⁰ + x⁹ + x⁸ + x⁶ + x⁵ + x⁴ + x
111111011001011 | 11111101110010 - 11111101110010 | 1 --------------- | 101111 | - 00000000000000 | 0
c_quotient = b0000000000000000000000000000000000000000000000000000000000000010 c_quotient = 0x0000000000000002 c_quotient = x
c_remainder = b0000000000000000000000000000000000000000000000000000000000101111 c_remainder = 0x000000000000002f c_remainder = x⁵ + x³ + x² + x + 1