gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000100000000000000000000000000 a = 0x0000000004000000 a = x²⁶
b = b0000000000000000000000000000000000000000001001111000101010011001 b = 0x0000000000278a99 b = x²¹ + x¹⁸ + x¹⁷ + x¹⁶ + x¹⁵ + x¹¹ + x⁹ + x⁷ + x⁴ + x³ + 1
100000000000000000000000000 | 1001111000101010011001 - 1001111000101010011001 | 1 --------------------------- | 111100010101001100100000 | - 0000000000000000000000 | 0 - 0000000000000000000000 | 0 - 1001111000101010011001 | 1 --------------------------- | 11011110111100101000100 | - 1001111000101010011001 | 1 --------------------------- | 1000000110110001110110 | - 1001111000101010011001 | 1 --------------------------- | 1111110011011101111 |
c_quotient = b0000000000000000000000000000000000000000000000000000000000100111 c_quotient = 0x0000000000000027 c_quotient = x⁵ + x² + x + 1
c_remainder = b0000000000000000000000000000000000000000000001111110011011101111 c_remainder = 0x000000000007e6ef c_remainder = x¹⁸ + x¹⁷ + x¹⁶ + x¹⁵ + x¹⁴ + x¹³ + x¹⁰ + x⁹ + x⁷ + x⁶ + x⁵ + x³ + x² + x + 1