LowMS: a new rank metric code-based KEM without ideal structure
From MaRDI portal
(Redirected from Publication:6489787)
Recommendations
- LRPC codes with multiple syndromes: near ideal-size KEMs without ideals
- Two new module-code-based KEMs with rank metric
- A new encryption scheme based on rank metric codes
- Cryptanalysis of Rank-Metric Schemes Based on Distorted Gabidulin Codes
- An IND-CCA-secure code-based encryption scheme using rank metric
Cites work
- A general decoding technique applicable to replicated file disagreement location and concatenated code decoding
- A modified Dual-Ouroboros public-key encryption using Gabidulin codes
- A modular analysis of the Fujisaki-Okamoto transformation
- A new rank metric codes based encryption scheme
- Attacks and counter-attacks on the GPT public key cryptosystem
- Durandal: a rank metric based signature scheme
- Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem
- scientific article; zbMATH DE number 3989251 (Why is no real title available?)
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
- LRPC codes with multiple syndromes: near ideal-size KEMs without ideals
- On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
- On the security of a Loidreau rank metric code based encryption scheme
- On the security of the modified dual-Ouroboros PKE using Gabidulin codes
- Progress in Cryptology - INDOCRYPT 2004
- Secure integration of asymmetric and symmetric encryption schemes
- Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Theory of codes with maximum rank distance
Cited in
(2)
This page was built for publication: LowMS: a new rank metric code-based KEM without ideal structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489787)
