Accelerating DSA Signature Generation
Gwoboa Horng · Cryptologia · 2015
The main contribution of this article is to show how the generation of a random integer k modulo q and the subsequent computation of k−1 mod q, during the signature generation process of the NIST digital signature algorithm (DSA), can be replaced by the simultaneous generation of a pair (k, k−1 mod q). The result is that we can generate DSA signatures more efficiently than the standard method.