An algebraic approach to the rank support learning problem
From MaRDI portal
Publication:2118561
DOI10.1007/978-3-030-81293-5_23zbMath1485.94053arXiv2103.03558OpenAlexW3184332903MaRDI QIDQ2118561
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2103.03558
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (5)
Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems ⋮ Revisiting algebraic attacks on MinRank and on the rank decoding problem ⋮ Improving support-minors rank attacks: applications to G\textit{e}MSS and Rainbow ⋮ LRPC codes with multiple syndromes: near ideal-size KEMs without ideals ⋮ Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The computational complexity of some problems of linear algebra
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- Identity-based encryption from codes with rank metric
- New technique for decoding codes in the rank metric and its cryptography applications
- An algebraic attack on rank metric code-based cryptosystems
- Durandal: a rank metric based signature scheme
- 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
- On the Complexity of the Rank Syndrome Decoding Problem
- An Efficient Attack on All Concrete KKS Proposals
- Hybrid approach for solving multivariate systems over finite fields
- Cryptanalysis of MinRank
- Solving sparse linear equations over finite fields
- A digital signature scheme based on random error-correcting codes
- New Results for Rank-Based Cryptography
- Progress in Cryptology – Mycrypt 2005
This page was built for publication: An algebraic approach to the rank support learning problem
