Pages that link to "Item:Q6103087"
From MaRDI portal
The following pages link to An estimator for the hardness of the MQ problem (Q6103087):
Displaying 7 items.
- Implementing Joux-Vitse's crossbred algorithm for solving \(\mathcal M\mathcal Q\) systems over \(\mathbb F_2\) on GPUs (Q1644755) (← links)
- On the complexity of solving quadratic Boolean systems (Q1931429) (← links)
- On the equivalence of two post-quantum cryptographic families (Q2687966) (← links)
- Connecting the Complexity of MQ- and Code-Based Cryptosystems (Q4606490) (← links)
- A multivariate quadratic challenge toward post-quantum generation cryptography (Q5270181) (← links)
- Building MPCitH-based signatures from MQ, MinRank, and rank SD (Q6547988) (← links)
- Biscuit: new MPCitH signature scheme from structured multivariate polynomials (Q6547993) (← links)