gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000010001110100101101110001001000
a = 0x0000000011d2dc48
a = x28 + x24 + x23 + x22 + x20 + x17 + x15 + x14 + x12 + x11 + x10 + x6 + x3

b = b0000000000000000000000000000000000001111010000011000011100100101
b = 0x000000000f418725
b = x27 + x26 + x25 + x24 + x22 + x16 + x15 + x10 + x9 + x8 + x5 + x2 + 1

  10001110100101101110001001000 | 1111010000011000011100100101
- 1111010000011000011100100101  | 1
  ----------------------------- |
   1111010100011101001000000010 |
-  1111010000011000011100100101 | 1
  ----------------------------- |
          100000101010100100111 |

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

cremainder = b0000000000000000000000000000000000000000000100000101010100100111
cremainder = 0x0000000000105527
cremainder = x20 + x14 + x12 + x10 + x8 + x5 + x2 + x + 1