Welcome to the resource topic for 2010/372
Title:
Decoding square-free Goppa codes over \F_p
Authors: Paulo S. L. M. Barreto, Richard Lindner, Rafael Misoczki
Abstract:We propose a new, efficient decoding algorithm for square-free (irreducible or otherwise) Goppa codes over \F_p for any prime p. If the code in question has degree t and its average code distance is at least (4/p)t + 1, the proposed decoder can uniquely correct up to (2/p)t errors with high probability. The correction capability is higher if the distribution of error magnitudes is not uniform, approaching or reaching t errors when any particular error value occurs much more often than others or exclusively. This makes the method interesting for (semantically secure) cryptosystems based on the decoding problem for permuted and punctured Goppa codes.
ePrint: https://eprint.iacr.org/2010/372
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .