Accelerating DSA Signature Generation

Abstract

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⁻¹ 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⁻¹ mod q). The result is that we can generate DSA signatures more efficiently than the standard method.

Keywords:

• digital signature
• DSA
• public-key cryptography
• random number generator
• RSA

Additional information

Notes on contributors

Gwoboa Horng

Gwoboa Horng received the B.S. degree in Electrical Engineering from National Taiwan University in 1981 and the M.S. and Ph.D. degrees from University of Southern California in 1987 and 1992, respectively, all in Computer Science. Since 1992, he has been on the faculty of the Department of Computer Science and Engineering at National Chung-Hsing University, Taichung, Taiwan, R.O.C. His current research interests include artificial intelligence, cryptography, and information security.