gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000000000000000010100010001010001010101010000010101000001
a = 0x0000014451550541
a = x40 + x38 + x34 + x30 + x28 + x24 + x22 + x20 + x18 + x16 + x10 + x8 + x6 + 1

b = b0000000000000000000000000001010001010001000000010000010100010101
b = 0x0000001451010515
b = x36 + x34 + x30 + x28 + x24 + x16 + x10 + x8 + x4 + x2 + 1

  10100010001010001010101010000010101000001 | 1010001010001000000010000010100010101
- 1010001010001000000010000010100010101     | 1
  ----------------------------------------- |
          101000001010001010101010000010001 |
-  0000000000000000000000000000000000000    | 0
-   0000000000000000000000000000000000000   | 0
-    0000000000000000000000000000000000000  | 0
-     0000000000000000000000000000000000000 | 0

cquotient = b0000000000000000000000000000000000000000000000000000000000010000
cquotient = 0x0000000000000010
cquotient = x4

cremainder = b0000000000000000000000000000000101000001010001010101010000010001
cremainder = 0x0000000141455411
cremainder = x32 + x30 + x24 + x22 + x18 + x16 + x14 + x12 + x10 + x4 + 1