基于大数域因式分解的签名方案

现有的典型数字签名体制如RSA涉及大数的高次计算,因此效率并不高,特别是在需要 多次往返传输签名的情况下会较大地影响协议的执行速度。Rabin密码相对简单,但它要取用特殊 形式的素数。依据有限域中因式分解和二次剩余的特性,得到一种在GF(p)上有效求解二次模p方 程的算法,并根据该算法提出一种数字签名方案。该方案在安全性,效率上与Rabin签名方案相同, 但对素数地选取没有任何特殊的要求。

Digital signature based on factoring polynomials over a large infinite field

Some of representative digital signature scheme, such as RSA, make the use of large number and therefore the efficiency is not favorable, especially in the situation that the digital signatures are necessary to be commuted constantly. Rabin system is comparative simple, but it has to pick some special large prime to utilization. The paper provided a new digital signature scheme according to the characteristics of factoring polynomials over a large infinite field and quadratic residue. The scheme is not only as secure and effective as Rabin scheme,but also has not particular demand of the basic prime.