gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000000000000100110101110101010 a = 0x0000000000026baa a = x¹⁷ + x¹⁴ + x¹³ + x¹¹ + x⁹ + x⁸ + x⁷ + x⁵ + x³ + x
b = b0000000000000000000000000000000000000000000000000001011100010011 b = 0x0000000000001713 b = x¹² + x¹⁰ + x⁹ + x⁸ + x⁴ + x + 1
100110101110101010 | 1011100010011 - 1011100010011 | 1 ------------------ | 1000100111001010 | - 0000000000000 | 0 - 1011100010011 | 1 ------------------ | 11000101010010 | - 0000000000000 | 0 - 1011100010011 | 1 ------------------ | 1111101110100 | - 1011100010011 | 1 ------------------ | 100001100111 |
c_quotient = b0000000000000000000000000000000000000000000000000000000000101011 c_quotient = 0x000000000000002b c_quotient = x⁵ + x³ + x + 1
c_remainder = b0000000000000000000000000000000000000000000000000000100001100111 c_remainder = 0x0000000000000867 c_remainder = x¹¹ + x⁶ + x⁵ + x² + x + 1