Variations of the McEliece Cryptosystem
Information Theory
2017-05-01 v2 Cryptography and Security
math.IT
Abstract
Two variations of the McEliece cryptosystem are presented. The first one is based on a relaxation of the column permutation in the classical McEliece scrambling process. This is done in such a way that the Hamming weight of the error, added in the encryption process, can be controlled so that efficient decryption remains possible. The second variation is based on the use of spatially coupled moderate-density parity-check codes as secret codes. These codes are known for their excellent error-correction performance and allow for a relatively low key size in the cryptosystem. For both variants the security with respect to known attacks is discussed.
Keywords
Cite
@article{arxiv.1612.05085,
title = {Variations of the McEliece Cryptosystem},
author = {Jessalyn Bolkema and Heide Gluesing-Luerssen and Christine A. Kelley and Kristin Lauter and Beth Malmskog and Joachim Rosenthal},
journal= {arXiv preprint arXiv:1612.05085},
year = {2017}
}