Stronger bounds on the cost of computing Groebner bases for HFE systems
Cryptography and Security
2020-11-03 v1 Commutative Algebra
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.
Keywords
Cite
@article{arxiv.2011.01050,
title = {Stronger bounds on the cost of computing Groebner bases for HFE systems},
author = {Elisa Gorla and Daniela Mueller and Christophe Petit},
journal= {arXiv preprint arXiv:2011.01050},
year = {2020}
}
Comments
15 pages