A new signature scheme based on multiple hard number theoretic problems
A new signature scheme based on multiple hard number theoretic problems
复制标题
一种基于多个硬数论问题的新签名方案
DOI：
10.5402/2011/231649
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
N. Tahat
中科院分区：
文献类型：
--
作者：
E. S. Ismail;N. Tahat
在过去的几年里，人们已经尝试了许多基于单个难题（如因子分解或离散对数）构建数字签名方案的尝试。但在不久的将来，如果发现了分解或离散时间问题的解决方案，这些系统将不再是安全的。本文基于因子分解和离散对数这两个硬数论问题提出了一个新的签名方案。我们方案的主要优点是，它是非常不可能的因式分解和离散算法可以有效地同时解决，因此，我们的方案的安全性是更长或更高的任何基于一个单一的硬数论问题的方案，我们还表明，该方案的性能只需要最少的操作，在签名和验证算法，是抵抗攻击。
The past years have seen many attempts to construct digital signature schemes based on a single hard problem, like factoring or discrete logarithm. But in the near future, those systems will no longer be secure if the solution of factoring or discrete logarithms problems is discovered. In this paper, we propose a new signature scheme based on two hard number theoretic problems, factoring and discrete logarithms. The major advantage of our scheme is that it is very unlikely that factoring and discrete logarithms can be efficiently solved simultaneously, and; therefore, the security of our scheme is longer or higher than that of any scheme based on a single hard number theoretic problem.We also show that the performance of the scheme requires only minimal operation both in signing and verifying logarithms and is resistant to attack.