Pages that link to "Item:Q2692353"
From MaRDI portal
The following pages link to Improvements of algebraic attacks for solving the rank decoding and MinRank problems (Q2692353):
Displayed 31 items.
- Cryptanalysis of a code-based full-time signature (Q1981793) (← links)
- Improved cryptanalysis of UOV and Rainbow (Q2056691) (← links)
- Multivariate public key cryptosystem from Sidon spaces (Q2061921) (← links)
- A gapless code-based hash proof system based on RQC and its applications (Q2099170) (← links)
- Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric (Q2118524) (← links)
- New practical multivariate signatures from a nonlinear modifier (Q2118527) (← links)
- An algebraic approach to the rank support learning problem (Q2118561) (← links)
- Efficient key recovery for all HFE signature variants (Q2120067) (← links)
- Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge (Q2693627) (← links)
- A Novel Niederreiter-like cryptosystem based on the (<i>u</i>|<i>u</i> + <i>υ</i>)-construction codes (Q5021116) (← links)
- Rank-Metric Codes and Their Applications (Q5863764) (← links)
- Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems (Q6057202) (← links)
- Revisiting algebraic attacks on MinRank and on the rank decoding problem (Q6063136) (← links)
- Refined F5 Algorithms for Ideals of Minors of Square Matrices (Q6081937) (← links)
- New time-memory trade-offs for subset sum -- improving ISD in theory and practice (Q6083669) (← links)
- Breaking rainbow takes a weekend on a laptop (Q6104343) (← links)
- Cryptanalysis and repair of a Gabidulin code based cryptosystem from ACISP 2018 (Q6108778) (← links)
- Improving support-minors rank attacks: applications to G\textit{e}MSS and Rainbow (Q6108987) (← links)
- LRPC codes with multiple syndromes: near ideal-size KEMs without ideals (Q6111575) (← links)
- Improvement of algebraic attacks for solving superdetermined MinRank instances (Q6111581) (← links)
- Exploiting ROLLO's constant-time implementations with a single-trace analysis (Q6130605) (← links)
- McEliece-type encryption based on Gabidulin codes with no hidden structure (Q6134010) (← links)
- MinRank in the head. Short signatures from zero-knowledge proofs (Q6145535) (← links)
- Take your MEDS: digital signatures from matrix code equivalence (Q6145536) (← links)
- Graph-theoretic algorithms for the alternating trilinear form equivalence problem (Q6145942) (← links)
- On the complexity of solving generic overdetermined bilinear systems (Q6163795) (← links)
- MR-DSS -- smaller MinRank-based (ring-)signatures (Q6166980) (← links)
- IPRainbow (Q6166981) (← links)
- 2F -- a new method for constructing efficient multivariate encryption schemes (Q6166982) (← links)
- Algebraic relation of three MinRank algebraic modelings (Q6169016) (← links)
- A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes (Q6204542) (← links)