Compact McEliece keys based on Quasi-Dyadic Srivastava codes

Edoardo Persichetti

Paper 2011/179

Compact McEliece keys based on Quasi-Dyadic Srivastava codes

Edoardo Persichetti

Abstract

The McEliece cryptosystem is one of the few systems to be considered secure against Quantum attacks. The original scheme is built upon Goppa codes and produces very large keys, hence latest research has focused mainly on trying to reduce the public key size. Previous proposals tried to replace the class of Goppa codes with other families of codes, but this revealed to be an insecure choice. In this paper we introduce a construction based on Generalized Srivastava codes, a large class which include Goppa codes as a special case, that allows relatively short public keys without being vulnerable to known structural attacks.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: Coding Theory McEliece
Contact author(s): e persichetti @ math auckland ac nz
History: 2011-11-28: revised; 2011-04-08: received; See all versions
Short URL: https://ia.cr/2011/179
License: CC BY

BibTeX

@misc{cryptoeprint:2011/179,
      author = {Edoardo Persichetti},
      title = {Compact {McEliece} keys based on Quasi-Dyadic Srivastava codes},
      howpublished = {Cryptology {ePrint} Archive, Paper 2011/179},
      year = {2011},
      url = {https://eprint.iacr.org/2011/179}
}