Publication: Extension of Overbeck’s attack for Gabidulin-based cryptosystems
Extension of Overbeck’s attack for Gabidulin-based cryptosystems
Date
Date
Date
Citations
Horlemann-Trautmann, A.-L., Marshall, K., & Rosenthal, J. (2018). Extension of Overbeck’s attack for Gabidulin-based cryptosystems. Designs, Codes and Cryptography, 86(2), 319–340. https://doi.org/10.1007/s10623-017-0343-7
Abstract
Abstract
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 t
Metrics
Downloads
Views
Additional indexing
Creators (Authors)
- Horlemann-Trautmann, Anna-Lena
- Marshall, Kyle
- Rosenthal, Joachim
Volume
Volume
Volume
Number
Number
Number
Page range/Item number
Page range/Item number
Page range/Item number
Page end
Page end
Page end
Item Type
Item Type
Item Type
In collections
Language
Language
Language
Publication date
Publication date
Publication date
Date available
Date available
Date available
ISSN or e-ISSN
ISSN or e-ISSN
ISSN or e-ISSN
OA Status
OA Status
OA Status
Publisher DOI
Metrics
Downloads
Views
Citations
Horlemann-Trautmann, A.-L., Marshall, K., & Rosenthal, J. (2018). Extension of Overbeck’s attack for Gabidulin-based cryptosystems. Designs, Codes and Cryptography, 86(2), 319–340. https://doi.org/10.1007/s10623-017-0343-7
