gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b00000000000001000000000000000000
a = 0x00040000
a = x18

b = b00000000000000000000011111011101
b = 0x000007dd
b = x10 + x9 + x8 + x7 + x6 + x4 + x3 + x2 + 1

  1000000000000000000 | 11111011101
- 11111011101         | 1
  ------------------- |
   111101110100000000 |
-  11111011101        | 1
  ------------------- |
       11001110000000 |
-   00000000000       | 0
-    00000000000      | 0
-     00000000000     | 0
-      11111011101    | 1
  ------------------- |
         110101101000 |
-       00000000000   | 0
-        11111011101  | 1
  ------------------- |
           1011010010 |
-         00000000000 | 0

cquotient = b00000000000000000000000110001010
cquotient = 0x0000018a
cquotient = x8 + x7 + x3 + x

cremainder = b00000000000000000000001011010010
cremainder = 0x000002d2
cremainder = x9 + x7 + x6 + x4 + x