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 = b0000000000000000000000000000000010110000110000010101001011111001
b = 0x00000000b0c152f9
b = x31 + x29 + x28 + x23 + x22 + x16 + x14 + x12 + x9 + x7 + x6 + x5 + x4 + x3 + 1

  100000000000000000000000000000000000000 | 10110000110000010101001011111001
- 10110000110000010101001011111001        | 1
  --------------------------------------- |
    1100001100000101010010111110010000000 |
-  00000000000000000000000000000000       | 0
-   10110000110000010101001011111001      | 1
  --------------------------------------- |
     111001111000100000110010001110100000 |
-    10110000110000010101001011111001     | 1
  --------------------------------------- |
      10101110100100101100000110000110000 |
-     10110000110000010101001011111001    | 1
  --------------------------------------- |
         11110010100111001001101111111000 |
-      00000000000000000000000000000000   | 0
-       00000000000000000000000000000000  | 0
-        10110000110000010101001011111001 | 1
  --------------------------------------- |
          1000010010111011100100100000001 |

cquotient = b0000000000000000000000000000000000000000000000000000000010111001
cquotient = 0x00000000000000b9
cquotient = x7 + x5 + x4 + x3 + 1

cremainder = b0000000000000000000000000000000001000010010111011100100100000001
cremainder = 0x00000000425dc901
cremainder = x30 + x25 + x22 + x20 + x19 + x18 + x16 + x15 + x14 + x11 + x8 + 1