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 ...
At the time of this writing, there are 3 sources for parameters for the McEliece public-key cryptosystem out there. The first paper is the original McEliece paper, which only specifies ...
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 : ...