gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000111101101001000011100101111011010110000001
a = 0x000003da4397b581
a = x41 + x40 + x39 + x38 + x36 + x35 + x33 + x30 + x25 + x24 + x23 + x20 + x18 + x17 + x16 + x15 + x13 + x12 + x10 + x8 + x7 + 1

b = b0000000000000000000000010100100111000001011100101001001101111111
b = 0x00000149c172937f
b = x40 + x38 + x35 + x32 + x31 + x30 + x24 + x22 + x21 + x20 + x17 + x15 + x12 + x9 + x8 + x6 + x5 + x4 + x3 + x2 + x + 1

  111101101001000011100101111011010110000001 | 10100100111000001011100101001001101111111
- 10100100111000001011100101001001101111111  | 1
  ------------------------------------------ |
   10100100111000001011100101001001101111111 |
-  10100100111000001011100101001001101111111 | 1
  ------------------------------------------ |
                                           0 |

cquotient = b0000000000000000000000000000000000000000000000000000000000000011
cquotient = 0x0000000000000003
cquotient = x + 1

cremainder = b0000000000000000000000000000000000000000000000000000000000000000
cremainder = 0x0000000000000000
cremainder = 0