McEliece-type cryptosystem based on correction of errors and erasures
Evgenii Krouk, Grigory Kabatiansky, Cédric Tavernier
Abstract
Evgenii Krouk, Grigory Kabatiansky, Cédric Tavernier
Abstract
Recently, a modification of the classical McEliece cryptosystem has been proposed by introducing an auxiliary matrix, by which an artificial error vector is multiplied. The system was broken. In this work, we propose a simpler attack on the system, and at the same time, we propose a generalization of the system, free from the identified shortcomings. We assume that the new scheme is at least as secure as McEliece’s cryptosystem.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Recently, a modification of the classical McEliece cryptosystem has been proposed by introducing an auxiliary matrix, by which an artificial error vector is multiplied. The system was broken. In this work, we propose a simpler attack on the system, and at the same time, we propose a generalization of the system, free from the identified shortcomings. We assume that the new scheme is at least as secure as McEliece’s cryptosystem.
Key concepts: McEliece cryptosystem, Cryptosystem, Computer science, Type (biology), Arithmetic, Theoretical computer science, Algorithm, Mathematics