gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000010000000000000000000000000000 a = 0x0000000010000000 a = x²⁸
b = b0000000000000000000000000000000000000000000001101010101111101101 b = 0x000000000006abed b = x¹⁸ + x¹⁷ + x¹⁵ + x¹³ + x¹¹ + x⁹ + x⁸ + x⁷ + x⁶ + x⁵ + x³ + x² + 1
10000000000000000000000000000 | 1101010101111101101 - 1101010101111101101 | 1 ----------------------------- | 1010101011111011010000000000 | - 1101010101111101101 | 1 ----------------------------- | 111111110000110111000000000 | - 1101010101111101101 | 1 ----------------------------- | 1010100111000001100000000 | - 0000000000000000000 | 0 - 1101010101111101101 | 1 ----------------------------- | 111110010111100001000000 | - 1101010101111101101 | 1 ----------------------------- | 1011000000010111100000 | - 0000000000000000000 | 0 - 1101010101111101101 | 1 ----------------------------- | 110010101101010001000 | - 1101010101111101101 | 1 ----------------------------- | 111111010100111100 | - 0000000000000000000 | 0 - 0000000000000000000 | 0
c_quotient = b0000000000000000000000000000000000000000000000000000011101101100 c_quotient = 0x000000000000076c c_quotient = x¹⁰ + x⁹ + x⁸ + x⁶ + x⁵ + x³ + x²
c_remainder = b0000000000000000000000000000000000000000000000111111010100111100 c_remainder = 0x000000000003f53c c_remainder = x¹⁷ + x¹⁶ + x¹⁵ + x¹⁴ + x¹³ + x¹² + x¹⁰ + x⁸ + x⁵ + x⁴ + x³ + x²