gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000100111110000010011001001110100000100111111
a = 0x0000027c1327413f
a = x41 + x38 + x37 + x36 + x35 + x34 + x28 + x25 + x24 + x21 + x18 + x17 + x16 + x14 + x8 + x5 + x4 + x3 + x2 + x + 1

b = b0000000000000000000000010100001010100001001101100001001011111100
b = 0x00000142a13612fc
b = x40 + x38 + x33 + x31 + x29 + x24 + x21 + x20 + x18 + x17 + x12 + x9 + x7 + x6 + x5 + x4 + x3 + x2

  100111110000010011001001110100000100111111 | 10100001010100001001101100001001011111100
- 10100001010100001001101100001001011111100  | 1
  ------------------------------------------ |
    1111100101010001010010110110010011000111 |
-  00000000000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000000010
cquotient = 0x0000000000000002
cquotient = x

cremainder = b0000000000000000000000001111100101010001010010110110010011000111
cremainder = 0x000000f9514b64c7
cremainder = x39 + x38 + x37 + x36 + x35 + x32 + x30 + x28 + x24 + x22 + x19 + x17 + x16 + x14 + x13 + x10 + x7 + x6 + x2 + x + 1