gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000000010000000000000000000000 a = 0x0000000000400000 a = x²²
b = b0000000000000000000000000000000000000000000001101010101111101101 b = 0x000000000006abed b = x¹⁸ + x¹⁷ + x¹⁵ + x¹³ + x¹¹ + x⁹ + x⁸ + x⁷ + x⁶ + x⁵ + x³ + x² + 1
10000000000000000000000 | 1101010101111101101 - 1101010101111101101 | 1 ----------------------- | 1010101011111011010000 | - 1101010101111101101 | 1 ----------------------- | 111111110000110111000 | - 1101010101111101101 | 1 ----------------------- | 1010100111000001100 | - 0000000000000000000 | 0 - 1101010101111101101 | 1 ----------------------- | 111110010111100001 |
c_quotient = b0000000000000000000000000000000000000000000000000000000000011101 c_quotient = 0x000000000000001d c_quotient = x⁴ + x³ + x² + 1
c_remainder = b0000000000000000000000000000000000000000000000111110010111100001 c_remainder = 0x000000000003e5e1 c_remainder = x¹⁷ + x¹⁶ + x¹⁵ + x¹⁴ + x¹³ + x¹⁰ + x⁸ + x⁷ + x⁶ + x⁵ + 1