On the Security of MinRank - Inria
On the Security of MinRank - Inria
On the Security of MinRank - Inria
SHOW LESS
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Complexity issues<br />
Open Question<br />
RD is NP-Complete ?<br />
A natural reduction<br />
By reduction from MR, i.e. f :<br />
MR(N, n, k, M 0 , M 1 , . . . , M k , w) ↦→ RD(N, n, k, G, y, w),<br />
with :<br />
L i = vect B (M i ) ∈ (F q N ) n , for all i, 1 ≤ i ≤ k<br />
G = t (L 1 , . . . , L k )<br />
y = vect B (M 0 ) ∈ (F q N ) n .
Change language