New ID-Based Digital Signature Scheme on Factoring and Discrete Logarithms
Nedal Mohammad Tahat, Zead Mustafa, A. K. Alomari · 2012
The past years have seen many attempts to construct identity based signature schemes on a single hard problem, like factoring or discrete logarithms. 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 identification based signature scheme on factoring (FAC) problem and discrete logarithms (DL) problems. Having concatenated FAC and DL hard problems, the presented scheme has solid structure and will hopelessly leave the eavesdropper baffled. The performance analysis has been given to describe the proposed scheme in terms of security level. In addition, the scheme protects the signer from chosen-message attack and also identifies a forged signature. At the moment, no malicious attacks are capable of ‘‘breaking” this scheme in a reasonable amount of time obviously. We also show that the performance of the scheme requires only minimal operation both in signing and verifying logarithms and is resistant to attack.