gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000010100010100010000010000010001010101000100010101
a = 0x0000514410455115
a = x46 + x44 + x40 + x38 + x34 + x28 + x22 + x18 + x16 + x14 + x12 + x8 + x4 + x2 + 1

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

  10100010100010000010000010001010101000100010101 | 1000001010100010100010100000000000000000000
- 1000001010100010100010100000000000000000000     | 1
  ----------------------------------------------- |
    100000001010101010101010001010101000100010101 |
-  0000000000000000000000000000000000000000000    | 0
-   1000001010100010100010100000000000000000000   | 1
  ----------------------------------------------- |
          100000100000100000001010101000100010101 |
-    0000000000000000000000000000000000000000000  | 0
-     0000000000000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000010100
cquotient = 0x0000000000000014
cquotient = x4 + x2

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