ISRN Communications and Networking

Volume 2011, Article ID 231649, 3 pages

http://dx.doi.org/10.5402/2011/231649

## A New Signature Scheme Based on Multiple Hard Number Theoretic Problems

^{1}School of Mathematical Sciences, Faculty of Science and Techology, National University of Malaysia, 43600 Bangi, Selangor, Malaysia^{2}Department 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.

#### Abstract

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.

#### 1. Introduction

A digital signature scheme is used to authenticate the contents of a digital message, and a valid digital signature tells that the message was generated by a legal/known sender and was not altered during the transmission. Digital signatures are commonly applicable for software distribution, internet-based transactions, forgery detection or tampering. Most digital signature schemes have the common feature that they are based on a single cryptographic assumption [1], like discrete logarithms (DL) [2] or factoring a large composite number problem (FAC) [3]. Although such problems remain difficult to solve today, it is almost inevitable that one day the FAC and DL problems could be solved. As soon as this happens, signatures based on such problems will no longer be secure. This has led researchers to propose digital signature schemes based on multiple hard number theoretic problems [4–9].

The major motivation for this research is that such schemes are more secure than the schemes based on a single hard problem. However, many such schemes have been shown to be insecure [10, 11] due to the use of inappropriate algorithms and weak analysis of security. (See Qian et al. [12] for details of an example of an insecure signature scheme.) In this paper, we develop a new signature scheme based on a combination of factoring and discrete logarithm problems. We show that the performance of the new scheme is very efficient since it requires acceptable numbers of operations in both signature generation and signature verification.

In the following, Section 2 presents the proposed signature scheme. Section 3 analyzes the resultant security and efficiency from the new scheme, and finally, Section 4 gives our conclusions.

#### 2. The Proposed Signature Scheme

The main purpose of proposing a signature scheme based on two hard problems is to enhance the security of the scheme. The difficulty of simultaneously solving two hard problems is harder than solving a single hard problem. The proposed scheme remains secure even if one can find a solution to one of the underlying problems.

The proposed signature scheme involves the one-to-one interactions between a signer and a verifier to execute the system initialization phase, the key generation phase, the signature generation phase, and the signature verification phase, described as follows.

##### 2.1. System Initialization Phase

The system initialization phase proceeds with the following commonly required parameters over the defined multiplicative groups. A one-way hash function is applied in the scheme with standard cryptographic characteristics, and to prevent the chosen message attack as defined by ElGamal [2] and Harn [13], the length of the signed message is reducible: (1)a cryptographic hash function whose output is a -bitlength. In practice, we take ;(2)a large prime , and is a factor of and also the product of two safe primes, and , where . A function defined by is the phi-Euler function;(3)an integer is a primitive element in with order such that ;(4)an integer and is a square modulo if there exists an such that , where denotes the greatest common divisor of and .

##### 2.2. Key Generation Phase

In this phase, we do the following steps.(1)Pick randomly an integer from .(2)Calculate the secret number such that .(3)Select at random an integer .(4)Compute the public number .

The public and secret keys of the signature scheme are now, respectively, given by the pairs of and .

##### 2.3. Signature Generation Phase

To create a signature for the message , , the signer first hashes the message to obtain . Next, the signer randomly chooses a secret integer, , such that and then computes . The signer does the following steps.(1)Solve and for and .(2)Compute and .(3)Calculate .

Then the original signer publishes as the signature of the message .

##### 2.4. Signature Verification Phase

The verifier confirms the validity of the signature for as follows.(1)Compute and .(2)Check the equality .(3)If the equality in (2) holds, then validates the signature otherwise rejects it.

Theorem 1. *Following the applied protocol, then the verification in the Signature Verification Phase is correct.*

*Proof. *The equation in (2) in Signature Verification Phase is true for valid signatures since

#### 3. Security and Performance Analyses

##### 3.1. Security Considerations

Now we will show some possible attacks by which an adversary (Adv) may try to take down the proposed signature scheme. We define each attack and provide an analysis of why each attack would fail.

###### 3.1.1. Attack 1

Adv wishes to obtain all secret keys using all information that is available from the system. In this case, Adv needs to solve FAC and DL problems, which is clearly infeasible.

###### 3.1.2. Attack 2

Adv tries to forge via the equation , and Adv has to ways two do this. First, he or she fixes the number , computes and finally solves , for . Second, he or she fixes the number , computes , and solves for . In both scenarios, solving for such numbers is hard due to the difficulty of FAC and DL problems, only successful if Adv can solve the two problems simultaneously.

###### 3.1.3. Attack 3

Adv may also try collecting valid signatures on message to find the valuable secret keys. In this case, Adv has equations as follows: where . Note that, the above equations have variables, that is, and . These secret variables are hard to find because Adv can generate infinite solutions of the above system of equations but cannot figure out which one is correct.

###### 3.1.4. Attack 4

