arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1706.06319cs.CRmath.AC
收藏

多元多项式系统的求解与交换代数的一个不变量

Solving multivariate polynomial systems and an invariant from commutative algebra

Alessio Caminata, Elisa Gorla

摘要:

通过Groebner基计算计算多元多项式方程组的解的复杂性的上界是由解度的函数。在本文中,我们讨论了如何严格估计系统的解决程度,集中在公钥密码学中出现的系统。特别是,我们表明,它的上限,往往等于,Castelnuovo-Mumford正则性的理想所产生的均匀化的方程的系统,或由方程本身的情况下,他们是齐次的。我们讨论了基本的交换代数,并阐明了在哪些假设下,常用的结果。特别是,我们讨论的假设是在通用的坐标(通常需要的边界获得以下这种类型的方法),并证明系统包含的字段方程或其假韦伊下降是在通用坐标。我们还比较了解度的概念与文献中常用的正则度的概念。我们补充了一些例子,我们所描述的策略后获得的边界的文件。

英文摘要:

The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate the solving degree of a system, focusing on systems arising within public-key cryptography. In particular, we show that it is upper bounded by, and often equal to, the Castelnuovo-Mumford regularity of the ideal generated by the homogenization of the equations of the system, or by the equations themselves in case they are homogeneous. We discuss the underlying commutative algebra and clarify under which assumptions the commonly used results hold. In particular, we discuss the assumption of being in generic coordinates (often required for bounds obtained following this type of approach) and prove that systems that contain the field equations or their fake Weil descent are in generic coordinates. We also compare the notion of solving degree with that of degree of regularity, which is commonly used in the literature. We complement the paper with some examples of bounds obtained following the strategy that we describe.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