gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100000100010001000101010100000100010001
a = 0x00000000000000000000004111154111
a = x38 + x32 + x28 + x24 + x20 + x18 + x16 + x14 + x8 + x4 + 1

b = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010001000100000000010101010000000001
b = 0x00000000000000000000000444015401
b = x34 + x30 + x26 + x16 + x14 + x12 + x10 + 1

  100000100010001000101010100000100010001 | 10001000100000000010101010000000001
- 10001000100000000010101010000000001     | 1
  --------------------------------------- |
      10101010001000000000000000100000001 |
-  00000000000000000000000000000000000    | 0
-   00000000000000000000000000000000000   | 0
-    00000000000000000000000000000000000  | 0
-     10001000100000000010101010000000001 | 1
  --------------------------------------- |
        100010101000000010101010100000000 |

cquotient = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010001
cquotient = 0x00000000000000000000000000000011
cquotient = x4 + 1

cremainder = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100010101000000010101010100000000
cremainder = 0x00000000000000000000000115015500
cremainder = x32 + x28 + x26 + x24 + x16 + x14 + x12 + x10 + x8