gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000001000001010100010100010100000000000000000000
a = 0x0000041514500000
a = x42 + x36 + x34 + x32 + x28 + x26 + x22 + x20

b = b0000000000000000000000000100000100000100000001010101000100010101
b = 0x0000004104055115
b = x38 + x32 + x26 + x18 + x16 + x14 + x12 + x8 + x4 + x2 + 1

  1000001010100010100010100000000000000000000 | 100000100000100000001010101000100010101
- 100000100000100000001010101000100010101     | 1
  ------------------------------------------- |
          10101010100000001010001000101010000 |
-  000000000000000000000000000000000000000    | 0
-   000000000000000000000000000000000000000   | 0
-    000000000000000000000000000000000000000  | 0
-     000000000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000010000
cquotient = 0x0000000000000010
cquotient = x4

cremainder = b0000000000000000000000000000010101010100000001010001000101010000
cremainder = 0x0000000554051150
cremainder = x34 + x32 + x30 + x28 + x26 + x18 + x16 + x12 + x8 + x6 + x4