Let us assume that Adv is able to solve the DL problem meaning that, Adv knows the secret integer . Unfortunately for his efforts, he still does not know and hence cannot compute the two components and , thereby failing to calculate the integer .

###### 3.1.5. Attack 5

Let us assume that Adv is able to solve the FAC problem, that is, he or she knows the prime factorization of modulus and can find the number . However, he cannot compute and since no information is known for and thus fails to compute .

##### 3.2. Performance

The performance of our scheme is described in terms of number of keys, computational complexity, and communication costs. We use the following notations (Table 1) to analyze the performance of our scheme.

We ignore the negligible time performing for modular addition. The performance of our proposed signature scheme is summarized as follows: The number of secret keys (SK) and public keys (PK) of the scheme are respectively given by SK = 2 and PK = 2. The computational complexity for the key generation and signing generation and verification is given by the following Table 2, and the last column converts various operation units to , where given by Koblitz et al. [14].

Finally, the communication costs or size of parameters of the scheme (both signature generation and verification) is , where denotes the bitlength of .

#### 4. Conclusion

In this paper, we have proposed a new signature scheme based on two hard problems; factoring and discrete logarithms. The scheme offers a longer/higher level of security than that of scheme based on a single hard problem. Furthermore, the proposed scheme requires only and , respectively, for both signature generation and verification. We considered some possible attacks and demonstrated that the proposed scheme would be secure against those attacks.

#### Acknowledgments

The first author acknowledges the financial support received from the Malaysian Fundamental Research Grant Scheme (FRGS) UKM-ST-07-FRGS0008-2009 and also an anonymous reviewer for their valuable comments.

#### References

- W. Diffie and M. E. Hellman, “New direction in cryptography,”
*IEEE Transaction on Information Networking and Application*, pp. 557–560, 1975. View at Publisher · View at Google Scholar - T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms,”
*IEEE Transaction on Information Theory*, vol. IT-31, no. 4, pp. 469–472, 1985. View at Google Scholar - R. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signature and public-key cryptosystem,”
*Communications of the ACM*, vol. 21, no. 2, pp. 120–126, 1978. View at Publisher · View at Google Scholar · View at Scopus - W. He, “Digital signature scheme based on factoring and discrete logarithms,”
*Electronics Letters*, vol. 37, no. 4, pp. 220–222, 2001. View at Google Scholar · View at Scopus - C. S. Laih and W. C. Kuo, “New signature scheme based on factoring and discrete logarithms,”
*IEICE Transactions on Fundamentals on Cryptography and Information Security*, vol. 80, no. 1, pp. 46–53, 1997. View at Google Scholar - N. Y. Lee and T. Hwang, “Modified Harn signature scheme based on factorising and discrete logarithms,”
*IEE Proceedings-Computers and Digital Techniques*, vol. 143, no. 3, pp. 196–198, 1996. View at Google Scholar · View at Scopus - Z. Shao, “Digital signature schemes based on factoring and discrete logarithms,”
*Electronics Letters*, vol. 38, no. 24, pp. 1518–1519, 2002. View at Publisher · View at Google Scholar · View at Scopus - Z. Shao, “Signature schemes based on factoring and discrete logarithms,”
*IEE Proceedings Computers and Digital Techniques*, vol. 142, no. 5, pp. 370–372, 1998. View at Google Scholar · View at Scopus - C. T. Wang and C. C. Chang, “Signature scheme based on two hard problems simultaneously,” in
*Proceedings of the 17th International Conference on Advanced Information Networking and Application (AINA '03)*, pp. 557–560, Xi'an, China, March 2003. - M. S. Hwang, C. C. Yang, and S. F. Tzeng, “Improved digital signature scheme based on factoring and discrete logarithms,”
*Journal of Discrete Mathematical Sciences Cryptography*, vol. 5, no. 2, pp. 152–155, 2002. View at Google Scholar - L.-H. Li, S. F. Tzeng, and M. S. Hwang, “Improvement of signature scheme based on factoring and discrete logarithms,”
*Applied Mathematics and Computation*, vol. 161, no. 1, pp. 49–54, 2005. View at Publisher · View at Google Scholar · View at Scopus - H. Qian, Z. Cao, and H. Bao, “Cryptanalysis of Li-Tzeng-Hwang's improved signature schemes based on factoring and discrete logarithms,”
*Applied Mathematics and Computation*, vol. 166, no. 3, pp. 501–505, 2005. View at Publisher · View at Google Scholar · View at Scopus - L. Harn, “Group-oriented (t, n) threshold digital signature scheme and digital multisignature,”
*IEE Proceedings: Computers and Digital Techniques*, vol. 141, no. 5, pp. 307–313, 1994. View at Publisher · View at Google Scholar · View at Scopus - N. Koblitz, A. Menezes, and S. Vanstone, “The state of elliptic curve cryptography,”
*Designs, Codes, and Cryptography*, vol. 19, no. 2-3, pp. 173–193, 2000. View at Google Scholar · View at Scopus