Publication: Considerations for rank-based cryptosystems
Considerations for rank-based cryptosystems
Date
Date
Date
Citations
Horlemann-Trautmann, A.-L., Marshall, K., & Rosenthal, J. (2016). Considerations for rank-based cryptosystems. 2016 IEEE International Symposium on Information Theory (ISIT), 2544–2548. https://doi.org/10.1109/ISIT.2016.7541758
Abstract
Abstract
Abstract
Cryptosystems based on rank metric codes have been considered as an alternative to McEliece cryptosystems due to the relative difficulty of solving the rank syndrome decoding problem. Generic attacks have recently seen several improvements, notably in the work of Gaborit et al., who give an improved algorithm using linearized polynomials which yields a polynomial time algorithm for certain parameters. On the structural side, many of the proposals for cryptosystems based on Gabidulin codes have proven to be weak, following an attack by
Metrics
Views
Additional indexing
Creators (Authors)
- Horlemann-Trautmann, Anna-Lena
- Marshall, Kyle
- Rosenthal, Joachim
Event Title
Event Title
Event Title
Event Location
Event Location
Event Location
Event Start Date
Event Start Date
Event Start Date
Event End Date
Event End Date
Event End Date
Publisher
Publisher
Publisher
Page Range
Page Range
Page Range
Page end
Page end
Page end
Item Type
Item Type
Item Type
In collections
Language
Language
Language
Date available
Date available
Date available
ISBN or e-ISBN
ISBN or e-ISBN
ISBN or e-ISBN
OA Status
OA Status
OA Status
Free Access at
Free Access at
Free Access at
Publisher DOI
Metrics
Views
Citations
Horlemann-Trautmann, A.-L., Marshall, K., & Rosenthal, J. (2016). Considerations for rank-based cryptosystems. 2016 IEEE International Symposium on Information Theory (ISIT), 2544–2548. https://doi.org/10.1109/ISIT.2016.7541758
