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 - 10 of 31
-
PublicationDensities of codes of various linearity degrees in translation-invariant metric spaces( 2024)
;Anina GruicaAlberto RavagnaniType: journal articleJournal: Designs, Codes and Cryptography -
PublicationThe Subfield Metric and Applications to Quantum Error Correction( 2024)
;Markus GrasslVioletta WegerType: journal articleJournal: Journal of Algebra and Its Applications -
PublicationOn the hardness of the Lee syndrome decoding problem( 2024)
;Weger, Violetta ;Khathuria, Karan ;Battglioni, Massimo ;Santini, PaoloPersichetti, EdoardoType: journal articleJournal: Advances in Mathematics of CommunicationVolume: 18Issue: 1 -
PublicationType: journal articleJournal: Lecture Notes in Computer Science (LNCS)
-
PublicationType: journal articleVolume: 15Issue: 4
Scopus© Citations 30 -
PublicationType: journal articleVolume: 14Issue: 1
-
-
PublicationEquivalence and Characterizations of Linear Rank-Metric Codes Based on Invariants( 2020)
;Neri, Alessandro ;Puchinger, Sven -
Publicationt-Private Information Retrieval Schemes Using Transitive Codes( 2019-09)
;Freij-Hollanti, Ragnar ;Gnilke, Oliver ;Hollanti, Camilla ;Karpuk, DavidKubjas, IvoType: journal articleJournal: IEEE Transaction on Information TheoryVolume: 65Issue: 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