gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000100011011101100010010111000110111101000001100
a = 0x000011bb12e37a0c
a = x44 + x40 + x39 + x37 + x36 + x35 + x33 + x32 + x28 + x25 + x23 + x22 + x21 + x17 + x16 + x14 + x13 + x12 + x11 + x9 + x3 + x2

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

  100011011101100010010111000110111101000001100 | 11100010000011001111001011000100010101111011
- 11100010000011001111001011000100010101111011  | 1
  --------------------------------------------- |
   11011111101010001100101110111111000011111010 |
-  11100010000011001111001011000100010101111011 | 1
  --------------------------------------------- |
     111101101001000011100101111011010110000001 |

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

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