Table of Contents
ISRN Communications and Networking
Volume 2011 (2011), Article ID 231649, 3 pages
Research Article

A New Signature Scheme Based on Multiple Hard Number Theoretic Problems

1School of Mathematical Sciences, Faculty of Science and Techology, National University of Malaysia, 43600 Bangi, Selangor, Malaysia
2Department of Mathematics, Faculty of Sciences, The Hashemite University, Zarqa 13133, Jordan

Received 23 March 2011; Accepted 4 May 2011

Academic Editor: R. Pérez Jiménez

Copyright © 2011 E. S. Ismail and N. M. F. Tahat. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.