Decoding square-free Goppa codes over $\F_p$

Details Decoding square-free Goppa codes over $\F_p$ Decoding square-free Goppa codes over $\F_p$

2011-03-16

arxiv.org/abs/1103.3296v1

Computer Science

Cryptography and Security

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Decoding square-free Goppa codes over $\F_p$ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Decoding square-free Goppa codes over $\F_p$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decoding square-free Goppa codes over $\F_p$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-247229