Minrank Problem
The MinRank Problem is a computational algebraic problem in multivariate cryptography that, given a set of matrices over a finite field and a target rank, seeks to find a linear combination of these matrices such that the resulting matrix has rank less than or equal to the target, distinguishing it from other decomposition problems by its focus on rank minimization over a linear space of matrices.
206
Publications
13.3K
Citations
360
Authors
207
Institutions
Publications per year
2017–2026
15
Parents
206
1–5 of 206
360
12
h-index
10
h-index
5
h-index
4
h-index
4
h-index
1–5 of 360
207
Queen's University
Kingston, Canada
10 h-index
12 publications
527 citations
Iowa State University
Ames, United States
10 h-index
20 publications
654 citations
Brigham Young University
Provo, United States
5 h-index
6 publications
149 citations
California Institute of Technology
Pasadena, United States
5 h-index
6 publications
825 citations

Shanghai University
Shanghai, China
5 h-index
10 publications
554 citations
American Institute of Mathematics
Pasadena, United States
5 h-index
7 publications
140 citations
Central University of Finance and Economics
Beijing, China
5 h-index
5 publications
135 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
4 h-index
6 publications
116 citations
1–8 of 207
34 publications · 2.9K citations
21
h-index
ELA · 10 publications · 185 citations
10
h-index
9 publications · 357 citations
9
h-index
6 publications · 626 citations
6
h-index
Repository · 5 publications · 124 citations
5
h-index
1–5