Decoding Interleaved Gabidulin Codes and Ciphertext-Security for GPT variants

R.  Overbeck

Paper 2006/222

Decoding Interleaved Gabidulin Codes and Ciphertext-Security for GPT variants

R. Overbeck

Abstract

In this paper we view interleaved Gabidulin codes and describe how to correct errors up to a rank equal to the amount of redundancy of the code with high probability. We give a detailed proof for our estimation of the probability of correct decoding. In a second part, we view the application to variants of the GPT cryptosystem. For GGPT this leads to an efficient attack on the remaining secure instances, whereas it allows to derive at least partial information of the plaintext in the case of RRC-GPT.

Note: Please find a better presentation in my Ph.D. thesis http://elib.tu-darmstadt.de/diss/000823/

Metadata

Available format(s): PS
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: Interleaved codes rank distance codes code based cryptography public key cryptography.
Contact author(s): overbeck @ cdc informatik tu-darmstadt de
History: 2008-04-18: last of 2 revisions; 2006-07-03: received; See all versions
Short URL: https://ia.cr/2006/222
License: CC BY

BibTeX

@misc{cryptoeprint:2006/222,
      author = {R.  Overbeck},
      title = {Decoding Interleaved Gabidulin Codes and Ciphertext-Security for GPT variants},
      howpublished = {Cryptology ePrint Archive, Paper 2006/222},
      year = {2006},
      note = {\url{https://eprint.iacr.org/2006/222}},
      url = {https://eprint.iacr.org/2006/222}
}