The results show that the time needed to calculate parity check matrix in separable are higher than the one for irreducible
McEliece cryptosystem, which is considered expected results due to calculate extra parity check matrix in decryption process for g2 (z) in separable type, and the time needed to execute error locator in decryption stage in separable type is better than the time needed to calculate it in irreducible type