Corpus ID: 54476057

On a Rank-Metric Code-Based Cryptosystem with Small Key Size

  title={On a Rank-Metric Code-Based Cryptosystem with Small Key Size},
  author={Julian Renner and S. Puchinger and A. Wachter-Zeh},
A repair of the Faure-Loidreau (FL) public-key code-based cryptosystem is proposed. The FL cryptosystem is based on the hardness of list decoding Gabidulin codes which are special rank-metric codes. We prove that the recent structural attack on the system by Gaborit et al. is equivalent to decoding an interleaved Gabidulin code. Since all known polynomial-time decoders for these codes fail for a large constructive class of error patterns, we are able to construct public keys that resist the… Expand
Decoding High-Order Interleaved Rank-Metric Codes
The new decoder is an adaption of the Hamming-metric decoder by Metzner and Kapturowski and guarantees to correct all rank errors of weight up to $d-2$ whose rank over the large base field of the code equals the number of errors. Expand


Repairing the Faure-Loidreau Public-Key Cryptosystem
A repair of the Faure-Loidreau (FL) public-key code-based cryptosystem is proposed and it is proved that the recent structural attack on the system by Gaborit et al. is equivalent to decoding an interleaved Gabidulin code. Expand
Key reduction of McEliece's cryptosystem using list decoding
  • M. Barbier, P. Barreto
  • Computer Science, Mathematics
  • 2011 IEEE International Symposium on Information Theory Proceedings
  • 2011
This paper shows that the quasi-dyadic variant of the code-based McEliece cryptosystem can be designed to resist all known attacks, and explains how to increase the security level for given public keysizes. Expand
Reducible rank codes and their applications to cryptography
A new family of so-called reducible rank codes which are a generalization of rank product codes is presented, which includes maximal rank distance (MRD) codes for lengths n>N in the field F/sub N/. Expand
Polynomial-time key recovery attack on the Faure–Loidreau scheme based on Gabidulin codes
This article shows that for a range of parameters, this rank-metric encryption scheme is also vulnerable to a polynomial-time attack that recovers the private key by applying Overbeck’s attack on an appropriate public code. Expand
A New Public-Key Cryptosystem Based on the Problem of Reconstructing p-Polynomials
This paper presents a new public key cryptosystem whose security relies on the intractability of the problem of reconstructing p-polynomials, and shows how these attacks can be avoided, thanks to properties of rank metric and p- polynomials. Expand
Low Rank Parity Check codes and their application to cryptography
In this paper we introduce a new family of rank metric codes: the Low Rank Parity Check codes for which we propose an e cient probabilistic decoding algorithm. This family of codes can be seen as theExpand
A New Rank Metric Codes Based Encryption Scheme
A new McEliece-like rank metric based encryption scheme from Gabidulin codes is designed and it is explained why it is not affected by the invariant subspace attacks also known as Overbeck's attacks. Expand
MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes
This work proposes two McEliece variants: one from Moderate Density Parity-Check (MDPC) codes and another from quasi-cyclic MDPC codes, which reduce under certain hypotheses the security of the scheme to the well studied decoding problem. Expand
Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius
Subspace codes are used to prove two bounds on the list size in decoding certain Gabidulin codes, one of which is an existential one, showing that exponentially sized lists exist for codes with specific parameters, and the second one which presents exponentiallysized lists explicitly for a different set of parameters. Expand
Public key cryptography based on coding theory
The statistical decoding algorithm is viewed, which tries to solve the general decoding problem as well as the variants of the McEliece cryptosystem based on Gabidulin codes, and a new error correction algorithm is presented, which can be extended to interleaved Gabidoxin codes, which allows to correct errors in rank metric up to the amount of redundancy in a large number of cases. Expand