Welcome to the resource topic for 2020/1376
Title:
Stronger bounds on the cost of computing Groebner bases for HFE systems
Authors: Elisa Gorla, Daniela Mueller, Christophe Petit
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.
ePrint: https://eprint.iacr.org/2020/1376
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .