Abstract:
In this paper, we describe two types of McEliece cryptosystems based on some Reed–Muller subcodes and study the question of equivalent keys for these cryptosystems. A method for reduction of one cryptosystem to the another is obtained. Also, we show that these cryptosystems based on Reed–Muller subcode with the most widely used parameters can be attacked with the authors' algorithm.
Keywords:McEliece cryptosystem, Reed–Muller subcode, automorphism of Reed–Muller code, Schur product codes, square of code.