In this scheme, the signer chooses a private key $x$ and a public key $y = g^x \mod p$, where $g$ is a generator of the group modulo $p$. To sign a message $M$, the signer chooses a random value $k$ and computes the signature $(r, s)$ as follows:
- $r = g^k \mod
Show more…