Stronger bounds on the cost of computing Groebner bases for HFE systems

11/02/2020

∙

by   Elisa Gorla, et al.

∙

0

∙

share

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.