LRPC codes with multiple syndromes: near ideal-size KEMs without ideals
From MaRDI portal
Publication:6111575
DOI10.1007/978-3-031-17234-2_3zbMath1517.94047arXiv2206.11961OpenAlexW4297042486MaRDI QIDQ6111575
Nicolas Aragon, Victor Dyseryn, Gilles Zémor, Carlos Aguilar-Melchor, Philippe Gaborit
Publication date: 7 July 2023
Published in: Post-Quantum Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.11961
code-based cryptographypost-quantum cryptographyLRPC codesrank-based cryptographyrank support learning
Related Items (2)
Revisiting algebraic attacks on MinRank and on the rank decoding problem ⋮ Analysis of the security of the PSSI problem and cryptanalysis of the Durandal signature scheme
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Attacks and counter-attacks on the GPT public key cryptosystem
- Theory of codes with maximum rank distance
- The computational complexity of some problems of linear algebra
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- Ouroboros: a simple, secure and efficient key exchange protocol based on coding theory
- Identity-based encryption from codes with rank metric
- An algebraic attack on rank metric code-based cryptosystems
- An algebraic approach to the rank support learning problem
- Durandal: a rank metric based signature scheme
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
- New Results for Rank-Based Cryptography
- Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- Progress in Cryptology - INDOCRYPT 2004
- Coding and Cryptography
This page was built for publication: LRPC codes with multiple syndromes: near ideal-size KEMs without ideals
