gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000000000000000000001000000000000000000000000
a = 0x0000000001000000
a = x24

b = b0000000000000000000000000000000000000000001001111000101010011001
b = 0x0000000000278a99
b = x21 + x18 + x17 + x16 + x15 + x11 + x9 + x7 + x4 + x3 + 1

  1000000000000000000000000 | 1001111000101010011001
- 1001111000101010011001    | 1
  ------------------------- |
     1111000101010011001000 |
-  0000000000000000000000   | 0
-   0000000000000000000000  | 0
-    1001111000101010011001 | 1
  ------------------------- |
      110111101111001010001 |

cquotient = b0000000000000000000000000000000000000000000000000000000000001001
cquotient = 0x0000000000000009
cquotient = x3 + 1

cremainder = b0000000000000000000000000000000000000000000110111101111001010001
cremainder = 0x00000000001bde51
cremainder = x20 + x19 + x17 + x16 + x15 + x14 + x12 + x11 + x10 + x9 + x6 + x4 + 1