The complexity of the SupportMinors Modeling for the MinRank Problem
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912418189279232 |
|---|---|
| author | Cabarcas, Daniel Gaggero, Giulia Gorla, Elisa |
| author_facet | Cabarcas, Daniel Gaggero, Giulia Gorla, Elisa |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_06547 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The complexity of the SupportMinors Modeling for the MinRank Problem Cabarcas, Daniel Gaggero, Giulia Gorla, Elisa Cryptography and Security Commutative Algebra 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. |
| title | The complexity of the SupportMinors Modeling for the MinRank Problem |
| topic | Cryptography and Security Commutative Algebra |
| url | https://arxiv.org/abs/2506.06547 |