gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000
a = 0x000000000004000000000000
a = x50

b = b000000000000000000000000000000000000000000000000111101111101100100100100100111111111001100111111
b = 0x000000000000f7d9249ff33f
b = x47 + x46 + x45 + x44 + x42 + x41 + x40 + x39 + x38 + x36 + x35 + x32 + x29 + x26 + x23 + x20 + x19 + x18 + x17 + x16 + x15 + x14 + x13 + x12 + x9 + x8 + x5 + x4 + x3 + x2 + x + 1

  100000000000000000000000000000000000000000000000000 | 111101111101100100100100100111111111001100111111
- 111101111101100100100100100111111111001100111111    | 1
  --------------------------------------------------- |
   11101111101100100100100100111111111001100111111000 |
-  111101111101100100100100100111111111001100111111   | 1
  --------------------------------------------------- |
      11000011010110110110110100000000101010100000100 |
-   000000000000000000000000000000000000000000000000  | 0
-    000000000000000000000000000000000000000000000000 | 0

cquotient = b000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001100
cquotient = 0x00000000000000000000000c
cquotient = x3 + x2

cremainder = b000000000000000000000000000000000000000000000000011000011010110110110110100000000101010100000100
cremainder = 0x00000000000061adb6805504
cremainder = x46 + x45 + x40 + x39 + x37 + x35 + x34 + x32 + x31 + x29 + x28 + x26 + x25 + x23 + x14 + x12 + x10 + x8 + x2