基于因数分解和离散对数的数字签名方案

New Digital Signature Schemes Based on Factoring and Discrete Logarithms

提出了一种新的数字签名方案 ,它们的安全性均基于两个数学难题 :大数的因数分解和离散对数的求解问题的困难性 。

A new digital signature scheme is given, in which the security is based on the difficulties of computing discrete logarithms and factoring; its performance and security are consequently better than those of the signature schemes which are based on the difficulty of a single problem.