Paper 2009/187 Original: eprint.iacr.org/2009/187 ↗
Compact McEliece Keys from Goppa Codes
Abstract
The classical McEliece cryptosystem is built upon the class of Goppa codes, which remains secure to this date in contrast to many other families of codes but leads to very large public keys. Previous proposals to obtain short McEliece keys have primarily centered around replacing that class by other families of codes, most of which were shown to contain weaknesses, and at the cost of reducing in half the capability of error correction. In this paper we describe a simple way to reduce significantly the key size in McEliece and related cryptosystems using a subclass of Goppa codes, while also improving the efficiency of cryptographic operations to $\tilde{O}(n)$ time, and keeping the capability of correcting the full designed number of errors in the binary case.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2010-04-10: last updated
- 2009-05-02: published
- Short URL
- https://ia.cr/2009/187
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2009/187,
author = {Rafael Misoczki and Paulo S. L. M. Barreto},
title = {Compact McEliece Keys from Goppa Codes},
howpublished = {Cryptology {ePrint} Archive, Paper 2009/187},
year = {2009},
url = {https://eprint.iacr.org/2009/187}
}