Abstract: We are all know, the DSA scheme is not secure in situations of coinciding or revealing of session key. In this paper, we propose a solution that improves the DSA digital signature scheme in fields Z_p The idea of our solution is developing the DSA scheme, in which its security is based on discrete logarithm problem on ring Z_n, with the modulo number n is a product of two distinct primes. The proposed scheme is secure from the situations of revealing or coinciding of session key. Furthermore, in our scheme, if the secret key is revealed, it can’t be forged by adversaries, for this advantages, it can be applied into practice.
Keyword
Digital Signature Scheme, discrete logarithm problem, Hash Function.