gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000101010000000100000001010100000001010101010001
a = 0x0000150101501551
a = x44 + x42 + x40 + x32 + x24 + x22 + x20 + x12 + x10 + x8 + x6 + x4 + 1

b = b0000000000000000000000010101000000000101000000000100000100000101
b = 0x0000015005004105
b = x40 + x38 + x36 + x26 + x24 + x14 + x8 + x2 + 1

  101010000000100000001010100000001010101010001 | 10101000000000101000000000100000100000101
- 10101000000000101000000000100000100000101     | 1
  --------------------------------------------- |
              101010001010101000000010100000001 |
-  00000000000000000000000000000000000000000    | 0
-   00000000000000000000000000000000000000000   | 0
-    00000000000000000000000000000000000000000  | 0
-     00000000000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000010000
cquotient = 0x0000000000000010
cquotient = x4

cremainder = b0000000000000000000000000000000101010001010101000000010100000001
cremainder = 0x0000000151540501
cremainder = x32 + x30 + x28 + x24 + x22 + x20 + x18 + x10 + x8 + 1