Efficient decoding of irreducible binary Goppa codes and the role of matrix P in McEliece cryptosystem
If we assume that the support for an irreducible binary Goppa code $\gamma_1, ..., \gamma_n$ is publicly known, when is it possible to efficiently decode the code? I know it's possible if one knows ...
I am trying to implement the root finding algorithm from the following paper - Finding roots of polynomials over finite fields by Sergei V. Fedorenko, Peter V. Trifonov link : ...
I am trying to learn about the McEliece cryptosystem, unlike other more common systems, like RSA or El Gamal, educational literature such as the Handbook of applied cryptography doesn't contain worked ...