极小逼近基的证明
Certification of minimal approximant bases
摘要:
对于给定的计算问题,证书是一段数据,其中一个(证明者)附加到输出,目的是允许有效验证(由验证者)该输出是正确的。在这里,我们考虑的最小逼近基问题,已知的最快的算法输出一个多项式矩阵的尺寸$m \times m$和平均度$D/m$使用$O\tilde{~}(m^ω\frac{D}{m})$字段操作。我们提出了一个证书,对于典型的情况下的问题,计算证明使用$O(m^ω\frac{D}{m})$额外的字段操作,并允许验证的近似基础的蒙特卡罗算法与成本界$O(m^ω+ m D)$。除了理论兴趣之外,我们的动机还来自于这样一个事实:逼近基出现在一元多项式上线性代数的大多数已知最快算法中;因此,这项工作可能有助于设计其他多项式矩阵计算的证书。此外,诸如打破离散对数计算或整数分解的记录等加密挑战特别依赖于计算大型实例的最小近似基:然后可以使用证书来在外包和易出错的集群上提供可靠的计算。
英文摘要:
For a given computational problem, a certificate is a piece of data that one (the prover) attaches to the output with the aim of allowing efficient verification (by the verifier) that this output is correct. Here, we consider the minimal approximant basis problem, for which the fastest known algorithms output a polynomial matrix of dimensions $m \times m$ and average degree $D/m$ using $O\tilde{~}(m^ω\frac{D}{m})$ field operations. We propose a certificate which, for typical instances of the problem, is computed by the prover using $O(m^ω\frac{D}{m})$ additional field operations and allows verification of the approximant basis by a Monte Carlo algorithm with cost bound $O(m^ω+ m D)$. Besides theoretical interest, our motivation also comes from the fact that approximant bases arise in most of the fastest known algorithms for linear algebra over the univariate polynomials; thus, this work may help in designing certificates for other polynomial matrix computations. Furthermore, cryptographic challenges such as breaking records for discrete logarithm computations or for integer factorization rely in particular on computing minimal approximant bases for large instances: certificates can then be used to provide reliable computation on outsourced and error-prone clusters.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。