Scholarlink

<p>In this note, we provide proven estimates for the complexity of the SupportMinors Modeling, mostly confirming the heuristic complexity estimates contained in the original article (Bardet (2020) Improvements of algebraic attacks for solving the rank decoding and MinRank problems. In: Advances in cryptology. Springer, pp 507–536).</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

The complexity of the SupportMinors Modeling for the MinRank Problem

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年3月30日

查看全文
  • Daniel Cabarcas,
  • Giulia Gaggero,
  • Elisa Gorla

摘要

In this note, we provide proven estimates for the complexity of the SupportMinors Modeling, mostly confirming the heuristic complexity estimates contained in the original article (Bardet (2020) Improvements of algebraic attacks for solving the rank decoding and MinRank problems. In: Advances in cryptology. Springer, pp 507–536).