A New variant of the McEliece cryptosystem based on the Smith form of convolutional codes. Issue 3 (4th May 2018)

• Record Type: Journal Article
• Authors: Moufek, Hamza; Guenda, Kenza
• Is Part Of: Cryptologia. Volume 42:Issue 3(2018)
• Page Start: 227
• Page End: 239
• Publication Date: 2018-05-04
• Subjects: code-based public key encryption -- convolutional codes -- McEliece cryptosystem -- Smith form; Cryptography -- Periodicals; 652.8
• DOI: 10.1080/01611194.2017.1362061
• Languages: English
• ISSNs: 0161-1194

Abstract

ABSTRACT: In this article, the authors propose a new version of the McEliece cryptosystem based on the Smith form of convolutional codes. They use the Smith form to hide a part of the code in the public matrix, and they leave the other part secret. The secret part will then be used for decryption. They hide this part by multiplying it on the left by a random matrix, and they add a random matrix which has a few conditions. Their scheme has a small public key size compared to the original McEliece scheme and resists the unique decoding attack against convolutional structure presented at the conference PQCrypto 2013 by Landais and Tillich. Further, the exhaustive search attack is infeasible on their system.