gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000011010111001000111000000010001001000111010001
a = 0x00000d72380891d1
a = x43 + x42 + x40 + x38 + x37 + x36 + x33 + x29 + x28 + x27 + x19 + x15 + x12 + x8 + x7 + x6 + x4 + 1

b = b0000000000000000000000000101010010000001100001011010001101100011
b = 0x000000548185a363
b = x38 + x36 + x34 + x31 + x24 + x23 + x18 + x16 + x15 + x13 + x9 + x8 + x6 + x5 + x + 1

  11010111001000111000000010001001000111010001 | 101010010000001100001011010001101100011
- 101010010000001100001011010001101100011      | 1
  -------------------------------------------- |
   1111110001000001000101111001111110110110001 |
-  101010010000001100001011010001101100011     | 1
  -------------------------------------------- |
    101010101000010000111001101100101110000001 |
-   101010010000001100001011010001101100011    | 1
  -------------------------------------------- |
          111000011100110010111101000010011001 |
-    000000000000000000000000000000000000000   | 0
-     000000000000000000000000000000000000000  | 0
-      000000000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000111000
cquotient = 0x0000000000000038
cquotient = x5 + x4 + x3

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