An efficient attack of a McEliece cryptosystem variant based on convolutional codes
From MaRDI portal
Publication:4928591
Abstract: L"ondahl and Johansson proposed last year a variant of the McEliece cryptosystem which replaces Goppa codes by convolutional codes. This modification is supposed to make structural attacks more difficult since the public generator matrix of this scheme contains large parts which are generated completely at random. They proposed two schemes of this kind, one of them consists in taking a Goppa code and extending it by adding a generator matrix of a time varying convolutional code. We show here that this scheme can be successfully attacked by looking for low-weight codewords in the public code of this scheme and using it to unravel the convolutional part. It remains to break the Goppa part of this scheme which can be done in less than a day of computation in the case at hand.
Recommendations
Cited in
(9)- Computational aspects of retrieving a representation of an algebraic geometry code
- Lossy cryptography from code-based assumptions
- New variant of the McEliece cryptosystem
- Cryptanalysis of McEliece Cryptosystem Based on Algebraic Geometry Codes and Their Subcodes
- Encryption scheme based on expanded Reed-Solomon codes
- Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
- Key recovery attack on McNie based on low rank parity check codes and its reparation
- Code-Based Signature Schemes from Identification Protocols in the Rank Metric
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
This page was built for publication: An efficient attack of a McEliece cryptosystem variant based on convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928591)