Cryptology ePrint Archive: Report 2006/222
Decoding Interleaved Gabidulin Codes and Ciphertext-Security for GPT variants
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.
Category / Keywords: public-key cryptography / Interleaved codes, rank distance codes, code based cryptography, public key cryptography.
Date: received 29 Jun 2006, last revised 18 Apr 2008
Contact author: overbeck at cdc informatik tu-darmstadt de
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation
Note: Please find a better presentation in my Ph.D. thesis
Version: 20080418:090852 (All versions of this report)
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]