A modified Dual-Ouroboros public-key encryption using Gabidulin codes
DOI10.1007/S00200-019-00406-XzbMATH Open1465.94074OpenAlexW2991112432WikidataQ122585012 ScholiaQ122585012MaRDI QIDQ2032306FDOQ2032306
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
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Linear codes (general theory) (94B05)
Cites Work
- Title not available (Why is that?)
- Bilinear forms over a finite field, with applications to coding theory
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Compact McEliece Keys from Goppa Codes
- Structural attacks for public key cryptosystems based on Gabidulin codes
- On the inherent intractability of certain coding problems (Corresp.)
- Theory of codes with maximum rank distance
- Coding and Cryptography
- Progress in Cryptology – Mycrypt 2005
- Key recovery attack on McNie based on low rank parity check codes and its reparation
- Dual-Ouroboros: an improvement of the McNie scheme
- On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
Cited In (3)
Uses Software
This page was built for publication: A modified Dual-Ouroboros public-key encryption using Gabidulin codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2032306)