gf(2) mod

c = a % b

Calculate c = a/b, result is cremainder

gf(2) Polynomial long division

c = a/b

a = b0000000000010000000001000000000101000000010100010001000001010001
a = 0x0010040140511051
a = x52 + x42 + x32 + x30 + x22 + x20 + x16 + x12 + x6 + x4 + 1

b = b0000000000000101000101000101010100010101010100000000000100010000
b = 0x0005145515500110
b = x50 + x48 + x44 + x42 + x38 + x36 + x34 + x32 + x28 + x26 + x24 + x22 + x20 + x8 + x4

  10000000001000000000101000000010100010001000001010001 | 101000101000101010100010101010100000000000100010000
- 101000101000101010100010101010100000000000100010000   | 1
  ----------------------------------------------------- |
    100010101010101010100010101000100010001010000010001 |
-  000000000000000000000000000000000000000000000000000  | 0
-   101000101000101010100010101010100000000000100010000 | 1
  ----------------------------------------------------- |
      1010000010000000000000000010000010001010100000001 |

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

cremainder = b0000000000000001010000010000000000000000010000010001010100000001
cremainder = 0x0001410000411501
cremainder = x48 + x46 + x40 + x22 + x16 + x12 + x10 + x8 + 1