论文标题
HFE系统计算Groebner基础的成本的范围更强
Stronger bounds on the cost of computing Groebner bases for HFE systems
论文作者
论文摘要
我们给出了与HFE（隐藏场方程）密码系统相关的求解程度的上限和最后一个秋季程度。我们的界限改善了此类系统的已知界限。我们还提出了有关解决方案程度和最后一个秋季程度之间联系的新结果，并证明在某些情况下，解决方案与坐标变化无关。
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.
