gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000000000001010100000100000001 a = 0x0000000000054101 a = x¹⁸ + x¹⁶ + x¹⁴ + x⁸ + 1
b = b0000000000000000000000000000000000000000000000010001000100000100 b = 0x0000000000011104 b = x¹⁶ + x¹² + x⁸ + x²
1010100000100000001 | 10001000100000100 - 10001000100000100 | 1 ------------------- | 10000010100010001 | - 00000000000000000 | 0 - 10001000100000100 | 1 ------------------- | 1010000010101 |
c_quotient = b0000000000000000000000000000000000000000000000000000000000000101 c_quotient = 0x0000000000000005 c_quotient = x² + 1
c_remainder = b0000000000000000000000000000000000000000000000000001010000010101 c_remainder = 0x0000000000001415 c_remainder = x¹² + x¹⁰ + x⁴ + x² + 1