gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000100000000000000000000000000000000000000
a = 0x0000004000000000
a = x38

b = b0000000000000000000000000000000000000000001001111000101010011001
b = 0x0000000000278a99
b = x21 + x18 + x17 + x16 + x15 + x11 + x9 + x7 + x4 + x3 + 1

  100000000000000000000000000000000000000 | 1001111000101010011001
- 1001111000101010011001                  | 1
  --------------------------------------- |
     111100010101001100100000000000000000 |
-  0000000000000000000000                 | 0
-   0000000000000000000000                | 0
-    1001111000101010011001               | 1
  --------------------------------------- |
      11011110111100101000100000000000000 |
-     1001111000101010011001              | 1
  --------------------------------------- |
       1000000110110001110110000000000000 |
-      1001111000101010011001             | 1
  --------------------------------------- |
          1111110011011101111000000000000 |
-       0000000000000000000000            | 0
-        0000000000000000000000           | 0
-         1001111000101010011001          | 1
  --------------------------------------- |
           110001011110111100001000000000 |
-          1001111000101010011001         | 1
  --------------------------------------- |
            10110111100010101101100000000 |
-           1001111000101010011001        | 1
  --------------------------------------- |
              101001101000001011110000000 |
-            0000000000000000000000       | 0
-             1001111000101010011001      | 1
  --------------------------------------- |
                1110001010100010010100000 |
-              0000000000000000000000     | 0
-               1001111000101010011001    | 1
  --------------------------------------- |
                 111110010001000001101000 |
-                1001111000101010011001   | 1
  --------------------------------------- |
                  11001110011101000001100 |
-                 1001111000101010011001  | 1
  --------------------------------------- |
                   1010000010111100111110 |
-                  1001111000101010011001 | 1
  --------------------------------------- |
                     11111010010110100111 |

cquotient = b0000000000000000000000000000000000000000000000100111001110101111
cquotient = 0x00000000000273af
cquotient = x17 + x14 + x13 + x12 + x9 + x8 + x7 + x5 + x3 + x2 + x + 1

cremainder = b0000000000000000000000000000000000000000000011111010010110100111
cremainder = 0x00000000000fa5a7
cremainder = x19 + x18 + x17 + x16 + x15 + x13 + x10 + x8 + x7 + x5 + x2 + x + 1