gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000111101111101100100100100100111111111001100111111
a = 0x0000f7d9249ff33f
a = 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

b = b0000000000000000000001111001111000100100100010101110100111101100
b = 0x0000079e248ae9ec
b = x42 + x41 + x40 + x39 + x36 + x35 + x34 + x33 + x29 + x26 + x23 + x19 + x17 + x15 + x14 + x13 + x11 + x8 + x7 + x6 + x5 + x3 + x2

  111101111101100100100100100111111111001100111111 | 1111001111000100100100010101110100111101100
- 1111001111000100100100010101110100111101100      | 1
  ------------------------------------------------ |
       1000001110110110101110000101100111010111111 |
-  0000000000000000000000000000000000000000000     | 0
-   0000000000000000000000000000000000000000000    | 0
-    0000000000000000000000000000000000000000000   | 0
-     0000000000000000000000000000000000000000000  | 0
-      1111001111000100100100010101110100111101100 | 1
  ------------------------------------------------ |
        111000001110010001010010000010011101010011 |

cquotient = b0000000000000000000000000000000000000000000000000000000000100001
cquotient = 0x0000000000000021
cquotient = x5 + 1

cremainder = b0000000000000000000000111000001110010001010010000010011101010011
cremainder = 0x0000038391482753
cremainder = x41 + x40 + x39 + x33 + x32 + x31 + x28 + x24 + x22 + x19 + x13 + x10 + x9 + x8 + x6 + x4 + x + 1