Extension of Overbeck’s attack for Gabidulin-based cryptosystems
Journal
Designs, codes and cryptography : an international journal
ISSN
0925-1022
ISSN-Digital
1573-7586
Type
journal article
Date Issued
2017-04-28
Author(s)
Abstract
Cryptosystems based on codes in the rank metric were introduced in 1991 by Gabidulin, Paramanov, and Tretjakov (GPT) and have been studied as a promising alternative to cryptosystems based on codes in the Hamming metric. In particular, it was observed that the combinatorial solution for solving the rank analogy of the syndrome decoding problem appears significantly harder. Early proposals were often made with an underlying Gabidulin code structure. Gibson, in 1995, made a promising attack which was later extended by Overbeck in 2008 to cryptanalyze many of the systems in the literature. Improved systems were then designed to resist the attack of Overbeck and yet continue to use Gabidulin codes. In this paper, we generalize Overbeck’s attack to break the GPT cryptosystem for all possible parameter sets, and then extend the attack to cryptanalyze particular variants which explicitly resist the attack of Overbeck.
Language
English
HSG Classification
contribution to scientific community
Refereed
Yes
Publisher
Kluwer
Publisher place
Boston, Mass. [u.a.]
Volume
Special Issue on Network Coding and Designs
Start page
1
End page
22
Subject(s)
Division(s)
Eprints ID
251158