gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

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

b = b0000000000000000000000000000000001000101010101000100010000000101
b = 0x0000000045544405
b = x30 + x26 + x24 + x22 + x20 + x18 + x14 + x10 + x2 + 1

  101000001010001010101010000010001 | 1000101010101000100010000000101
- 1000101010101000100010000000101   | 1
  --------------------------------- |
    1010100000101000100010000000101 |
-  0000000000000000000000000000000  | 0
-   1000101010101000100010000000101 | 1
  --------------------------------- |
      10001010000000000000000000000 |

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

cremainder = b0000000000000000000000000000000000010001010000000000000000000000
cremainder = 0x0000000011400000
cremainder = x28 + x24 + x22