Cryptoanalysis McEliece-type cryptosystem based on correction of errors and erasures
Kirill Yackushenoks, Fedor Ivanov

TL;DR
This paper analyzes variants of the McEliece cryptosystem, showing that error-and-erasures correction schemes are equivalent to standard McEliece with less optimal parameters, and discusses potential extensions.
Contribution
It demonstrates the equivalence between error-and-erasures correction variants and the original McEliece cryptosystem, highlighting their parameter inefficiencies and proposing possible extensions.
Findings
Error-and-erasures correction variants are equivalent to McEliece with worse parameters
The proposed variants do not improve security or efficiency over standard McEliece
Extensions of the idea have flaws but suggest directions for future research
Abstract
Krouk, Tavernier and Kabatiansky proposed new variants of the McEliece cryptosystem. In this letter, it is shown that cryptosystem based on correction of errors erasures is equal to the Mc-Eliece cryptosystem with worse parametrs public key. It will also add an organic extension of the authors' idea, although one that has its flaws...
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptographic Implementations and Security · Chaos-based Image/Signal Encryption · Coding theory and cryptography
