February 26, 2002
Practical Aspects of Modern Cryptography
9
The Digital Signature Algorithm
nA signature (r,s) on M is verified as follows:
nCompute w = 1/s mod q,
nCompute a = wM mod q,
nCompute b = wr mod q,
nCompute v = (gayb mod p) mod q.
n
nAccept the signature only if v = r.
n