Cryptosecurity, Digital Signatures, Asymmetric Cryptography, Hash Function, Secure Communication.
2-4. The signature is the pair (r, s). Verification: Verify that r and s are in the interval [1, n-1]. Compute w = s^(-1) mod n. Compute u1 = H(m) * w mod n and u2 = r * w mod n. Compute the point R' = u1 * G + u2 * Q. If the x-coordinate of R' mod n equals r, the signature is valid. Photo by Max