gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000001100011101000000110100011000111011010111101
a = 0x0000063a068c76bd
a = x42 + x41 + x37 + x36 + x35 + x33 + x26 + x25 + x23 + x19 + x18 + x14 + x13 + x12 + x10 + x9 + x7 + x5 + x4 + x3 + x2 + 1

b = b0000000000000000000000100101010011000010001101001010100000001110
b = 0x00000254c234a80e
b = x41 + x38 + x36 + x34 + x31 + x30 + x25 + x21 + x20 + x18 + x15 + x13 + x11 + x3 + x2 + x

  1100011101000000110100011000111011010111101 | 100101010011000010001101001010100000001110
- 100101010011000010001101001010100000001110  | 1
  ------------------------------------------- |
   101001001110000010111001010010011010100001 |
-  100101010011000010001101001010100000001110 | 1
  ------------------------------------------- |
     1100011101000000110100011000111010101111 |

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

cremainder = b0000000000000000000000001100011101000000110100011000111010101111
cremainder = 0x000000c740d18eaf
cremainder = x39 + x38 + x34 + x33 + x32 + x30 + x23 + x22 + x20 + x16 + x15 + x11 + x10 + x9 + x7 + x5 + x3 + x2 + x + 1