gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000110000011110000001001111011110000101
a = 0x0000000c1e04f785
a = x35 + x34 + x28 + x27 + x26 + x25 + x18 + x15 + x14 + x13 + x12 + x10 + x9 + x8 + x7 + x2 + 1

b = b0000000000000000000000000000011011111100011010010110001010000011
b = 0x00000006fc696283
b = x34 + x33 + x31 + x30 + x29 + x28 + x27 + x26 + x22 + x21 + x19 + x16 + x14 + x13 + x9 + x7 + x + 1

  110000011110000001001111011110000101 | 11011111100011010010110001010000011
- 11011111100011010010110001010000011  | 1
  ------------------------------------ |
     111100110110101100011001010000011 |
-  00000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000000010
cquotient = 0x0000000000000002
cquotient = x

cremainder = b0000000000000000000000000000000111100110110101100011001010000011
cremainder = 0x00000001e6d63283
cremainder = x32 + x31 + x30 + x29 + x26 + x25 + x23 + x22 + x20 + x18 + x17 + x13 + x12 + x9 + x7 + x + 1