gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000010000000101010100000001000100000000000100010000
a = 0x0000405501100110
a = x46 + x38 + x36 + x34 + x32 + x24 + x20 + x8 + x4

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

  10000000101010100000001000100000000000100010000 | 101010000000100000001010100000001010101010001
- 101010000000100000001010100000001010101010001   | 1
  ----------------------------------------------- |
    101000101000100000100010100000101010001010100 |
-  000000000000000000000000000000000000000000000  | 0
-   101010000000100000001010100000001010101010001 | 1
  ----------------------------------------------- |
        10101000000000101000000000100000100000101 |

cquotient = b0000000000000000000000000000000000000000000000000000000000000101
cquotient = 0x0000000000000005
cquotient = x2 + 1

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