gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000111000001110010001010010000010011101010011
a = 0x0000038391482753
a = x41 + x40 + x39 + x33 + x32 + x31 + x28 + x24 + x22 + x19 + x13 + x10 + x9 + x8 + x6 + x4 + x + 1

b = b0000000000000000000000001001100100000110000110101010011101001010
b = 0x00000099061aa74a
b = x39 + x36 + x35 + x32 + x26 + x25 + x20 + x19 + x17 + x15 + x13 + x10 + x9 + x8 + x6 + x3 + x

  111000001110010001010010000010011101010011 | 1001100100000110000110101010011101001010
- 1001100100000110000110101010011101001010   | 1
  ------------------------------------------ |
   11110011110001001001000101011101001111011 |
-  1001100100000110000110101010011101001010  | 1
  ------------------------------------------ |
    1101010110000101000101111111010011101111 |
-   1001100100000110000110101010011101001010 | 1
  ------------------------------------------ |
     100110010000011000011010101001110100101 |

cquotient = b0000000000000000000000000000000000000000000000000000000000000111
cquotient = 0x0000000000000007
cquotient = x2 + x + 1

cremainder = b0000000000000000000000000100110010000011000011010101001110100101
cremainder = 0x0000004c830d53a5
cremainder = x38 + x35 + x34 + x31 + x25 + x24 + x19 + x18 + x16 + x14 + x12 + x9 + x8 + x7 + x5 + x2 + 1