gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000001111010000011000011100100101 a = 0x000000000f418725 a = x²⁷ + x²⁶ + x²⁵ + x²⁴ + x²² + x¹⁶ + x¹⁵ + x¹⁰ + x⁹ + x⁸ + x⁵ + x² + 1
b = b0000000000000000000000000000000000000000000100000101010100100111 b = 0x0000000000105527 b = x²⁰ + x¹⁴ + x¹² + x¹⁰ + x⁸ + x⁵ + x² + x + 1
1111010000011000011100100101 | 100000101010100100111 - 100000101010100100111 | 1 ---------------------------- | 111011010110001010010100101 | - 100000101010100100111 | 1 ---------------------------- | 11011111100101110101100101 | - 100000101010100100111 | 1 ---------------------------- | 1011101001111100110000101 | - 100000101010100100111 | 1 ---------------------------- | 11100011010101111110101 | - 000000000000000000000 | 0 - 100000101010100100111 | 1 ---------------------------- | 1100001111111101101001 | - 100000101010100100111 | 1 ---------------------------- | 100000101010100100111 | - 100000101010100100111 | 1 ---------------------------- | 0 |
c_quotient = b0000000000000000000000000000000000000000000000000000000011110111 c_quotient = 0x00000000000000f7 c_quotient = x⁷ + x⁶ + x⁵ + x⁴ + x² + x + 1
c_remainder = b0000000000000000000000000000000000000000000000000000000000000000 c_remainder = 0x0000000000000000 c_remainder = 0