Open AccessPunctured Reed–Muller code‐based McEliece cryptosystems
Author(s) -
Lee Wijik,
No JongSeon,
Kim YoungSik
Publication year - 2017
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2016.1268
Subject(s) - mceliece cryptosystem , puncturing , cryptosystem , code (set theory) , computer science , arithmetic , mathematics , generator matrix , discrete mathematics , algorithm , cryptography , decoding methods , telecommunications , programming language , set (abstract data type)
The authors propose new McEliece cryptosystems based on punctured Reed–Muller (RM) codes. They successfully show that the commonly known attacks, such as the Minder–Shokrollahi attack, the Chizhov–Borodin attack, and the square code attack, are ineffective against the proposed RM code‐based McEliece cryptosystem. We developed an optimal puncturing scheme to prevent the above‐mentioned attacks for the proposed RM code‐based cryptosystems in a sense that the exact locations of puncturing positions with the minimum number of punctured columns of the generator matrix should be found for attacking. It is important to carry out the minimum number of punctures, however, as code modification resulting from puncturing can reduce security. Additionally, the square code attack can be prevented in the proposed RM code‐based McEliece cryptosystems by using both the proposed puncturing method and random insertion methods.