A new structural attack for GPT and variants

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3715 LNCS, Issue , 2005, Pages 50-63

  Overbeck, Raphael ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Code based cryptography; Gabidulin codes; Public key cryptography; Rank distance codes

Indexed keywords

CODE BASED CRYPTOGRAPHY; GABIDULIN CODES; POLYNOMIAL TIME ATTACK; RANK DISTANCE CODES;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; DATA PRIVACY; POLYNOMIALS; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

CRYPTOGRAPHY;

EID: 33646185189     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11554868_5     Document Type: Conference Paper

References (11)

1. T.P. Berger and P. Loidreau. How to mask the structure of codes for a cryptographic use. Designs, Codes and Cryptography, 35 (1), 2005.
2. T.P. Berger and P. Loidreau. Security of the Niederreiter form of the GPT publickey cryptosystem. In IEEE International Symposium on Information Theory, Lausanne, Suisse. IEEE, July 2002.
3. E. M. Gabidulin and A. V. Ourivski. Column scrambler for the GPT cryptosystem. Discrete Applied Mathematics, 128(1):207-221, 2003.
4. E.M. Gabidulin. On public-key cryptoSystems based on linear codes. In Proc. of 4th IMA Conference on Cryptography and Coding 1993, Codes and Ciphers. IMA Press, 1995.
5. E.M. Gabidulin and P. Loidreau. Subfield subcodes of maximum-rank distance codes. In Seventh International Workshop on Algebraic and Combinatorial Coding Theory, volume 7 of ACCT, pages 151-156, 2000.
6. E.M. Gabidulin, A.V. Ourivski, B. Honary, and B. Ammar. Reducible rank codes and their applications to cryptography. IEEE Transactions on Information Theory, 49(12):3289-3293, 2003.
7. E.M. Gabidulin, A.V. Paramonov, and O.V. Tretjakov. Ideals over a noncommutative ring and their applications to cryptography. In Proc. Eurocrypt '91, volume 547 of LNCS. Springer Verlag, 1991.
8. K. Gibson. The security of the Gabidulin public key cryptosystem. In Proc. of Eurocrypt'96, volume 1070 of LNCS, pages 212-223. Springer Verlag, 1996.
9. T. Johansson and A.V. Ourivski. New technique for decoding codes in the rank metric and its cryptography applications. Problems of Information Transmission, 38, No. 3:237-246, 2002.
10. A.V. Ourivski. Recovering a parent code for subcodes of maximal rank distance codes. In Proc. of WCC 03, pages 357-363, 2003.
11. R. Overbeck. Extending Gibson's attacks on the GPT cryptosystem. In Proc. of WCC 2005, pages 382-391, 2005.