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

Authors

360

  1. YT
    Yongge Tian

    Central University of Finance and Economics, China

    15 publications · 659 citations

    12

    h-index

  2. LH
    Leslie Hogben

    Iowa State University, United States

    12 publications · 488 citations

    10

    h-index

  3. QW
    Qing‐Wen Wang

    Shanghai University, China

    5 publications · 277 citations

    5

    h-index

  4. SF
    Shaun Fallat

    University of Regina, Canada

    4 publications · 356 citations

    4

    h-index

  5. LB
    LeRoy B. Beasley

    Utah State University, United States

    4 publications · 51 citations

    4

    h-index

1–5 of 360

Venues

  1. Linear Algebra and its Applications

    34 publications · 2.9K citations

    21

    h-index

  2. Electronic Journal of Linear Algebra

    ELA · 10 publications · 185 citations

    10

    h-index

  3. Applied Mathematics and Computation

    9 publications · 357 citations

    9

    h-index

  4. 6

    h-index

  5. arXiv (Cornell University)

    Repository · 5 publications · 124 citations

    5

    h-index

1–5