Monoidic Codes in Cryptography

@inproceedings{Barreto2011MonoidicCI,
  title={Monoidic Codes in Cryptography},
  author={Paulo S. L. M. Barreto and Richard Lindner and Rafael Misoczki},
  booktitle={IACR Cryptology ePrint Archive},
  year={2011}
}
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 quasimonoidic codes… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-8 of 8 extracted citations

Similar Papers

Loading similar papers…