On the rank decoding problem over finite principal ideal rings
From MaRDI portal
Publication:6584334
DOI10.3934/AMC.2023003zbMATH Open1547.94489MaRDI QIDQ6584334
Hervé Talé Kalachi, Hermann Tchatchiem Kamche
Publication date: 6 August 2024
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
complexityhardnesscombinatorial algorithmsrank metric codesfinite principal ideal ringsrank decoding problem
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Attacks and counter-attacks on the GPT public key cryptosystem
- MDS codes over finite principal ideal rings
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Improved cryptanalysis of rank metric schemes based on Gabidulin codes
- Polynomial functions over finite commutative rings
- Extension of Overbeck's attack for Gabidulin-based cryptosystems
- New technique for decoding codes in the rank metric and its cryptography applications
- Algebraic geometric codes over rings
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- Linear codes over finite chain rings
- Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer
- An algebraic attack on rank metric code-based cryptosystems
- Low-rank parity-check codes over Galois rings
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Matrix product codes over finite commutative Frobenius rings
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Modified GPT PKC with right scrambler
- The Security of the Gabidulin Public Key Cryptosystem
- On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
- On the Complexity of the Rank Syndrome Decoding Problem
- Maximum rank distance codes as space~time codes
- Designing a Rank Metric Based McEliece Cryptosystem
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- On the inherent intractability of certain coding problems (Corresp.)
- FINITE QUASI-FROBENIUS MODULES AND LINEAR CODES
- Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
- Rank-Metric Codes Over Finite Principal Ideal Rings and Applications
- Progress in Cryptology – Mycrypt 2005
- Rank-Metric Codes and Their Applications
- Coding and Cryptography
This page was built for publication: On the rank decoding problem over finite principal ideal rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6584334)