Stronger bounds on the cost of computing Gröbner bases for HFE systems
Research output: Contribution to journal › Article › peer-review
Authors
Colleges, School and Institutes
External organisations
- Universite de Neuchatel, Switzerland
- University College Dublin
Abstract
We give upper bounds for the solving degree and the last fall degree of the polynomial system associated to the HFE (Hidden Field Equations) cryptosystem. Our bounds improve the known bounds for this type of systems. We also present new results on the connection between the solving degree and the last fall degree and prove that, in some cases, the solving degree is independent of coordinate changes.
Details
| Original language | English |
|---|---|
| Journal | Journal of Symbolic Computation |
| Early online date | 8 Jul 2020 |
| Publication status | E-pub ahead of print - 8 Jul 2020 |
Keywords
- Multivariate cryptography, Gröbner bases, HFE, (Fake) Weil descent, Last fall degree, Solving degree