A New Signature Scheme Based on Multiple Hard Number Theoretic Problems

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.


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, internetbased 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][5][6][7][8][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.

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-toone interactions between a signer and a verifier to execute the system initialization phase, the key generation phase, 2 ISRN Communications and Networking the signature generation phase, and the signature verification phase, described as follows.

System Initialization Phase.
The system initialization phase proceeds with the following commonly required parameters over the defined multiplicative groups. A oneway 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 h(·) whose output is a t-bitlength. In practice, we take t = 128; (2) a large prime p, and n is a factor of p − 1 and also the product of two safe primes, T and L, where n = TL.
where gcd(a, b) denotes the greatest common divisor of a and b.

Key Generation Phase.
In this phase, we do the following steps.
(3) Select at random an integer x ∈ Z * p . (4) Compute the public number y ≡ g x (mod p).
The public and secret keys of the signature scheme are now, respectively, given by the pairs of (e, y) and (d, x).

Signature Generation Phase.
To create a signature for the message M, 1 < M < n, the signer first hashes the message to obtain h(M). Next, the signer randomly chooses a secret integer, r, 1 < r < n such that gcd(r, n) = 1 and then computes K ≡ g r (mod p). The signer does the following steps.
Then the original signer publishes (K, v) as the signature of the message M.

Signature Verification
Phase. The verifier confirms the validity of the signature (K, v) for M as follows.
(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

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.

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. 2 mod p, and Adv has to ways two do this. First, he or she fixes the number K, computes α ≡ K K y −(h(M)) 2 mod p and finally solves g v e ≡ α mod p, for v. Second, he or she fixes the number v, computes β ≡ g v e y (h(M)) 2 mod p, and solves K K ≡ β mod p for K. 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.

Attack 3.
Adv may also try collecting t valid signatures (K j , v j ) on message M j to find the valuable secret keys. In this case, Adv has t equations as follows: where j = 1, 2, . . . , t. Note that, the above t equations have (t + 1) variables, that is, x and r j . 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.

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

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 n and can find the number d. However, he cannot compute s 1 and s 2 since no information is known for ξ and thus fails to compute v.

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 T MUL , where T EXP = 240T MUL given by Koblitz et al. [14].
Finally, the communication costs or size of parameters of the scheme (both signature generation and verification) is 7|n| + 2|p|, where |a| denotes the bitlength of a.

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 963T MUL + 2T SRT + T HAS and 962T MUL + T HAS , respectively, for both signature generation and verification. We considered some possible attacks and demonstrated that the proposed scheme would be secure against those attacks.