Affiliation:
1. University of Illinois at Chicago
2. Ruhr University Bochum
3. Academia Sinica
Abstract
This paper reviews, from bottom to top, a polynomial-time algorithm to correct
t
errors in classical binary Goppa codes defined by squarefree degree-
t
polynomials. The proof is factored through a proof of a simple Reed–Solomon decoder, and the algorithm is simpler than Patterson's algorithm. All algorithm layers are expressed as Sage scripts backed by test scripts. All theorems are formally verified. The paper also covers the use of decoding inside the Classic McEliece cryptosystem, including reliable recognition of valid inputs.
Publisher
International Association for Cryptologic Research
Reference91 articles.
1. Coding theory, a first course;Henk C. A. van Tilborg,1993
2. A software implementation of the McEliece public-key
cryptosystem;Bart Preneel,1992
3. BLAKE-512-based 128-bit CCA2 secure timing attack resistant
McEliece cryptoprocessor;Santosh Ghosh;IEEE Transactions on Computers,2014
4. Code-based cryptography;Raphael Overbeck,2009
5. The algebraic decoding of Goppa codes;Nicholas J. Patterson;IEEE Transactions on Information Theory,1975