LowMS: a new rank metric code-based KEM without ideal structure
From MaRDI portal
Publication:6489787
DOI10.1007/S10623-023-01330-5MaRDI QIDQ6489787FDOQ6489787
Victor Dyseryn, Pierre Loidreau, Nicolas Aragon, Philippe Gaborit, Julian Renner, Antonia Wachter-Zeh
Publication date: 22 April 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Cryptography (94A60) Combinatorial codes (94B25) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Secure integration of asymmetric and symmetric encryption schemes
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Title not available (Why is that?)
- Theory of codes with maximum rank distance
- Skew-Feedback Shift-Register Synthesis and Decoding Interleaved Gabidulin Codes
- A new rank metric codes based encryption scheme
- A modular analysis of the Fujisaki-Okamoto transformation
- A modified Dual-Ouroboros public-key encryption using Gabidulin codes
- On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
- On the security of the modified dual-Ouroboros PKE using Gabidulin codes
- Durandal: a rank metric based signature scheme
- Attacks and counter-attacks on the GPT public key cryptosystem
- Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem
- On the security of a Loidreau rank metric code based encryption scheme
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
- Progress in Cryptology - INDOCRYPT 2004
- A general decoding technique applicable to replicated file disagreement location and concatenated code decoding
- LRPC codes with multiple syndromes: near ideal-size KEMs without ideals
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)
