gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000000000100010101010000000001 a = 0x0000000000115401 a = x²⁰ + x¹⁶ + x¹⁴ + x¹² + x¹⁰ + 1
b = b0000000000000000000000000000000000000000000001010100000100000001 b = 0x0000000000054101 b = x¹⁸ + x¹⁶ + x¹⁴ + x⁸ + 1
100010101010000000001 | 1010100000100000001 - 1010100000100000001 | 1 --------------------- | 1000101000000000101 | - 0000000000000000000 | 0 - 1010100000100000001 | 1 --------------------- | 10001000100000100 |
c_quotient = b0000000000000000000000000000000000000000000000000000000000000101 c_quotient = 0x0000000000000005 c_quotient = x² + 1
c_remainder = b0000000000000000000000000000000000000000000000010001000100000100 c_remainder = 0x0000000000011104 c_remainder = x¹⁶ + x¹² + x⁸ + x²