Options
Anna-Lena Horlemann
Title
Prof. Dr.
Last Name
Horlemann
First name
Anna-Lena
Email
anna-lena.horlemann@unisg.ch
Phone
+41 71 224 2655
Now showing
1 - 4 of 4
-
PublicationExtension of Overbeck's Attack for Gabidulin Based CryptosystemsCryptosystems 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.Type: journal articleVolume: 86Issue: 2
-
PublicationExtension of Overbeck’s attack for Gabidulin-based cryptosystemsCryptosystems 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.Type: journal articleJournal: Designs, codes and cryptography : an international journalVolume: Special Issue on Network Coding and Designs
Scopus© Citations 25 -
PublicationOn the genericity of maximum rank distance and Gabidulin codes(Kluwer, 2017-04-08)
Scopus© Citations 42 -
PublicationConstructions of Constant Dimension CodesIn this article we give an overview of general constructions of constant dimension codes, also called Grassmannian codes.Type: book section