gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000000000001101010101111101101
a = 0x000000000006abed
a = x18 + x17 + x15 + x13 + x11 + x9 + x8 + x7 + x6 + x5 + x3 + x2 + 1

b = b0000000000000000000000000000000000000000000000100110101110101010
b = 0x0000000000026baa
b = x17 + x14 + x13 + x11 + x9 + x8 + x7 + x5 + x3 + x

  1101010101111101101 | 100110101110101010
- 100110101110101010  | 1
  ------------------- |
   100111110010111001 |
-  100110101110101010 | 1
  ------------------- |
        1011100010011 |

cquotient = b0000000000000000000000000000000000000000000000000000000000000011
cquotient = 0x0000000000000003
cquotient = x + 1

cremainder = b0000000000000000000000000000000000000000000000000001011100010011
cremainder = 0x0000000000001713
cremainder = x12 + x10 + x9 + x8 + x4 + x + 1