Cryptanalysis of the mceliece pkc based on (k - 1)-reed - muller subcodes
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.
Download file
Counter downloads: 261
Keywords
McEliece cryptosystem, Muller subcode, Muller code, криптосистема Мак-Элиса, Маллера, Маллера, Reed , automorphism of Reed , Schur product codes, square of code, подкоды Рида , автоморфизмы кодов Рида, произведение Шура, квадрат кодаAuthors
Name | Organization | |
Chizhov I. V. | Moscow State University | ichizhov@cs.msu.ru |
Borodin M. A. | Moscow State University | bor1m@mail.ru |
References
Сидельников В. М. Открытое шифрование на основе двоичных кодов Рида - Маллера // Дискретная математика. 1994. Т. 6. №2. C.3-20.
Minder L. and Shokrollahi A. Cryptanalysis of the Sidelnikov cryptosystem // LNCS. 2007. V. 4515. P. 347-360.
Бородин М. А., Чижов И.В. Эффективная атака на криптосистему Мак-Элиса, построенную на основе кодов Рида - Маллера // Дискретная математика. 2014. Т. 26. № 1. С.10-20.

Cryptanalysis of the mceliece pkc based on (k - 1)-reed - muller subcodes | Applied Discrete Mathematics. Supplement. 2016. № 9.
Download full-text version
Counter downloads: 1385