gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010001000100 a = 0x00000000000000000000000000000444 a = x¹⁰ + x⁶ + x²
b = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000101 b = 0x00000000000000000000000000000005 b = x² + 1
10001000100 | 101 - 101 | 1 ----------- | 101000100 | - 000 | 0 - 101 | 1 ----------- | 100 | - 000 | 0 - 000 | 0 - 000 | 0 - 000 | 0 - 000 | 0 - 101 | 1 ----------- | 1 |
c_quotient = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000101000001 c_quotient = 0x00000000000000000000000000000141 c_quotient = x⁸ + x⁶ + 1
c_remainder = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001 c_remainder = 0x00000000000000000000000000000001 c_remainder = 1