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 = b0000000000000000000000000000000000000000000000011100010001011110
b = 0x000000000001c45e
b = x16 + x15 + x14 + x10 + x6 + x4 + x3 + x2 + x

  1101010101111101101 | 11100010001011110
- 11100010001011110   | 1
  ------------------- |
    11011101010010101 |
-  00000000000000000  | 0
-   11100010001011110 | 1
  ------------------- |
      111111011001011 |

cquotient = b0000000000000000000000000000000000000000000000000000000000000101
cquotient = 0x0000000000000005
cquotient = x2 + 1

cremainder = b0000000000000000000000000000000000000000000000000111111011001011
cremainder = 0x0000000000007ecb
cremainder = x14 + x13 + x12 + x11 + x10 + x9 + x7 + x6 + x3 + x + 1