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

A Digital Signature Scheme Based on Discrete Logarithms and Factoring

目前,公钥密码系统的安全性主要建立在一个数学难题之在,如离散对数问题或因数分解问题等。随着科技的发展和密码学研究的不断深入,很难保证这些数学难题不被有效地解决。但多个数学难题同时变得容易求解是不太可能的。本文提出了一个新的数字签名方案,并对该方案进行了安全性分析,证明了其安全性是同时基于离散对数和因数分解困难性的。

At present,the security of public key cryptography system is mainly built on a mathematical problem,such as the discrete logarithm problem and the factorization problem.With development of technology and cryptography,it is difficult to ensure that these mathematical problems are not solved.But it is unlikely to solve these problems at the same time.This paper proposes a new digital signature scheme and analyzes security of the new scheme,shows the scheme is based on discrete logarithms and factoring simultaneously.