gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000111000011100110010111101000010011001
a = 0x0000000e1ccbd099
a = x35 + x34 + x33 + x28 + x27 + x26 + x23 + x22 + x19 + x17 + x16 + x15 + x14 + x12 + x7 + x4 + x3 + 1

b = b0000000000000000000000000000000000101101011000111100010011111101
b = 0x000000002d63c4fd
b = x29 + x27 + x26 + x24 + x22 + x21 + x17 + x16 + x15 + x14 + x10 + x7 + x6 + x5 + x4 + x3 + x2 + 1

  111000011100110010111101000010011001 | 101101011000111100010011111101
- 101101011000111100010011111101       | 1
  ------------------------------------ |
   10101000100001110101110111111011001 |
-  101101011000111100010011111101      | 1
  ------------------------------------ |
      11101000010000100111000001111001 |
-   000000000000000000000000000000     | 0
-    000000000000000000000000000000    | 0
-     101101011000111100010011111101   | 1
  ------------------------------------ |
       1011101110011010110001110001101 |
-      101101011000111100010011111101  | 1
  ------------------------------------ |
           111000010101110101001110111 |
-       000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000001100110
cquotient = 0x0000000000000066
cquotient = x6 + x5 + x2 + x

cremainder = b0000000000000000000000000000000000000111000010101110101001110111
cremainder = 0x00000000070aea77
cremainder = x26 + x25 + x24 + x19 + x17 + x15 + x14 + x13 + x11 + x9 + x6 + x5 + x4 + x2 + x + 1