A modified Dual-Ouroboros public-key encryption using Gabidulin codes
From MaRDI portal
Publication:2032306
DOI10.1007/s00200-019-00406-xzbMath1465.94074OpenAlexW2991112432WikidataQ122585012 ScholiaQ122585012MaRDI QIDQ2032306
Lucky Erap Galvez, Myeong Jae Kim, Young Sik Kim, Jon-Lark Kim
Publication date: 11 June 2021
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-019-00406-x
Linear codes (general theory) (94B05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Key recovery attack on McNie based on low rank parity check codes and its reparation
- Dual-Ouroboros: an improvement of the McNie scheme
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
- Compact McEliece Keys from Goppa Codes
- On the inherent intractability of certain coding problems (Corresp.)
- Progress in Cryptology – Mycrypt 2005
- Coding and Cryptography
This page was built for publication: A modified Dual-Ouroboros public-key encryption using Gabidulin codes