An efficient DSA approach for batch verification

Abstract EN

Batch verification is the ability to verify multiple digital signatures together.

This method can reduce computational cost required to verify these signatures individually.

In this paper, we present a fast algorithm based on DSA-type algorithm.

Our algorithm gives the same level of security as compared with Bellare et al.

algorithm and at the same time it is more efficient since it does not require computing of modular inverse neither at the signing side nor at the verifying side.

The proposed algorithm need to compute modular inverse at generating public key and this is done once.