An efficient attack of a McEliece cryptosystem variant based on convolutional codes

DOI10.1007/978-3-642-38616-9_7zbMATH Open1273.94353arXiv1302.5120OpenAlexW1502394689MaRDI QIDQ4928591FDOQ4928591

Authors: Grégory Landais, Jean-Pierre Tillich 

Publication date: 14 June 2013

Published in: Post-Quantum Cryptography (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1302.5120

Recommendations

• New variant of the McEliece cryptosystem
• A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
• Attacking and Defending the McEliece Cryptosystem
• Variations of the McEliece cryptosystem
• Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes

zbMATH Keywords

convolutional codesMcEliece cryptosystemcode-based cryptographycryptanalysis

Mathematics Subject Classification ID

Cryptography (94A60) Convolutional codes (94B10)

Cited In (9)

• Computational aspects of retrieving a representation of an algebraic geometry code
• Code-Based Signature Schemes from Identification Protocols in the Rank Metric
• Key recovery attack on McNie based on low rank parity check codes and its reparation
• Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes
• Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
• Encryption scheme based on expanded Reed-Solomon codes
• Cryptanalysis of McEliece Cryptosystem Based on Algebraic Geometry Codes and Their Subcodes
• Lossy cryptography from code-based assumptions
• New variant of the McEliece cryptosystem

Uses Software

• McEliece

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)