Pages that link to "Item:Q2692353"

The following pages link to Improvements of algebraic attacks for solving the rank decoding and MinRank problems (Q2692353):

Displaying 38 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)
• Combinatorial Rank Attacks Against the Rectangular Simple Matrix Encryption Scheme (Q5041227) (← 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)
• Exploiting ROLLO's constant-time implementations with a single-trace analysis (Q6130605) (← links)
• On the complexity of solving generic overdetermined bilinear systems (Q6163795) (← links)
• MR-DSS -- smaller MinRank-based (ring-)signatures (Q6166980) (← links)
• IPRainbow (Q6166981) (← links)
• Algebraic relation of three MinRank algebraic modelings (Q6169016) (← links)
• A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes (Q6204542) (← links)
• Improvements of Algebraic Attacks for solving the Rank Decoding and MinRank problems (Q6335155) (← links)
• On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography (Q6487414) (← links)
• LowMS: a new rank metric code-based KEM without ideal structure (Q6489787) (← links)
• Analysis of multivariate encryption schemes: application to Dob and \(C^*\) (Q6536745) (← links)
• On the security of REDOG (Q6547910) (← links)
• Algebraic algorithm for the alternating trilinear form equivalence problem (Q6550580) (← links)
• Column cyclic rank metric codes and linear complementary dual rank metric codes (Q6580197) (← links)
• On the rank decoding problem over finite principal ideal rings (Q6584334) (← links)
• Blockwise rank decoding problem and LRPC codes: cryptosystems with smaller sizes (Q6595927) (← links)
• Two modifications for Loidreau's code-based cryptosystem (Q6602397) (← links)
• A new approach based on quadratic forms to attack the McEliece cryptosystem (Q6604863) (← links)
• A polynomial time key-recovery attack on the Sidon cryptosystem (Q6618602) (← links)
• VDOO: a short, fast, post-quantum multivariate digital signature scheme (Q6623354) (← links)
• Improved cryptanalysis of HFERP (Q6635760) (← links)
• Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants (Q6637328) (← links)
• MPC in the head using the subfield bilinear collision problem (Q6648188) (← links)
• Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme (Q6648191) (← links)