gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000100000000000000000000000000000000 a = 0x0000000100000000 a = x³²
b = b0000000000000000000000000000000000000000001001111000101010011001 b = 0x0000000000278a99 b = x²¹ + x¹⁸ + x¹⁷ + x¹⁶ + x¹⁵ + x¹¹ + x⁹ + x⁷ + x⁴ + x³ + 1
100000000000000000000000000000000 | 1001111000101010011001 - 1001111000101010011001 | 1 --------------------------------- | 111100010101001100100000000000 | - 0000000000000000000000 | 0 - 0000000000000000000000 | 0 - 1001111000101010011001 | 1 --------------------------------- | 11011110111100101000100000000 | - 1001111000101010011001 | 1 --------------------------------- | 1000000110110001110110000000 | - 1001111000101010011001 | 1 --------------------------------- | 1111110011011101111000000 | - 0000000000000000000000 | 0 - 0000000000000000000000 | 0 - 1001111000101010011001 | 1 --------------------------------- | 110001011110111100001000 | - 1001111000101010011001 | 1 --------------------------------- | 10110111100010101101100 | - 1001111000101010011001 | 1 --------------------------------- | 101001101000001011110 | - 0000000000000000000000 | 0
c_quotient = b0000000000000000000000000000000000000000000000000000100111001110 c_quotient = 0x00000000000009ce c_quotient = x¹¹ + x⁸ + x⁷ + x⁶ + x³ + x² + x
c_remainder = b0000000000000000000000000000000000000000000101001101000001011110 c_remainder = 0x000000000014d05e c_remainder = x²⁰ + x¹⁸ + x¹⁵ + x¹⁴ + x¹² + x⁶ + x⁴ + x³ + x² + x