隐多项式密码系统
Hidden Polynomial(s) Cryptosystems
摘要：
我们提出的隐藏单项密码系统的类的变化，以使其抵抗所有已知的攻击。我们使用的身份建立在一个单一的二元多项式方程的系数在有限域。事实上，它也可以被一个“小”的理想所取代。在整个过程中，我们也建立了概率加密协议。同样的思想也适用于数字签名算法。我们的方案工作以及微分领域的积极特征，并在其他地方。
英文摘要：
We propose variations of the class of hidden monomial cryptosystems in order to make it resistant to all known attacks. We use identities built upon a single bivariate polynomial equation with coefficients in a finite field. Indeed, it can be replaced by a ``small'' ideal, as well. Throughout, we set up probabilistic encryption protocols, too. The same ideas extend to digital signature algorithms, as well. Our schemes work as well on differential fields of positive characteristic, and elsewhere.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
