gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000100100110001101100100000101011010000110
a = 0x000000498d905686
a = x38 + x35 + x32 + x31 + x27 + x26 + x24 + x23 + x20 + x14 + x12 + x10 + x9 + x7 + x2 + x

b = b0000000000000000000000000011011011010000010101010111111101101101
b = 0x00000036d0557f6d
b = x37 + x36 + x34 + x33 + x31 + x30 + x28 + x22 + x20 + x18 + x16 + x14 + x13 + x12 + x11 + x10 + x9 + x8 + x6 + x5 + x3 + x2 + 1

  100100110001101100100000101011010000110 | 11011011010000010101010111111101101101
- 11011011010000010101010111111101101101  | 1
  --------------------------------------- |
   10010000101101001110101010100001011100 |
-  11011011010000010101010111111101101101 | 1
  --------------------------------------- |
    1001011111101011011111101011100110001 |

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

cremainder = b0000000000000000000000000001001011111101011011111101011100110001
cremainder = 0x00000012fd6fd731
cremainder = x36 + x33 + x31 + x30 + x29 + x28 + x27 + x26 + x24 + x22 + x21 + x19 + x18 + x17 + x16 + x15 + x14 + x12 + x10 + x9 + x8 + x5 + x4 + 1