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
PB - Springer
ER -