gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000001000000000000000000000000
a = 0x0000000001000000
a = x24

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

  1000000000000000000000000 | 1101010101111101101
- 1101010101111101101       | 1
  ------------------------- |
   101010101111101101000000 |
-  1101010101111101101      | 1
  ------------------------- |
    11111111000011011100000 |
-   1101010101111101101     | 1
  ------------------------- |
      101010011100000110000 |
-    0000000000000000000    | 0
-     1101010101111101101   | 1
  ------------------------- |
       11111001011110000100 |
-      1101010101111101101  | 1
  ------------------------- |
         101100000001011110 |
-       0000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000001110110
cquotient = 0x0000000000000076
cquotient = x6 + x5 + x4 + x2 + x

cremainder = b0000000000000000000000000000000000000000000000101100000001011110
cremainder = 0x000000000002c05e
cremainder = x17 + x15 + x14 + x6 + x4 + x3 + x2 + x