Cryptology ePrint Archive: Report 2011/371
Monoidic Codes in Cryptography
Paulo S. L. M. Barreto and Richard Lindner and Rafael Misoczki
Abstract: At SAC 2009, Misoczki and Barreto proposed a new class of codes, which have parity-check matrices that are quasi-dyadic. A special subclass of these codes were shown to coincide with Goppa codes and those were recommended for cryptosystems based on error-correcting codes. Quasi-dyadic codes have both very compact representations and allow for efficient processing, resulting in fast cryptosystems with small key sizes.
In this paper, we generalize these results and introduce quasi-monoidic codes, which retain all desirable properties of quasi-dyadic codes. We show that, as before, a subclass of our codes contains only Goppa codes or, for a slightly bigger subclass, only Generalized Srivastava codes. Unlike before, we also capture codes over fields of odd characteristic. These include wild Goppa codes that were proposed at SAC 2010 by Bernstein, Lange, and Peters for their exceptional error-correction capabilities.
We show how to instantiate standard code-based encryption and signature schemes with our codes and give some preliminary parameters.
Category / Keywords: post-quantum cryptography, codes, efficient algorithms.
Publication Info: Work to appear in PQCrypto'2011
Date: received 7 Jul 2011, last revised 16 Sep 2011
Contact author: rlindner at cs tu-darmstadt de
Available format(s): PDF | BibTeX Citation
Note: Change of notation, corrected typos, more references and sections rearrangement.
Version: 20110916:085135 (All versions of this report)
Short URL: ia.cr/2011/371
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]