×

Variations of the McEliece cryptosystem. (English) Zbl 1391.94731

Howe, Everett W. (ed.) et al., Algebraic geometry for coding theory and cryptography, IPAM, Los Angeles, CA, USA, February 2016. Cham: Springer (ISBN 978-3-319-63930-7/hbk; 978-3-319-63931-4/ebook). Association for Women in Mathematics Series 9, 129-150 (2017).
Summary: Two variations of the McEliece cryptosystem are presented. The first 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.
For the entire collection see [Zbl 1387.14013].

MSC:

94A60 Cryptography

Software:

McEliece
PDFBibTeX XMLCite
Full Text: DOI arXiv