Abstract:Many systems of interest in cryptography consist of equations of the same degree. Under the assumption that the degree of regularity is finite, we prove upper bounds on the degree of regularity of a system of equations of the same degree, with or without adding the field equations to the system. The bounds translate into upper bounds on the solving degree of the systems, and hence on the complexity of solving them via Gröbner bases methods. Our bounds depend on the number of equations in the system, the number of variables, and the degree of the equations.
From: Elisa Gorla [view email]
[v1]
Thu, 7 Sep 2023 17:14:59 UTC (339 KB)
[v2]
Mon, 18 Nov 2024 13:22:52 UTC (20 KB)
[v3]
Fri, 30 Jan 2026 10:48:34 UTC (23 KB)
[v4]
Mon, 10 Aug 2026 06:42:09 UTC (22 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。