gf(2) mod

c = a % b

Calculate c = a/b, result is c_remainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001010100000001010001 a = 0x00000000000000000000000000054051 a = x¹⁸ + x¹⁶ + x¹⁴ + x⁶ + x⁴ + 1
b = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010001000100 b = 0x00000000000000000000000000000444 b = x¹⁰ + x⁶ + x²
1010100000001010001 | 10001000100 - 10001000100 | 1 ------------------- | 10000010001010001 | - 00000000000 | 0 - 10001000100 | 1 ------------------- | 1010101010001 | - 00000000000 | 0 - 00000000000 | 0 - 00000000000 | 0 - 10001000100 | 1 ------------------- | 10001000001 | - 00000000000 | 0 - 10001000100 | 1 ------------------- | 101 |
c_quotient = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000101000101 c_quotient = 0x00000000000000000000000000000145 c_quotient = x⁸ + x⁶ + x² + 1
c_remainder = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000101 c_remainder = 0x00000000000000000000000000000005 c_remainder = x² + 1