Pages that link to "Item:Q1019747"
From MaRDI portal
The following pages link to Minimal achievable approximation ratio for MAX-MQ in finite fields (Q1019747):
Displaying 5 items.
- Polly cracker, revisited (Q285245) (← links)
- Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited (Q527403) (← links)
- On the bounds and achievability about the ODPC of \(\mathrm{GRM}(2,m)^*\) over prime fields for increasing message length (Q2260787) (← links)
- A New Method for Solving Polynomial Systems with Noise over $\mathbb{F}_2$ and Its Applications in Cold Boot Key Recovery (Q3455484) (← links)
- A New Approximate Min-Max Theorem with Applications in Cryptography (Q3459902) (← links)