gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000101101011000111100010011111101 a = 0x000000002d63c4fd a = x²⁹ + x²⁷ + x²⁶ + x²⁴ + x²² + x²¹ + x¹⁷ + x¹⁶ + x¹⁵ + x¹⁴ + x¹⁰ + x⁷ + x⁶ + x⁵ + x⁴ + x³ + x² + 1
b = b0000000000000000000000000000000000000111000010101110101001110111 b = 0x00000000070aea77 b = x²⁶ + x²⁵ + x²⁴ + x¹⁹ + x¹⁷ + x¹⁵ + x¹⁴ + x¹³ + x¹¹ + x⁹ + x⁶ + x⁵ + x⁴ + x² + x + 1
101101011000111100010011111101 | 111000010101110101001110111 - 111000010101110101001110111 | 1 ------------------------------ | 10101001101001001011101000101 | - 111000010101110101001110111 | 1 ------------------------------ | 1001000111110011111010011001 | - 111000010101110101001110111 | 1 ------------------------------ | 111000010101110101001110111 | - 111000010101110101001110111 | 1 ------------------------------ | 0 |
c_quotient = b0000000000000000000000000000000000000000000000000000000000001111 c_quotient = 0x000000000000000f c_quotient = x³ + x² + x + 1
c_remainder = b0000000000000000000000000000000000000000000000000000000000000000 c_remainder = 0x0000000000000000 c_remainder = 0