gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000100000000000000000000000000000000000000000000
a = 0x0000100000000000
a = x44

b = b0000000000000000000000000000000010110000110000010101001011111001
b = 0x00000000b0c152f9
b = x31 + x29 + x28 + x23 + x22 + x16 + x14 + x12 + x9 + x7 + x6 + x5 + x4 + x3 + 1

  100000000000000000000000000000000000000000000 | 10110000110000010101001011111001
- 10110000110000010101001011111001              | 1
  --------------------------------------------- |
    1100001100000101010010111110010000000000000 |
-  00000000000000000000000000000000             | 0
-   10110000110000010101001011111001            | 1
  --------------------------------------------- |
     111001111000100000110010001110100000000000 |
-    10110000110000010101001011111001           | 1
  --------------------------------------------- |
      10101110100100101100000110000110000000000 |
-     10110000110000010101001011111001          | 1
  --------------------------------------------- |
         11110010100111001001101111111000000000 |
-      00000000000000000000000000000000         | 0
-       00000000000000000000000000000000        | 0
-        10110000110000010101001011111001       | 1
  --------------------------------------------- |
          1000010010111011100100100000001000000 |
-         10110000110000010101001011111001      | 1
  --------------------------------------------- |
            11010001111010110000001111101100000 |
-          00000000000000000000000000000000     | 0
-           10110000110000010101001011111001    | 1
  --------------------------------------------- |
             1100001001010100101000100010101000 |
-            10110000110000010101001011111001   | 1
  --------------------------------------------- |
              111001010010101111100001101001100 |
-             10110000110000010101001011111001  | 1
  --------------------------------------------- |
               10101011110101010110011010111110 |
-              10110000110000010101001011111001 | 1
  --------------------------------------------- |
                  11011000101000011010001000111 |

cquotient = b0000000000000000000000000000000000000000000000000010111001101111
cquotient = 0x0000000000002e6f
cquotient = x13 + x11 + x10 + x9 + x6 + x5 + x3 + x2 + x + 1

cremainder = b0000000000000000000000000000000000011011000101000011010001000111
cremainder = 0x000000001b143447
cremainder = x28 + x27 + x25 + x24 + x20 + x18 + x13 + x12 + x10 + x6 + x2 + x + 1