| 摘要 |
<p>A method is provided for generating and verifying a digital signature of a message m. This method requires a pair of corresponding public and secret keys (y and x) for each signer, as well as a pair of public and secret values (r and k) generated for each message by the signer. The public value r is calculated according to the rule r = (gk mod p) mod q. A value s is then selected according to the rule s = k-1(H(m) + xr) mod q where H is a known conventional hashing function. The message m, along with the signature (r, s) is then transmitted. When the transmitted signal is received a verification process is provided. The received values of r and s are tested to determine whether they are congruent to 0 mod q. Additionnally, r is tested to determine whether it is equal to v mod q, where v is computed from r, s, m and y. For legitimately executed signatures, v = gk mod p.</p> |
