gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000011100010000011001111001011000100010101111011
a = 0x00000e20cf2c457b
a = x43 + x42 + x41 + x37 + x31 + x30 + x27 + x26 + x25 + x24 + x21 + x19 + x18 + x14 + x10 + x8 + x6 + x5 + x4 + x3 + x + 1

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

  11100010000011001111001011000100010101111011 | 111101101001000011100101111011010110000001
- 111101101001000011100101111011010110000001   | 1
  -------------------------------------------- |
     10100100111000001011100101001001101111111 |
-  000000000000000000000000000000000000000000  | 0
-   000000000000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000000100
cquotient = 0x0000000000000004
cquotient = x2

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