gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000000000100000000000000000000 a = 0x0000000000100000 a = x²⁰
b = b0000000000000000000000000000000000000000000001101010101111101101 b = 0x000000000006abed b = x¹⁸ + x¹⁷ + x¹⁵ + x¹³ + x¹¹ + x⁹ + x⁸ + x⁷ + x⁶ + x⁵ + x³ + x² + 1
100000000000000000000 | 1101010101111101101 - 1101010101111101101 | 1 --------------------- | 10101010111110110100 | - 1101010101111101101 | 1 --------------------- | 1111111100001101110 | - 1101010101111101101 | 1 --------------------- | 10101001110000011 |
c_quotient = b0000000000000000000000000000000000000000000000000000000000000111 c_quotient = 0x0000000000000007 c_quotient = x² + x + 1
c_remainder = b0000000000000000000000000000000000000000000000010101001110000011 c_remainder = 0x0000000000015383 c_remainder = x¹⁶ + x¹⁴ + x¹² + x⁹ + x⁸ + x⁷ + x + 1