February 26, 2002
Practical Aspects of Modern Cryptography
8
The Digital Signature Algorithm
n
To sign a 160-bit message
M
,
n
Generate a random integer
k
with
0 <
k
<
q
,
n
Compute
r
= (
g
k
mod
p
) mod
q
,
n
Compute
s
= ((M+
xr
)/
k
) mod
q
.
n
n
The pair
(
r
,
s
)
is the signature on
M
.