Stronger bounds on the cost of computing Groebner bases for HFE systems
arXiv:2011.01050v110 citations
AI Analysis
This work offers incremental improvements in cryptanalysis for security researchers, focusing on specific bounds for HFE systems.
The paper tackles the problem of computing Gröbner bases for HFE cryptosystems by providing improved upper bounds on solving degree and last fall degree, which enhance computational efficiency in cryptanalysis.
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.