Variations of the McEliece Cryptosystem

Jessalyn Bolkema; Heide Gluesing-Luerssen; Christine A. Kelley; Kristin E. Lauter; Beth Malmskog; Joachim Rosenthal

doi:10.1007/978-3-319-63931-4_5

Variations of the McEliece Cryptosystem

Jessalyn Bolkema, Heide Gluesing-Luerssen, Christine A. Kelley, Kristin E. Lauter, Beth Malmskog, Joachim Rosenthal

Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

5 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Association for Women in Mathematics Series
Pages	129-150
Number of pages	22
DOIs	https://doi.org/10.1007/978-3-319-63931-4_5
State	Published - 2017

Publication series

Name	Association for Women in Mathematics Series
Volume	9
ISSN (Print)	2364-5733
ISSN (Electronic)	2364-5741

Bibliographical note

Funding Information:
Acknowledgements We would like to thank the organizers of the IPAM workshop on Algebraic Geometry for Coding Theory and Cryptography for inviting us to the event. Thanks also go to Mike O’Sullivan for helpful conversations and to the anonymous referee for kind suggestions. JB was supported by the US Department of Education GAANN Grant P200A120068. HGL was partially supported by the National Science Foundation Grant DMS-1210061 and by the grant #422479 from the Simons Foundation. BM was partially supported by the National Security Agency under grant H98230-16-1-0300. JR was partially supported by the Swiss National Science Foundation under grant #169510.

Publisher Copyright:
© 2017, The Author(s) and the Association for Women in Mathematics.

ASJC Scopus subject areas

Mathematics (all)
Gender Studies

Access to Document

10.1007/978-3-319-63931-4_5

Cite this

@inbook{db61b826196545f1b3a9b10f376b9fe7,

title = "Variations of the McEliece Cryptosystem",

abstract = "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.",

author = "Jessalyn Bolkema and Heide Gluesing-Luerssen and Kelley, {Christine A.} and Lauter, {Kristin E.} and Beth Malmskog and Joachim Rosenthal",

note = "Funding Information: Acknowledgements We would like to thank the organizers of the IPAM workshop on Algebraic Geometry for Coding Theory and Cryptography for inviting us to the event. Thanks also go to Mike O{\textquoteright}Sullivan for helpful conversations and to the anonymous referee for kind suggestions. JB was supported by the US Department of Education GAANN Grant P200A120068. HGL was partially supported by the National Science Foundation Grant DMS-1210061 and by the grant #422479 from the Simons Foundation. BM was partially supported by the National Security Agency under grant H98230-16-1-0300. JR was partially supported by the Swiss National Science Foundation under grant #169510. Publisher Copyright: {\textcopyright} 2017, The Author(s) and the Association for Women in Mathematics.",

year = "2017",

doi = "10.1007/978-3-319-63931-4_5",

language = "English",

series = "Association for Women in Mathematics Series",

pages = "129--150",

booktitle = "Association for Women in Mathematics Series",

}

TY - CHAP

T1 - Variations of the McEliece Cryptosystem

AU - Bolkema, Jessalyn

AU - Gluesing-Luerssen, Heide

AU - Kelley, Christine A.

AU - Lauter, Kristin E.

AU - Malmskog, Beth

AU - Rosenthal, Joachim

N1 - Funding Information: Acknowledgements We would like to thank the organizers of the IPAM workshop on Algebraic Geometry for Coding Theory and Cryptography for inviting us to the event. Thanks also go to Mike O’Sullivan for helpful conversations and to the anonymous referee for kind suggestions. JB was supported by the US Department of Education GAANN Grant P200A120068. HGL was partially supported by the National Science Foundation Grant DMS-1210061 and by the grant #422479 from the Simons Foundation. BM was partially supported by the National Security Agency under grant H98230-16-1-0300. JR was partially supported by the Swiss National Science Foundation under grant #169510. Publisher Copyright: © 2017, The Author(s) and the Association for Women in Mathematics.

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85063239408&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85063239408&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-63931-4_5

DO - 10.1007/978-3-319-63931-4_5

M3 - Chapter

AN - SCOPUS:85063239408

T3 - Association for Women in Mathematics Series

SP - 129

EP - 150

BT - Association for Women in Mathematics Series

ER -

Variations of the McEliece Cryptosystem

Abstract

Publication series

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this