Page "Digital Signature Algorithm" Paragraph 25

The modular inverse k < sup >− 1 </ sup > mod q is the second most expensive part, and it may also be computed before the message hash is known.

It may be computed using the extended Euclidean algorithm or using Fermat's little theorem as k < sup > q − 2 </ sup > mod q.