gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

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

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

  10001000100000000010101010000000001 | 100010101000000010101010100000000
- 100010101000000010101010100000000   | 1
  ----------------------------------- |
        10000000001000000000000000001 |
-  000000000000000000000000000000000  | 0
-   000000000000000000000000000000000 | 0

cquotient = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100
cquotient = 0x00000000000000000000000000000004
cquotient = x2

cremainder = b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010000000001000000000000000001
cremainder = 0x00000000000000000000000010040001
cremainder = x28 + x18 + 1