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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal.inria.fr/hal-00870932
Contributor : Rafael Misoczki <>
Submitted on : Tuesday, October 8, 2013 - 1:49:52 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: Thursday, January 9, 2014 - 4:29:41 AM

File

187.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00870932, version 1

Collections

Citation

Rafael Misoczki, Barreto Paulo S. L. M.. Compact McEliece Keys from Goppa Codes. 16th Annual International Workshop Selected Areas in Cryptography SAC2009, Aug 2009, Calgary, Canada. ⟨hal-00870932⟩

Share

Metrics

Record views

398

Files downloads

424