Pages that link to "Item:Q2302132"
From MaRDI portal
The following pages link to On the complexity of ``Superdetermined'' minrank instances (Q2302132):
Displaying 14 items.
- On the complexity of the generalized MinRank problem (Q390388) (← links)
- A multivariate cryptosystem inspired by random linear codes (Q1995213) (← links)
- An algebraic attack on rank metric code-based cryptosystems (Q2055648) (← links)
- Multivariate public key cryptosystem from Sidon spaces (Q2061921) (← links)
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems (Q2692353) (← links)
- A Rank Attack Against Extension Field Cancellation (Q5041231) (← links)
- The Complexity of MinRank (Q5048630) (← links)
- Revisiting algebraic attacks on MinRank and on the rank decoding problem (Q6063136) (← links)
- Improvement of algebraic attacks for solving superdetermined MinRank instances (Q6111581) (← links)
- On the complexity of solving generic overdetermined bilinear systems (Q6163795) (← links)
- 2F -- a new method for constructing efficient multivariate encryption schemes (Q6166982) (← links)
- Algebraic relation of three MinRank algebraic modelings (Q6169016) (← links)
- A new approach based on quadratic forms to attack the McEliece cryptosystem (Q6604863) (← links)
- Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants (Q6637328) (← links)
